|table compression firstname.lastname@example.org (Ralph Boland) (2001-11-04)|
|Re: table compression Olivier.Ridoux@irisa.fr (Olivier Ridoux) (2001-11-08)|
|Re: table compression email@example.com (2001-11-08)|
|Re: table compression heng@Ag.arizona.edu (Heng Yuan) (2001-11-08)|
|Re: table compression firstname.lastname@example.org (Dennis Mickunas) (2001-11-08)|
|Table compression email@example.com (Leonardo Teixeira Passos) (2005-09-27)|
|Re: Table compression firstname.lastname@example.org (2005-09-30)|
|Re: Table compression email@example.com (2005-09-30)|
|Re: Table compression firstname.lastname@example.org (Cleo Saulnier) (2005-09-30)|
|Re: Table compression Peter_Flass@Yahoo.com (Peter Flass) (2005-10-02)|
|Re: Table compression email@example.com (Paul Mann) (2005-10-02)|
|[2 later articles]|
|From:||"Dennis Mickunas" <firstname.lastname@example.org>|
|Date:||8 Nov 2001 23:18:16 -0500|
|Organization:||University of Illinois at Urbana-Champaign|
|Posted-Date:||08 Nov 2001 23:18:16 EST|
"Ralph Boland" <email@example.com> wrote in message
> I've been searching the literature for methods of compressing LR(1)
> (or LALR(1)) parse tables but I haven't found very much.
> I would think there would be a fair amount of research in this area.
The research was a long time ago. Have a look at the *real*
Aho-Ullman book: "The Theory of Parsing, Translation and Compiling --
Volume II: Compiling" Prentice-Hall (1973). There's a full chapter on
LR table compression. Also see Marc Joliat's PhD thesis from Toronto:
"On the Reduced Matrix Representation of LR(k) Parser Tables,"
CSRG-TR-28 (October, 1973).
Return to the
Search the comp.compilers archives again.