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: | salomon@silver.cs.umanitoba.ca (Daniel J. Salomon) |
| Keywords: | LALR |
| Organization: | Computer Science, University of Manitoba, Winnipeg, Canada |
| References: | 93-05-052 |
| Date: | Tue, 18 May 1993 06:48:10 GMT |
If you are looking for a clear description of a highly efficient, but
complex algorithm for LALR parser generation, check out Tremblay and
Sorenson "The Theory and Practice of Compiler Writing" section 7-4.6 page
375. They give a clear explanation of deRemer's otherwise impenetrable
paper on efficient LALR parser generation.
This is not a simple algorithm, however. If you want a simple rather than
efficient algorithm, Tremblay and Sorenson also give reasonable
explanations of simpler but less efficient methods.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.