Re: (long) conflict resolution in action table

Tim Newsham <newsham@lava.net>
14 Sep 2003 17:04:29 -0400

          From comp.compilers
Related articles
(long) conflict resolution in action table newsham@lava.net (Tim Newsham) (2003-09-04)
Re: (long) conflict resolution in action table derkgwen@HotPOP.com (Derk Gwen) (2003-09-09)
Re: (long) conflict resolution in action table haberg@matematik.su.se (2003-09-09)
Re: (long) conflict resolution in action table newsham@lava.net (Tim Newsham) (2003-09-09)
Re: (long) conflict resolution in action table newsham@lava.net (Tim Newsham) (2003-09-14)
| List of all articles for this month |
From: Tim Newsham <newsham@lava.net>
Newsgroups: comp.compilers
Date: 14 Sep 2003 17:04:29 -0400
Organization: Compilers Central
References: 03-09-014 03-09-034
Keywords: parse, SLR
Posted-Date: 14 Sep 2003 17:04:29 EDT

Derk Gwen <derkgwen@hotpop.com> wrote:
: Grrr. Arrgh.


: If you want LR(k), there are LR(k) parser generators available. Two
[...]
: If you want to use a precedence parser, the Aho and Ullman Theory of
: Parsing discusses a number of different precedence parsing schemes.


: Yacc is the Microsoft of parser generators. An inadequate tool, widely
[...]


I'm not using yacc. I'm using a GLR parser that uses SLR tables. In
order to keep the grammar simple but reduce the number of ambiguities,
I am using precedence rules to filter out some of the undesired
parses.


... but thank you for your concern.


: Derk Gwen http://derkgwen.250free.com/html/index.html


Tim N.

Post a followup to this message

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