Re: easy LALR code

salomon@silver.cs.umanitoba.ca (Daniel J. Salomon) writes:
>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" ...
>
henry@zoo.toronto.edu (Henry Spencer) writes:
> The clearest description of how to build an LALR parser that I ever saw
> was the Aho&Johnson paper in the June 1974 ACM Computing Surveys, which
> tells you how yacc works.


We are not discussing the same algorithm. DeRemer's efficient algorithm
is reputed to run 5 to 8 times as fast as YACC's algorithm. So if you
want a description of an efficient algorithm you have to go to DeRemer's
paper, or to Tremblay and Sorenson's book. If you want a clear
description of the less efficient LALR algorithms, then there may be
better sources than Tremblay & Sorenson. In general Tremblay & Sorenson
tend to be somewhat verbose, but often offer a distinctively different
description from the Red Dragon, or the Red Dragon copy-cat books.
--
Dan Salomon -- salomon@cs.UManitoba.CA
                              Dept. of Computer Science / University of Manitoba
Winnipeg, Manitoba, Canada R3T 2N2 / (204) 275-6682
--

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