Time complexity of LR parser generation

alpanad@cse.iitk.ac.in
5 Mar 2006 02:17:40 -0500

          From comp.compilers

Related articles
Time complexity of LR parser generation alpanad@cse.iitk.ac.in (2006-03-05)
Re: Time complexity of LR parser generation wyrmwif@tsoft.org (SM Ryan) (2006-03-06)
Re: Time complexity of LR parser generation schmitz@i3s.unice.fr (Sylvain Schmitz) (2006-03-06)
| List of all articles for this month |

From: alpanad@cse.iitk.ac.in
Newsgroups: comp.compilers
Date: 5 Mar 2006 02:17:40 -0500
Organization: http://groups.google.com
Keywords: LR(1), question

Can anyone throw some ligth on this or give me a relevant link? I.e.
what is the time complexity of the LR parser generation? Is it
exponenetial in the size of grammar?


Thanks



Post a followup to this message

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