Hacker News Reader

Does this parser combinator implementation handle left-recursive grammars?

Nope; you need to left-factor them unfortunately. Other parser combinators may have different implementation algorithms, but this one is naive PEG/recursive-descent so you need to help it out manually otherwise it'll just infinite-recurse

Yeah, it's much easier to write a parser combinator implementation that doesn't support it. Thanks for answering.

For those interested, here is an article about a parser combinator implementation in Racket that supports left-recursive grammars:

https://epsil.github.io/gll/

Is it possible to detect and warn about the left recursion? Assuming a data structure representing the grammar is built at runtime to be interpreted.

Won't it be possible to detect the left recursion instead of going into an infinite loop?

Reply on news.ycombinator.com