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

"DevInstinct" <martin_lapierre@videotron.ca>
16 Jul 2006 01:05:40 -0400

          From comp.compilers
Related articles
Why LL(1) Parsers do not support left recursion? martin_lapierre@videotron.ca (DevInstinct) (2006-07-16)
RE: Why LL(1) Parsers do not support left recursion? qtj-query@shaw.ca (Quinn Tyler Jackson) (2006-07-16)
Re: Why LL(1) Parsers do not support left recursion? DrDiettrich1@aol.com (Hans-Peter Diettrich) (2006-07-18)
Re: Why LL(1) Parsers do not support left recursion? tom@infoether.com (Tom Copeland) (2006-07-18)
Re: Why LL(1) Parsers do not support left recursion? wyrmwif@tsoft.org (SM Ryan) (2006-07-18)
Re: Why LL(1) Parsers do not support left recursion? rahul.chaudhry@gmail.com (Rahul Chaudhry) (2006-07-18)
Re: Why LL(1) Parsers do not support left recursion? cfc@shell01.TheWorld.com (Chris F Clark) (2006-07-19)
[30 later articles]
| List of all articles for this month |
From: "DevInstinct" <martin_lapierre@videotron.ca>
Newsgroups: comp.compilers
Date: 16 Jul 2006 01:05:40 -0400
Organization: http://groups.google.com
Keywords: LL(1), question
Posted-Date: 16 Jul 2006 01:05:39 EDT

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!


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.