Re: Preview in grammar

"Ulrich Frank" <franku@fmi.uni-passau.de>
11 May 2006 10:49:42 -0400

          From comp.compilers
Related articles
[3 earlier articles]
Re: Preview in grammar pbmann@gmail.com (2006-05-09)
Re: Preview in grammar haberg@math.su.se (2006-05-09)
Re: Preview in grammar DrDiettrich@compuserve.de (Hans-Peter Diettrich) (2006-05-09)
Re: Preview in grammar franku@fmi.uni-passau.de (Ulrich Frank) (2006-05-09)
Re: Preview in grammar cfc@shell01.TheWorld.com (Chris F Clark) (2006-05-11)
Re: Preview in grammar franku@fmi.uni-passau.de (Ulrich Frank) (2006-05-11)
Re: Preview in grammar franku@fmi.uni-passau.de (Ulrich Frank) (2006-05-11)
Re: Preview in grammar Meyer-Eltz@t-online.de (Detlef Meyer-Eltz) (2006-05-12)
Re: Preview in grammar cfc@shell01.TheWorld.com (Chris F Clark) (2006-05-12)
Re: Preview in grammar pbmann@gmail.com (2006-05-12)
Re: Preview in grammar pbmann@gmail.com (2006-05-12)
Re: Preview in grammar pbmann@gmail.com (2006-05-15)
Re: Preview in grammar cfc@shell01.TheWorld.com (Chris F Clark) (2006-05-15)
| List of all articles for this month |
From: "Ulrich Frank" <franku@fmi.uni-passau.de>
Newsgroups: comp.compilers
Date: 11 May 2006 10:49:42 -0400
Organization: http://groups.google.com
References: 06-05-01106-05-031
Keywords: parse, LR(1)
Posted-Date: 11 May 2006 10:49:42 EDT

Hi Chris,


thanks for this detailed message.
If I use an LR parser (do you know a good one - LR parser generator?)
it is clear. There you only have to differentiate between the actions
(shift, reduce, error, accept).
If I use an LALR parser, which merges equal states it is not clear.
Well, I understood your algorithm but how can I unpack the tables of an
LALR parser? To do so, I would have to modify the source code of the
parser generator which generates the parser out of the grammar. Or is
there a possibility to unpack the packed actiontable??


Thanks for your help.
Uli


Post a followup to this message

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