| Related articles |
|---|
| testing LR(0), SLR(1), etc., and item sets rbates@southwind.net (Rodney M. Bates) (2003-10-04) |
| Re: testing LR(0), SLR(1), etc., and item sets cfc@world.std.com (Chris F Clark) (2003-10-06) |
| Re: testing LR(0), SLR(1), etc., and item sets haberg@matematik.su.se (2003-10-06) |
| testing LR(0), SLR(1), etc., and item sets scavadini@ucse.edu.ar (Salvador V. Cavadini) (2003-10-12) |
| Re: testing LR(0), SLR(1), etc., and item sets jfortes@dis.ulpgc.es (2003-10-27) |
| From: | jfortes@dis.ulpgc.es |
| Newsgroups: | comp.compilers |
| Date: | 27 Oct 2003 15:59:34 -0500 |
| Organization: | Compilers Central |
| References: | 03-10-017 |
| Keywords: | parse, tools |
| Posted-Date: | 27 Oct 2003 15:59:34 EST |
"Rodney M. Bates" wrote:
> 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.
In http://serdis.dis.ulpgc.es/~ii-pl/ftp/DR/ there is a tool named aut
(in the form of Linux -static executable) along with its user manual
that I think will serve your
purpose.
José Fortes
Return to the
comp.compilers page.
Search the
comp.compilers archives again.