lalrpop
attoparsec
lalrpop | attoparsec | |
---|---|---|
25 | 6 | |
2,883 | 509 | |
1.2% | 0.6% | |
7.5 | 3.7 | |
15 days ago | 12 days ago | |
Rust | Haskell | |
Apache-2.0 or MIT | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
lalrpop
-
nom > regex
And some related parser tools: - https://github.com/kevinmehall/rust-peg - https://github.com/pest-parser/pest - https://github.com/lalrpop/lalrpop
-
What is the state of the art for creating domain-specific languages (DSLs) with Rust?
lalrpop
-
Letlang — Roadblocks and how to overcome them - My programming language targeting Rust
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...).
-
loxcraft: a compiler, language server, and online playground for the Lox programming language
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.
-
Question about lexer and parser generators in Rust
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!
-
Contrext-free language parsing with procedural macros
How would you compare and contrast this with, say, lalrpop?
-
Tools for creating a programming language in rust
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.
-
Best languages to design a new language in?
I presume LALRPOP handles left recursion just fine.
-
Show HN: IQ” – jq for images (using rust, LALRPOP)
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)
-
Writing a new programming language. Part II: Variables and expressions
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).
attoparsec
-
Functional Implementation of a parser?
The basic idea is to create a state monad (usually using the State monad transformer) which contains a string to be parsed, and which also lifts other monad transformers like Except for throwing syntax errors. Or you can use a parser combinator like Parser provided by a parsing library like Megaparsec or Attoparsec that defines an efficient State+Except monad transformer combination for you.
-
Haskell - Important Libraries
attoparsec
-
On a daily base in this sub
good libraries for parsing: parsec, attoparsec etc.
- Parser Combinators in Haskell
-
Splitting html tags string into list of string
The more "idiomatic" way would be to use a parser library, e.g. parsec, attoparsec, or megaparsec. But even then I think it would be a lot easier to maintain if you could preserve the angle brackets <> in the input.
-
Ditch regex for parser combinators, a Rust / nom step-by-step guide
- https://hackage.haskell.org/package/attoparsec - https://hackage.haskell.org/package/megaparsec
What are some alternatives?
pest - The Elegant Parser
megaparsec - Industrial-strength monadic parser combinator library
nom - Rust parser combinator framework
parsec - A monadic parser combinator library
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
attoparsec-parsec - An Attoparsec compatibility layer for Parsec
combine - A parser combinator library for Rust
attoparsec-data - Parsers for the standard Haskell data types
PEGTL - Parsing Expression Grammar Template Library
parsers - Generic parser combinators
chomp - A fast monadic-style parser combinator designed to work on stable Rust.
parser-combinators - Lightweight package providing commonly useful parser combinators