Re: testing LR(0), SLR(1), etc., and item sets

haberg@matematik.su.se (Hans Aberg)
6 Oct 2003 21:28:15 -0400

          From comp.compilers
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)
| List of all articles for this month |
From: haberg@matematik.su.se (Hans Aberg)
Newsgroups: comp.compilers
Date: 6 Oct 2003 21:28:15 -0400
Organization: Mathematics
References: 03-10-017
Keywords: parse, LR(1)
Posted-Date: 06 Oct 2003 21:28:15 EDT

"Rodney M. Bates" <rbates@southwind.net> 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.
>
>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.


The GNU Bison parser generator will report departure from being
LALR(1) as "conflicts". Compiled with the --verbose option, an output
file is produced with the definition of all states, including the
actions to take on each lookahead symbol.


    Hans Aberg

Post a followup to this message

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