Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| 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) |
| From: | haberg@matematik.su.se (Hans Aberg) |
| Newsgroups: | comp.compilers |
| Date: | 4 Feb 2004 21:30:59 -0500 |
| Organization: | Mathematics |
| References: | 04-02-014 |
| Keywords: | parse |
| Posted-Date: | 04 Feb 2004 21:30:59 EST |
srivatsar@yahoo.com (srivatsa) wrote:
>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.
One of the quickest is to plug it into a parser generator that supports
the algorithm you want to check. :-)
Hans Aberg
Return to the
comp.compilers page.
Search the
comp.compilers archives again.