Re: fast table generators

kjell@cse.ucsc.edu (Kjell Post)
Sun, 20 Sep 1992 09:29:41 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: kjell@cse.ucsc.edu (Kjell Post)
Organization: University of California, Santa Cruz (CE/CIS Boards)
Date: Sun, 20 Sep 1992 09:29:41 GMT
Keywords: parse, LR(1), performance, bibliography
References: 92-09-119

goer@midway.uchicago.edu write:
>I've written LR(1)-family table generators, and they always seem
>to run very slowly. Are there any practical implementation books ... ?


For an elegant formulation of computing LALR(1) lookahead sets I would
recommend "Simple Computation of LALR(1) Lookahead Sets" by Manuel E.
Bermudez and George Logothetis. It appeared in Information Processing
Letters 31 (1989), p. 233-238.


--Kjell kjell@cs.ucsc.edu
--

Post a followup to this message

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