chumsky
Write expressive, high-performance parsers with ease. (by zesterer)
pom
PEG parser combinators using operator overloading without macros. (by J-F-Liu)
Our great sponsors
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.
chumsky
Posts with mentions or reviews of chumsky.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2024-03-24.
-
Lezer: A Parsing System for CodeMirror, Inspired by Tree-Sitter
I attempted to use this but was disheartened but the fact that it doesn't statically type node names. Tree Sitter doesn't either but it has much more of an excuse given that it targets C.
https://github.com/lezer-parser/lezer/issues/8
The dev seems mildly hostile to outside involvement too, so I moved on. These days I use Chumsky which is Rust rather than Typescript, but also way more awesome, if you can deal with the often incomprehensible compilation errors at least!
-
nom > regex
there’s also chumsky: https://github.com/zesterer/chumsky
-
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.
-
Examples of function-based parsers in chumsky? Examples of unit tests?
The examples that come with chumsky and the chumsky tutorial and guide all define their parsers using closures.
-
pep-508 v0.2.1 - Zero copy Python dependency parser written with chumsky
chumsky's zero-copy rewrite has reached its first alpha release, and I have migrated my pep-508 parser to it, as suggested in my last announcement.
-
winnow = toml_edit + combine + nom
On my side, nom is still advancing well and a new major version is in preparation, with some interesting work a new GAT based design inspired from the awesome work on chumsky, that promises to bring great performance with complex error types. 2023 will be fun for parser libraries!
-
Rust implementation of Python dependency parser for PEP 508
I am using chumsky because I like the API, but it doesn't support zero copy at the moment. Although efficiency is good to have, it is not my primary good. This will probably get supported once chumsky implements support for it (see upstream issue).
-
Question about lexer and parser generators in Rust
Checkout https://github.com/zesterer/chumsky or https://github.com/rust-bakery/nom
-
whkd: A simple hotkey daemon for Windows
Getting the basics of this project done was surprisingly easy thanks to chumsky, which I'm sure most people know about by now, and a little-known but quite ergonomic crate for handling system-wide hotkeys on Windows called windows-hotkeys.
-
Error Handling Round-Up
BTW: The sister project https://github.com/zesterer/chumsky/ pre-implement this with a relatively easy interface. But doing it manually is totally doable and something I'm working on: https://github.com/Tablam/TablaM/tree/master/src/parser
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.
-
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 chumsky and pom you can also consider the following projects:
nom - Rust parser combinator framework
pest - The Elegant Parser
combine - A parser combinator library for Rust
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
lalrpop - LR(1) parser generator for Rust
git-journal - The Git Commit Message and Changelog Generation Framework :book:
instaparse
ariadne - Python library for implementing GraphQL servers using schema-first approach.