Efficient generation of LALR(1) look-aheads in Parser Generators

andrewd@cs.adelaide.edu.au (Andrew Dunstan)
Mon, 27 Jul 1992 06:01:00 GMT

          From comp.compilers
Related articles
Efficient generation of LALR(1) look-aheads in Parser Generators andrewd@cs.adelaide.edu.au (1992-07-27)
Re: Efficient generation of LALR(1) look-aheads in Parser Generators karsten@tfl.dk (1992-08-03)
Question on moving from interpreted language to hypercube executable brannon@stun4r.cs.caltech.edu (1992-08-04)
Re: moving from interpreted language to hypercube executable pardo@cs.washington.edu (1992-08-06)
| List of all articles for this month |
Newsgroups: comp.compilers
From: andrewd@cs.adelaide.edu.au (Andrew Dunstan)
Organization: Compilers Central
Date: Mon, 27 Jul 1992 06:01:00 GMT
Keywords: yacc, performance, question



Berkeley yacc uses the algorithm from DeRemer and Pennello. So does
Bison. Original yacc uses an old and horribly inefficient algorithm.




There was a paper later than DeRemer and Penello by Park etc., which
apparently had a much more efficient algorithm, although the paper
itself is even harder to follow than that of DeRemer and Pennello,
which is saying something!


Does anybody know of a publicly available implementation of this
algorithm?




--
Andrew Dunstan
Department of Computer Science
University of Adelaide
South Australia
net: andrewd@cs.adelaide.edu.au
--

Post a followup to this message

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