Re: Beginner help with LALR(1) closure

grout@sp55.csrd.uiuc.edu (John R. Grout) writes:
|> When in doubt, go back to the source... a classic paper on computing
|> LALR(1) lookahead sets is by Frank DeRemer and Thomas Pennello,
|> "Efficient Computation of LALR(1) Look-Ahead Sets, ACM Transactions on
|> Programming Languages and Systems, Volume 4, No 4 (October 1982),
|> pp. 615-649...


Woa! That's a pretty heavy-duty reference for a beginner. Their
method is more efficient than the ones given in the Dragon book, but
quite complex to understand from their paper. If he really does want
to do efficient generation of LALR(1) sets, he can check the shorter
and clearer explanation of DeRemer and Pennello's paper in Tremblay &
Sorenson "The Theory and Practice of Compiler Writing" McGraw Hill,
1985 page 375. I used this simplified description to teach the
algorithm to my graduate students.


--
Daniel J. Salomon -- salomon@cs.UManitoba.CA
              Dept. of Computer Science / University of Manitoba
              Winnipeg, Manitoba, Canada R3T 2N2 / (204) 474-8687
--

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