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

kamal <kamalpr@hp.com>
Tue, 3 Jun 2008 04:06:23 -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: kamal <kamalpr@hp.com>
Newsgroups: comp.compilers
Date: Tue, 3 Jun 2008 04:06:23 -0700 (PDT)
Organization: Compilers Central
References: 08-05-075 08-05-093 08-05-095
Keywords: parse, LR(1)
Posted-Date: 04 Jun 2008 09:52:50 EDT

On May 30, 9:26 am, "Thomas Chen" <txc...@gmail.com> wrote:


> That said, I'm very interested in this field and also very willing to
> exchange ideas with people. I would be most glad to be able to have
> more communication with you on various issues and possibilities of
> LR(k).


One way of doing look aheads is what is done in many commercial front-
ends. The lexer does a context-sensitive token matching and returns an
appropriate token thereby resolving ambiguities. . yacc/bison has a
facility to generate a re-entrant parser, so for specific constructs,
you could use specific rules and have a grammar for each. A C++
version is one that probably does this job better.


regards
-kamal

Post a followup to this message

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