inquerest
url parameter parser for rest filter inquiry (by ivanceras)
pom
PEG parser combinators using operator overloading without macros. (by J-F-Liu)
inquerest | pom | |
---|---|---|
- | 5 | |
25 | 496 | |
- | - | |
0.0 | 5.3 | |
about 4 years ago | 7 months 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.
inquerest
Posts with mentions or reviews of inquerest.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning inquerest yet.
Tracking mentions began in Dec 2020.
pom
Posts with mentions or reviews of pom.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-03-19.
-
Domain Specific Language embedded in Rust
pom
-
Analogues of nom crate.
Maybe a parser combinator library is not what you want? One alternative might be writing an expression parser without a library at all: https://matklad.github.io/2020/04/13/simple-but-powerful-pratt-parsing.html (Depending on the grammar you are parsing a Pratt parser might actually be a good fit!) A PEG might also be more suitable for your use case, like pom.
- Explanations and Examples for pom
-
Chumsky, a parser combinator crate that makes writing error-tolerant parsers with recovery easy and fun!
I saw the performance comparison against pom, pom is unfortunately quite slow compared to an handwritten parser as it boxes most (all?) parsers so you may want to compare against a handwritten parser, or at least something in the same ballpark (for reference, combine's json benchmark on the same data is about 6x faster with "good errors", when optimized to work on &str-like input it is about 12x faster, nom or a hand written parser may be another 10-20% faster than that, if I remember correctly.) From a brief skim of the code, I don't see anything that would hinder it from at least closing that gap however.
-
Whats the best parser generator for rust?
Everyone on this sub seems to be using nom. In my experience I find pom to be intuitive and have to write less code. Maybe it's just me I'm having a hard time understanding nom which has a lot of function calls rather than less.If you compare both the json examples on both projects, the pom example is a lot clearer to read and a lot shorter.
What are some alternatives?
When comparing inquerest and pom you can also consider the following projects:
git-journal - The Git Commit Message and Changelog Generation Framework :book:
nom - Rust parser combinator framework
chomp - A fast monadic-style parser combinator designed to work on stable Rust.
pest - The Elegant Parser
rust-csv - A CSV parser for Rust, with Serde support.
combine - A parser combinator library for Rust
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
lalrpop - LR(1) parser generator for Rust
queryst - Rust query string parser with nesting support