On Sun, Feb 24, 2013 at 8:03 PM, Roman Cheplyaka <roma@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?