lalrpop VS rust-peg

And some related parser tools: - https://github.com/kevinmehall/rust-peg - https://github.com/pest-parser/pest - https://github.com/lalrpop/lalrpop

lalrpop

Rust is a very nice langage for implementing compilers, and has a nice ecosystem for it (logos, rust-peg, lalrpop, astmaker -- this one is mine --, etc...).

rust-langdev has a lot of libraries for building compilers in Rust. Perhaps you could use these to make your implementation easier, and revisit it later if you want to build things from scratch. I'd suggest logos for lexing, LALRPOP / chumsky for parsing, and rust-gc for garbage collection.

Hi! For one of my projects I am currently using lalrpop (https://github.com/lalrpop/lalrpop/tree/master/doc/calculator/src), which is far from complete, but has the basic syntax I was looking for. I took some examples and worked around some lexer stuff but I’m currently happy with it. If you use it and have Intellij stuff installed, you can also use a plug-in for highlighting and SOMETIMES error checking. Otherwise, even VSCode had a great plug-in for highlighting!

How would you compare and contrast this with, say, lalrpop?

lalrpop is great. It's a completely different approach from nom, but for parsing a programming language, I would at least consider it. RustPython uses it.

I presume LALRPOP handles left recursion just fine.

I wanted to share an experimental side project I have been working on for some time. I constantly use commands like `jq` and `yq` for processing structured data in my day job and I was curious if a similar idea could be applied to images.

Another goal of mine was to get some exposure to with rust. I discovered the LALRPOP parser generator which really helped moved the project along (https://github.com/lalrpop/lalrpop)

The key point here is that we are going to depend on the lalrpop library to generate the parser based on the formal grammar we define. Note that we have it as part of the [build-dependencies] section and we only depend on a tiny utility crate called lalrpop-util at runtime. The reason for that is the main lalrpop "magic" would happen during the crate compilation (in the build.rs file) when lalrpop would generate the deterministic pushdown automaton based on our grammar. The code generation logic is not required to be part of our interpreter, we only need a few utility methods from the lalrpop-util for the automaton to operate. You might have noticed that we also enable the lexer feature of lalrpop, because we are going to use lexer provided by lalrpop as well (please refer to the Part I if you do not know what the lexer is).

And some related parser tools: - https://github.com/kevinmehall/rust-peg - https://github.com/pest-parser/pest - https://github.com/lalrpop/lalrpop

Rust is a very nice langage for implementing compilers, and has a nice ecosystem for it (logos, rust-peg, lalrpop, astmaker -- this one is mine --, etc...).

My peg crate is a parser generator that supports arbitrary token types as input. See https://github.com/kevinmehall/rust-peg/blob/master/tests/run-pass/tokens.rs for an example.

The one rust parser-generator I used is PEG

The two parser generators that I am aware of are lalrpop and PEG. There both great, and have seen some use by languages that have been written in Rust.

rust-peg

I wanted to create a parser for Apertium Stream. In 2014, I used Whittle in Ruby. If this year were 2001, I would use Lex/Yacc. Anyway, this year is 2021. I wanted to create this parser in Rust. I tried to find what is similar to Lex/Yacc. I found Rust-Peg. I found a link to Nom from Rust-Peg's document. My first impression was Nom example is easy to read. At least, its document claimed Nom is fast.

The peg crate has a resolved issue about this.

I don't really know that much about parsing and grammars, other than what I've learned about regular languages and expressions and context-free languages in a standard Theory of Comp course from my university. I basically just learned peg by reading the Wikipedia article on PEGs, reading the crate documentation to understand the syntax, and then looking at some of the peg examples on their GitHub to understand how it works in practice.