Related articles |
---|
Practical LALR(1) grammer? weltraum@astrocat.de (2005-06-12) |
Re: Practical LALR(1) grammer? haberg@math.su.se (2005-06-13) |
Re: Practical LALR(1) grammer? haberg@math.su.se (2005-06-13) |
Re: Practical LALR(1) grammer? bluemalov@hotmail.com (Andrew Wilson) (2005-06-13) |
Re: Practical LALR(1) grammer? d148f3wg02@sneakemail.com (Karsten Nyblad) (2005-06-16) |
Re: Practical LALR(1) grammer? haberg@math.su.se (2005-06-18) |
An "open" letter to Karsten Nyblad (and other compiler compiler implem cfc@shell01.TheWorld.com (Chris F Clark) (2005-06-18) |
Re: An "open" letter to Karsten Nyblad (and other compiler compiler im vtsikoza@yahoo.com (2005-06-21) |
From: | haberg@math.su.se (Hans Aberg) |
Newsgroups: | comp.compilers |
Date: | 13 Jun 2005 10:50:59 -0400 |
Organization: | Mathematics |
References: | 05-06-074 |
Keywords: | parse, LALR |
Posted-Date: | 13 Jun 2005 10:50:59 EDT |
weltraum@astrocat.de wrote:
> I don't understand the "magic" of LALR(1) yet (in contrast to SLR(1) ),
There is no magic to LALR(1): it is just a cut down version of LR(1), to
save some, in the past, precious computer memory.
> and would be happy if someone could give me some practical LALR(1)
> grammar snippets, which one could recognize as part of some (existing)
> language.
Look around in software packets for the .y file. Or give some more
specific hints as to what you are after for.
--
Hans Aberg
[I agree, the main appeal of LALR is that its tables used up less of
a 64K address space. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.