Related articles |
---|
[9 earlier articles] |
Re: Full LR(1) parser generator Hyacc 0.9 release jdenny@ces.clemson.edu (Joel E. Denny) (2008-02-23) |
Re: Full LR(1) parser generator Hyacc 0.9 release cfc@TheWorld.com (Chris F Clark) (2008-02-24) |
Re: Full LR(1) parser generator Hyacc 0.9 release jdenny@ces.clemson.edu (Joel E. Denny) (2008-02-25) |
Re: Full LR(1) parser generator Hyacc 0.9 release paul@paulbmann.com (Paul B Mann) (2008-02-26) |
Re: Full LR(1) parser generator Hyacc 0.9 release cfc@TheWorld.com (Chris F Clark) (2008-02-27) |
Re: Full LR(1) parser generator Hyacc 0.9 release jdenny@ces.clemson.edu (Joel E. Denny) (2008-02-27) |
Re: Full LR(1) parser generator Hyacc 0.9 release jdenny@ces.clemson.edu (Joel E. Denny) (2008-02-27) |
Re: Full LR(1) parser generator Hyacc 0.9 release cfc@TheWorld.com (Chris F Clark) (2008-02-28) |
Re: Full LR(1) parser generator Hyacc 0.9 release cfc@shell01.TheWorld.com (Chris F Clark) (2008-02-28) |
Re: Full LR(1) parser generator Hyacc 0.9 release jdenny@ces.clemson.edu (Joel E. Denny) (2008-02-28) |
Re: Full LR(1) parser generator Hyacc 0.9 release paul@paulbmann.com (Paul B Mann) (2008-02-28) |
From: | "Joel E. Denny" <jdenny@ces.clemson.edu> |
Newsgroups: | comp.compilers |
Date: | Wed, 27 Feb 2008 21:34:59 -0500 (EST) |
Organization: | Compilers Central |
References: | 08-02-019 08-02-022 08-02-030 08-02-037 08-02-040 08-02-041 08-02-044 <Pine.SOC.4.61.0802230000570.9914@unixlab03.ces.clemson.edu> 08-02-076 <Pine.SOC.4.61.0802251216540.13590@unixlab03.ces.clemson.edu> 08-02-088 <Pine.SOC.4.61.0802271206510.25337@unixlab03.ces.clemson.edu> |
Keywords: | LR(1) |
Posted-Date: | 27 Feb 2008 22:00:31 EST |
On Wed, 27 Feb 2008, Joel E. Denny wrote:
> On Wed, 27 Feb 2008, Chris F Clark wrote:
> > Now, the one thing I don't understand (and it is relevant to the
> > discussion) is whether the either the Pager or the IELR algorithm
> > computes something different than either the LALR result or the LR
> > result?
>
> For the grammar you quoted, Pager's algorithm accepts the same language as
> LALR(1) using the weak compatibility test. IELR(1) accepts the same
> language as canonical LR(1) as it should for any grammar.
Ugh. That first sentence should read: For the grammar you quoted, Pager's
algorithm using his weak compatibility test generates parser tables that
accept the same language as LALR(1).
Return to the
comp.compilers page.
Search the
comp.compilers archives again.