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

Scott Burson <FSet.SLB@gmail.com>
Sun, 8 Jun 2008 20:20:58 -0700 (PDT)

          From comp.compilers
Related articles
[2 earlier articles]
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: Scott Burson <FSet.SLB@gmail.com>
Newsgroups: comp.compilers
Date: Sun, 8 Jun 2008 20:20:58 -0700 (PDT)
Organization: Compilers Central
References: 08-05-075
Keywords: parse, LR(1)
Posted-Date: 09 Jun 2008 19:05:02 EDT

On May 18, 2:27 pm, Tom <txc...@gmail.com> wrote:
> I have searched on Internet and the comp.compilers news group for
> LR(k) parser generator implementation where k > 1.


Another approach is regular lookahead, where for each conflict the
parser generator attempts to construct a regular expression to be
applied to the lookahead tokens such that the success or failure of
the match will disambiguate the conflict. You can find some papers on
this by Bermudez and Schimpf.


-- Scott


Post a followup to this message

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