Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| easy LALR code goer@midway.uchicago.edu (1993-05-11) |
| Re: easy LALR code lmcropa@noah.ericsson.se (1993-05-15) |
| Re: easy LALR code salomon@silver.cs.umanitoba.ca (1993-05-18) |
| Re: easy LALR code kjell@cse.ucsc.edu (1993-05-19) |
| Re: easy LALR code henry@zoo.toronto.edu (1993-05-20) |
| Re: easy LALR code salomon@silver.cs.umanitoba.ca (1993-05-25) |
| Newsgroups: | comp.compilers |
| From: | lmcropa@noah.ericsson.se (Roxsan Payette) |
| Keywords: | LALR, comment |
| Organization: | Ericsson Communication Inc. |
| References: | 93-05-052 |
| Date: | Sat, 15 May 1993 13:38:29 GMT |
goer@midway.uchicago.edu (Richard L. Goerwitz) writes:
>Does there exist a good, systematic,
>not necessarily theoretical discussion of fast and/or simple LALR table
>generation algorithms?
Alan Holub, "Compiler Design in C," Prentice-Hall, 1990, ISBN
0-13-155045-4.
This book provides theory and implementation of buttom-up parsing.
Especially, it discuss how to build an LALR(1) parser generator from
an LR(0) one. The complete source code for occs (a yacc like LALR(1)
parser generator) is used as the basis for discussion.
[Be sure to get a recent printing that corrects many of the errors present
in earlier ones. The printing number is the rightmost one in the line on
the copyright page above the ISBN line, and should be at least 5. -John]
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.