|testing LR(0), SLR(1), etc., and item sets firstname.lastname@example.org (Rodney M. Bates) (2003-10-04)|
|Re: testing LR(0), SLR(1), etc., and item sets email@example.com (Chris F Clark) (2003-10-06)|
|Re: testing LR(0), SLR(1), etc., and item sets firstname.lastname@example.org (2003-10-06)|
|testing LR(0), SLR(1), etc., and item sets email@example.com (Salvador V. Cavadini) (2003-10-12)|
|Re: testing LR(0), SLR(1), etc., and item sets firstname.lastname@example.org (2003-10-27)|
|From:||"Rodney M. Bates" <email@example.com>|
|Date:||4 Oct 2003 14:48:39 -0400|
|Organization:||EarthLink Inc. -- http://www.EarthLink.net|
|Posted-Date:||04 Oct 2003 14:48:39 EDT|
For some grammar design experiments, I need a tool that will:
1) test a grammar for LR(0), SLR(1), and LALR(1).
2) print the closed item sets.
3) print the lookahead sets for the varios constructions.
The descriptions on the compiler tools page are not set up with this
kind of usage in mind, and it would take quite a bit of work to
dowload lots of them, plus the various needed language
implementations, etc. and check them out. If anybody already knows
something about this, it would help. Thanks.
Rodney M. Bates
Return to the
Search the comp.compilers archives again.