home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.compilers
- Path: sparky!uunet!gatech!news.byu.edu!eff!world!iecc!compilers-sender
- From: andrewd@cs.adelaide.edu.au (Andrew Dunstan)
- Subject: Efficient generation of LALR(1) look-aheads in Parser Generators
- Reply-To: andrewd@cs.adelaide.edu.au (Andrew Dunstan)
- Organization: Compilers Central
- Date: Mon, 27 Jul 1992 06:01:00 GMT
- Approved: compilers@iecc.cambridge.ma.us
- Message-ID: <92-07-097@comp.compilers>
- Keywords: yacc, performance, question
- Sender: compilers-sender@iecc.cambridge.ma.us
- Lines: 23
-
-
- 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
- --
- Send compilers articles to compilers@iecc.cambridge.ma.us or
- {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
-