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

Hans Aberg <haberg_20080406@math.su.se>
Tue, 20 May 2008 13:56:31 +0200

          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)
[1 later articles]
| List of all articles for this month |
From: Hans Aberg <haberg_20080406@math.su.se>
Newsgroups: comp.compilers
Date: Tue, 20 May 2008 13:56:31 +0200
Organization: Aioe.org NNTP Server
References: 08-05-075
Keywords: LR(1)
Posted-Date: 20 May 2008 11:22:26 EDT

Tom wrote:
> I have searched [...] for
> LR(k) parser generator implementation where k > 1.
...
> Would it be meaningful to implement one? I'm very interested to know.


  From the point of view of practial programming, GLR might be preferred.
For example Bison has one based on LALR(1).


      Hans


Post a followup to this message

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