Quick way to recognize grammar type

srivatsar@yahoo.com (srivatsa)
1 Feb 2004 12:46:04 -0500

          From comp.compilers
Related articles
Quick way to recognize grammar type srivatsar@yahoo.com (2004-02-01)
Re: Quick way to recognize grammar type haberg@matematik.su.se (2004-02-04)
Re: Quick way to recognize grammar type joachim.durchholz@web.de (Joachim Durchholz) (2004-02-04)
Re: Quick way to recognize grammar type cfc@shell01.TheWorld.com (Chris F Clark) (2004-02-04)
Re: Quick way to recognize grammar type scavadini@ucse.edu.ar (2004-02-08)
Re: Quick way to recognize grammar type tbauer@cadrc.calpoly.edu (Tim Bauer) (2004-02-08)
| List of all articles for this month |
From: srivatsar@yahoo.com (srivatsa)
Newsgroups: comp.compilers
Date: 1 Feb 2004 12:46:04 -0500
Organization: http://groups.google.com
Keywords: parse, question
Posted-Date: 01 Feb 2004 12:46:04 EST

Hello,


Is there any way of determining quickly if a given grammar is one of
LL(0)/LR(0)/LALR/LR(1). I know that we can construct the set of items
and hence the parsing table. But I am looking for some tricks/tips by
which we can quickly determine if the grammar is one of the above four
types.


Thanks in advance,
Srivatsa.

Post a followup to this message

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