chumsky VS winnow

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!

https://github.com/zesterer/chumsky

there’s also chumsky: https://github.com/zesterer/chumsky

We are using technique called parser combinator. And we are using a library chumsky to write parser combinators.

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.

The examples that come with chumsky and the chumsky tutorial and guide all define their parsers using closures.

Parser: https://crates.io/crates/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.

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!

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).

Checkout https://github.com/zesterer/chumsky or https://github.com/rust-bakery/nom

I truly love Nom, it made parsing really fun. I suggest trying out https://docs.rs/winnow which is a fork of Nom with a lot of nice features, I find it much more usable.

I feel like I'll have to read up some more to have the background to fully understand the article but one thing I wanted to point out is a difference between `fn rand_int(rand: &mut Random) -> i64` and `fn rand_int(ran: Random) -> (i64, Random)`, at least in Rust. With the version that moves `Random`, the return type is bigger and may spill over from registers to the stack which may cause a significant slow down, more than the code of Vale's generation check, I suspect.

I've run into this with my parser combinator library, winnow [0], and am considering switching from the nicer functional model of moving to the more imperative model of `&mut` [1].

[0]: https://docs.rs/winnow/latest/winnow/

[1]: https://github.com/winnow-rs/winnow/issues/72

Done. For people that want to follow this, here is the link.

winnow, fork of nom

What are your thoughts on https://github.com/winnow-rs/winnow/pull/199 ?