[Haskell-cafe] Parsec-like parser combinator that handles left recursion?

Nils Anders Danielsson nad at Cs.Nott.AC.UK
Wed Dec 9 10:51:02 EST 2009

On 2009-12-08 16:11, S. Doaitse Swierstra wrote:
> In principle it is not possible to parse left-recursive grammars [...]

I suspect that this statement is based on some hidden assumption. It
/is/ possible to parse many left recursive grammars using parser
combinators, without rewriting the grammars or representing the cycles
in the grammars explicitly. See the following paper draft:

  Total Parser Combinators


More information about the Haskell-Cafe mailing list