Re: LR(1) Parser Generator

"Sönke Kannapinn" <soenke.kannapinn@wincor-nixdorf.com>
2 Aug 2001 02:31:00 -0400

          From comp.compilers
Related articles
[3 earlier articles]
Re: LR(1) Parser Generator mike@dimmick.demon.co.uk (Mike Dimmick) (2001-07-18)
Re: LR(1) Parser Generator tej@melbpc.org.au (Tim Josling) (2001-07-23)
Re: LR(1) Parser Generator haberg@matematik.su.se (2001-07-23)
Re: LR(1) Parser Generator david@tribble.com (David R Tribble) (2001-07-23)
Re: LR(1) Parser Generator cotemark@globetrotter.net (Mark) (2001-07-23)
Re: LR(1) Parser Generator thp@cs.ucr.edu (2001-07-30)
Re: LR(1) Parser Generator soenke.kannapinn@wincor-nixdorf.com (Sönke Kannapinn) (2001-08-02)
Re: LR(1) Parser Generator tej@melbpc.org.au (Tim Josling) (2001-08-06)
LR(1) Parser Generator pjain@iitk.ac.in (2003-04-05)
| List of all articles for this month |
From: "Sönke Kannapinn" <soenke.kannapinn@wincor-nixdorf.com>
Newsgroups: comp.compilers
Date: 2 Aug 2001 02:31:00 -0400
Organization: Siemens Inc.
References: 01-07-060 01-07-102 01-07-115 01-07-161
Keywords: parse, LR(1)
Posted-Date: 02 Aug 2001 02:30:59 EDT

> On the order of 20 years ago, I saw a paper that gave an algorithm
> that producted LR(1) tables that were not significantly larger than
> LALR tables. As I recall, the algorithm split LALR states only when
> necessary to avoid R/R conflicts.


Pager, D. (1977). A practical general method for constructing LR(k) parsers.
Acta Informatica 7, S. 249-268.


Post a followup to this message

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