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

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 http://www.cs.nott.ac.uk/~nad/publications/danielsson-parser-combinators.htm... -- /NAD