Re: Preview in grammar

pbmann@gmail.com
12 May 2006 00:49:06 -0400

          From comp.compilers
Related articles
[7 earlier articles]
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: pbmann@gmail.com
Newsgroups: comp.compilers
Date: 12 May 2006 00:49:06 -0400
Organization: http://groups.google.com
References: 06-05-01106-05-037
Keywords: parse
Posted-Date: 12 May 2006 00:49:06 EDT

When I implemented this algorithm, it was not necessary to
unpack the parser tables. You have the parser algorithm
already. All you have to do is modify it with additional stacks
for the purpose of restoring the parse stack and parse state for
a trial parse with all terminal symbols, while making a list of
allowable NEXT tokens.


Paul Mann
http://parsetec.com


Post a followup to this message

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