Why LL(1) Parsers do not support left recursion?

From: "DevInstinct" <martin_lapierre@xxxxxxxxxxxx>
Date: 14 Jul 2006 11:16:50 -0700

Hi, first of all, I'm not an expert in the theory of computation.

I've read about LL(1) parsers and I have seen that they do not support
left recursion, because it is said that it would lead to infinite
recursivity.

My question: why is that? In which case a LL(1) parser can enter
infinite recursivity?

I can't find a good example that demonstrates that.

Thanks!

.

Follow-Ups:
- Re: Why LL(1) Parsers do not support left recursion?
  - From: Michael J. Fromberger

Prev by Date: Re: Mapping rationals to binary strings while preserving order
Next by Date: Re: solving #SAT in poly(number of vars) and exp(number of clauses)?
Previous by thread: SQL query plan question
Next by thread: Re: Why LL(1) Parsers do not support left recursion?
Index(es):
- Date
- Thread

Relevant Pages

Why LL(1) Parsers do not support left recursion?
... I've read about LLparsers and I have seen that they do not support ... infinite recursivity? ...
(comp.compilers)
Re: Simple arithmetic parser example
... read up on "recursive descent parsers". ... looks quite simple although the recursivity may be a bad idea ... for long expressions. ... have to push and pop state using an explicit stack anyway. ...
(comp.lang.c)