Re: [Haskell-cafe] Parser left recursion

Hi Martin, Martin Drautzburg wrote:

...

Note that the left recursion is already visible in the grammar above, no need to convert to parser combinators. The problem is that the nonterminal Exp occurs at the left of a rule for itself.

Just a silly quick question: why isn't right-recursion a similar problem?

I think the situation is symmetric: If you match the token stream right-to-left, right-recursion is problematic. Tillmann