[Haskell-cafe] Parser left recursion

[Kim-Ee Yeoh]

On Sun, Feb 24, 2013 at 8:03 PM, Roman Cheplyaka <roma at ro-che.info> wrote:

> 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.
>

Which grammar are we discussing here? The one you outlined?

A ::= B A

As I pointed out earlier, this doesn't model a program (e.g. a compiler).
It's an OS! What am I missing?

-- Kim-Ee
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20130224/e2c7442b/attachment.htm>