Re: Bison version of the LALR(1) algorithm

johnl@iecc.com (John R. Levine)
7 Dec 2001 23:49:09 -0500

          From comp.compilers
Related articles
Bison version of the LALR(1) algorithm haberg@matematik.su.se (2001-11-29)
Re: Bison version of the LALR(1) algorithm pjj@cs.man.ac.uk (Pete Jinks) (2001-12-07)
Re: Bison version of the LALR(1) algorithm johnl@iecc.com (2001-12-07)
Re: Bison version of the LALR(1) algorithm haberg@matematik.su.se (2001-12-15)
Re: Bison version of the LALR(1) algorithm thp@cs.ucr.edu (2001-12-20)
| List of all articles for this month |
From: johnl@iecc.com (John R. Levine)
Newsgroups: comp.compilers
Date: 7 Dec 2001 23:49:09 -0500
Organization: I.E.C.C., Trumansburg NY USA
Keywords: yacc
Posted-Date: 07 Dec 2001 23:49:09 EST

>Can somebody give a reference to a description of the LALR(1)
>algorithm that Bison uses?


The REFERENCES file in the bison source distribution says:


Also, Bison uses a faster but less space-efficient encoding for the
parse tables (see Corbett's PhD thesis from Berkeley, "Static
Semantics in Compiler Error Recovery", June 1985, Report No. UCB/CSD
85/251), and more modern technique for generating the lookahead sets.
(See "Efficient Construction of LALR(1) Lookahead Sets" by F. DeRemer
and A. Pennello, in ACM TOPLS Vol 4 No 4, October 1982. Their
technique is the standard one now.)

Post a followup to this message

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