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: | kjell@cse.ucsc.edu (Kjell Post) |
Keywords: | LALR, bibliography |
Organization: | University of California, Santa Cruz (CE/CIS Boards) |
References: | 93-05-052 |
Date: | Wed, 19 May 1993 06:42:51 GMT |
When I wrote a LALR(1) parser generator two years ago I found that the
paper below had a very nice and simple way of formulating the lookahead
set computation.
@Article{bermudez-logothetis,
author = "Manuel E. Bermudez and George Logothetis",
title = "{Simple Computation of LALR(1) Lookahead Sets}",
journal = "Information Processing Letters",
year = 1989,
volume = 31,
pages = "233-238"
}
--Kjell
kjell@cs.ucsc.edu
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.