Hacker News Reader

Comment by de_keyboard | Hacker News Reader

I'm interested in how this library handles recursion, e.g.

   Expr = '(' Expr ')'
        | Expr '+' Expr

It's very easy to get stuck into infinite loops when handling recursion in parser-combinator libraries.

Does this library improve on that?

Chumsky still has trouble with left recursion, like many PEG parsers, but it's fairly easy to rewrite such grammars without left recursion as demonstrated in the tutorial: https://github.com/zesterer/chumsky/blob/master/tutorial.md