|Efficient generation of LALR(1) look-aheads in Parser Generators firstname.lastname@example.org (1992-07-27)|
|Re: Efficient generation of LALR(1) look-aheads in Parser Generators email@example.com (1992-08-03)|
|Question on moving from interpreted language to hypercube executable firstname.lastname@example.org (1992-08-04)|
|Re: moving from interpreted language to hypercube executable email@example.com (1992-08-06)|
|From:||firstname.lastname@example.org (Andrew Dunstan)|
|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
Department of Computer Science
University of Adelaide
Return to the
Search the comp.compilers archives again.