Re: LR(k) parser generator for k>1?

parrt <parrt@cs.usfca.edu>
Tue, 20 May 2008 10:04:10 -0700 (PDT)

          From comp.compilers
Related articles
LR(k) parser generator for k>1? txchen@gmail.com (Tom) (2008-05-18)
Re: LR(k) parser generator for k>1? haberg_20080406@math.su.se (Hans Aberg) (2008-05-20)
Re: LR(k) parser generator for k>1? joevans@gmail.com (Jason Evans) (2008-05-20)
Re: LR(k) parser generator for k>1? parrt@cs.usfca.edu (parrt) (2008-05-20)
Re: LR(k) parser generator for k>1? cfc@shell01.TheWorld.com (Chris F Clark) (2008-05-28)
Re: LR(k) parser generator for k>1? txchen@gmail.com (Thomas Chen) (2008-05-29)
Re: LR(k) parser generator for k>1? kamalpr@hp.com (kamal) (2008-06-03)
Re: LR(k) parser generator for k>1? cfc@shell01.TheWorld.com (Chris F Clark) (2008-06-03)
Re: LR(k) parser generator for k>1? FSet.SLB@gmail.com (Scott Burson) (2008-06-08)
| List of all articles for this month |
From: parrt <parrt@cs.usfca.edu>
Newsgroups: comp.compilers
Date: Tue, 20 May 2008 10:04:10 -0700 (PDT)
Organization: Compilers Central
References: 08-05-075
Keywords: LR(1), parse
Posted-Date: 20 May 2008 18:45:16 EDT

On May 18, 2:27 pm, Tom <txc...@gmail.com> wrote:
> The most important theorectical work since 1980s seem to include those
> of M. Ancona (1980s-1990s) and Terence Parr (1993). Many people share
> Terence's idea of splitting the atomic k-tuple.


Wow. I have been so focused on LL (doing LL(*) for arbitrary lookahead
now) for so long that I completely forgot I did k>1 what you had for
LR as well as LL for my thesis.


> The LR(k)
> implementation attempts I could find so far include:
...


Etienne Gagnon, creator of SableCC, told me that he has implemented my
approximate look ahead for LALR(k) k>1. you might have a look at
that.


Regards,
Terence

Post a followup to this message

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