rpds VS pest

Thanks for taking the time to provide a detailed response. Need to think on this. I had actually started a regular Clojure parser using LLVM as a hobby, but then my friend said it was better to implement this in a safe-memory and. save-concurrency language like Rust and leverage cranelift for code generation. So, now I am learning rust, lol. (Btw, Rust has a persistent data structures lib too: https://github.com/orium/rpds )

Take a look at https://github.com/orium/rpds or one of the many others.

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.

To write our grammar we will use pest. From the website:

Have you seen pest? It's probably not going to have the best performance, but you can get off the ground quickly. I've been using it lately and really dig it.

If you go with Nom, check https://github.com/Geal/nom/blob/main/doc/choosing_a_combinator.md and the examples https://github.com/Geal/nom/tree/main/examples . You can also use https://pest.rs/ , it has an editor you can try on the website.

pest