nom VS pest

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.

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.

Lots of people use nom for their parsing needs, but that's not the only game in town and there other options.

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.

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.

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

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

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!

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

I recently did a parsing project - I used the nom crate which is a functional/combinatorial style parser. Here's a really good video about the technique: https://www.youtube.com/watch?v=dDtZLm7HIJs

And some related parser tools: - https://github.com/kevinmehall/rust-peg - https://github.com/pest-parser/pest - https://github.com/lalrpop/lalrpop

I had recently completed the first year of my Computer Science class at school and will begin my second year soon. My schools' class forces the use of Java programming language, and I absolutely hated it. So, over the course of a little less than a month, I wrote my own programming language, in Rust (objectively best programming language), using pest, to be as similar to Rust as possible, but compiling to Java.

I second pest.rs. Using it is fairly intuitive and there's also a live playground on their website which is great for quickly developing and testing your AST (abstract syntax tree) parser for whatever language you're implementing.

I’ve been using pest for my own dsl resently. Couldn’t say if it’s state of the art or not, but it is definitely useful. https://pest.rs

Give https://pest.rs a try.

Maybe Pest or Nom for parsing the language.

I haven't written any template engines, but I imagine you'd want to use a proper parser generator like nom, pest, etc. to get the statefulness you need. As the famous StackOverflow answer says, you can't parse a non-regular language with a regular expression... or at least not the kind of "no lookahead/lookbehind" regex engine Rust uses.

But personally I would recommend something like Pest (which is still fairly popular). (Creates)

This was in C, and there it's a pointer arithmetic nightmare. Also, this was before I had any education in writing parsers. These days I'd probably just use a parser generator like pest.