fast table generators

goer@midway.uchicago.edu (Richard L. Goerwitz)
Sat, 19 Sep 1992 13:45:12 GMT

          From comp.compilers
Related articles
fast table generators goer@midway.uchicago.edu (1992-09-19)
Re: fast table generators kjell@cse.ucsc.edu (1992-09-20)
Re: fast table generators pardo@cs.washington.edu (1992-09-21)
| List of all articles for this month |
Newsgroups: comp.compilers
From: goer@midway.uchicago.edu (Richard L. Goerwitz)
Organization: University of Chicago Computing Organizations
Date: Sat, 19 Sep 1992 13:45:12 GMT
Keywords: parse, LR(1), performance, comment

I've written LR(1)-family table generators, and they always seem
to run very slowly. Are there any practical implementation books -
not just theory-driven statements and proofs?
--
      -Richard L. Goerwitz goer%midway@uchicago.bitnet
      goer@midway.uchicago.edu rutgers!oddjob!ellis!goer
[Aho, Sethi, and Ullman and particularly Holub describe details of the
implementation of LALR parsers. See the FAQ for detailed references. -John]
--

Post a followup to this message

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