[Haskell-cafe] Parser left recursion

[Roman Cheplyaka]

* Kim-Ee Yeoh <ky3 at atamo.com> [2013-02-24 19:56:13+0700]
> I was merely thrown off by your mention of "well-founded" and the assertion
> that you're left with a "strictly smaller" input. I don't see any of this.

It may become more obvious if you try to write two recursive descent
parsers (as recursive functions) which parse a left-recursive and a
non-left-recursive grammars, and see in which case the recursion is
well-founded and why.

Roman