lavendeux-parser
Extensible inline parser engine, the backend parsing engine for Lavendeux. (by rscarson)
nom
Rust parser combinator framework (by rust-bakery)
| lavendeux-parser | nom | |
|---|---|---|
| 1 | 85 | |
| 9 | 9,020 | |
| - | 0.9% | |
| 7.7 | 7.4 | |
| 4 months ago | 8 days ago | |
| Rust | Rust | |
| MIT License | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
lavendeux-parser
Posts with mentions or reviews of lavendeux-parser.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-04-01.
-
Released my first crate - an extensible parsing engine for mathematical expressions - thoughts welcome
crates.io | docs.rs | github
nom
Posts with mentions or reviews of nom.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-10-28.
-
Planespotting with Rust: using nom to parse ADS-B messages
Just in case you are not familiar with nom, it is a parser combinator written in Rust. The most basic thing you can do with it is import one of its parsing functions, give it some byte or string input and then get a Result as output with the parsed value and the rest of the input or an error if the parser failed. tag for example is used to recognize literal character/byte sequences.
-
Show HN: Rust nom parsing Starcraft2 Replays into Arrow for Polars data analysis
I may be the only one not familiar, but nom refers to https://github.com/rust-bakery/nom which looks like a pretty handy way to parse binary data in Rust.
-
Is this a good way to free up some memory?
Lots of people use nom for their parsing needs, but that's not the only game in town and there other options.
-
What is the state of the art for creating domain-specific languages (DSLs) with Rust?
As much as I love nom as well as other parser combinator libraries, regex-based parsers, BNF/EBNF-based parsers, etc. I always end up going back to plain old text-based char-by-char scanners.
-
What's everyone working on this week (22/2023)?
I am using nom / nom_locate to build the parser side because I've done a handful of other projects with it, and I plan to use tower-lsp to hook up the language server side.
-
Tokenizing
Look into a parsing library such as https://github.com/rust-bakery/nom
-
Something like pydantic but for just strings?
If we were in /r/learnrust I'd have recommended the nom crate for this.
- Nom: Parser Combinators Library in Rust
-
lua bytecode parser written in rust
Thanks to the flexibility of [nom](https://github.com/rust-bakery/nom), it is very easy to write your own parser in rust, read [this article](https://github.com/metaworm/luac-parser-rs/wiki/Write-custom-luac-parser) to learn how to write a luac parser
-
Should I revisit my choice to use nom?
I've been working on an assembler and right now it uses nom. While nom isn't great for error messages, good error messages will be important for this particular assembler (current code), so I've been attempting to use the methods described by Eyal Kalderon in Error recovery with parser combinators (using nom).
What are some alternatives?
When comparing lavendeux-parser and nom you can also consider the following projects:
pest - The Elegant Parser
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
lalrpop - LR(1) parser generator for Rust
tao - The TAO of cross-platform windowing. A library in Rust built for Tauri.
combine - A parser combinator library for Rust
oak - A typed parser generator embedded in Rust code for Parsing Expression Grammars
pom - PEG parser combinators using operator overloading without macros.
swc - Rust-based platform for the Web
chumsky - Write expressive, high-performance parsers with ease.