|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:||email@example.com (Hans Aberg)|
|Date:||6 Oct 2003 21:28:15 -0400|
|Posted-Date:||06 Oct 2003 21:28:15 EDT|
"Rodney M. Bates" <firstname.lastname@example.org> 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.
Return to the
Search the comp.compilers archives again.