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

"Salvador V. Cavadini" <scavadini@ucse.edu.ar>
12 Oct 2003 19:02:43 -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: "Salvador V. Cavadini" <scavadini@ucse.edu.ar>
Newsgroups: comp.compilers
Date: 12 Oct 2003 19:02:43 -0400
Organization: Compilers Central
References: 03-10-017
Keywords: parse, LR(1)
Posted-Date: 12 Oct 2003 19:02:43 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.


Some time ago we extended TP Yacc (a Yacc that generates Pascal code)
to also generate the graph of the LALR(1) automaton.
Each state in the automaton shows its kernel and closure items
(including lookahead sets), shifts and gotos are edges of different
colors.


If you are interested I can email you the modified TPYACC.


Regards


Salvador Cavadini
www.ucse.edu.ar/fma/staff/svcavadini


Post a followup to this message

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