Re: LR(1) Parser Generator

haberg@matematik.su.se (Hans Aberg)
23 Jul 2001 02:30:02 -0400

          From comp.compilers
Related articles
LR(1) Parser Generator tej@melbpc.org.au (Tim Josling) (2001-07-17)
Re: LR(1) Parser Generator marcov@toad.stack.nl (2001-07-18)
Re: LR(1) Parser Generator vmakarov@redhat.com (Vladimir Makarov) (2001-07-18)
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: haberg@matematik.su.se (Hans Aberg)
Newsgroups: comp.compilers
Date: 23 Jul 2001 02:30:02 -0400
Organization: Mathematics
References: 01-07-060
Keywords: parse, LR(1)
Posted-Date: 23 Jul 2001 02:30:02 EDT

Josling <tej@melbpc.org.au> wrote:
>Everyone says LR(1) implementations are too slow or too big but
>those books were written when mainframes has 1mb of 'core'.


Is really the generated LR(1) parser slower than the generated LALR(1)
parser? -- I mean, the latter only differ in that some states of the
former have been merged, as to compress the look-up table, but the
generated state-machine is the same.


    Hans Aberg * Email: Hans Aberg <haberg@member.ams.org>
                                    * Home Page: <http://www.matematik.su.se/~haberg/>
                                    * AMS member listing: <http://www.ams.org/cml/>

Post a followup to this message

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