1. A portable and efficient LALR(1) parser generator for Scheme -- Description |
|
1.1 IntroductionThis file contains yet another LALR(1) parser generator written in Scheme. In contrast to other such parser generators, this one implements a more efficient algorithm for computing the lookahead sets. The algorithm is the same as used in Bison (GNU yacc) and is described in the following paper: Efficient Computation of LALR(1) Look-Ahead Set, F. DeRemer and T. Pennello, TOPLAS, vol. 4, no. 4, october 1982. As a consequence, it is not written in a fully functional style. In fact, much of the code is a direct translation from C to Scheme of the Bison sources. 1.2 New featuresThe latest release is: 2.1.2. The new features are:
Send questions, comments or suggestions to Dominique Boucher. 1.3 AcknowledgmentsI would like to thank the following people for their contributions to this software:
1.4 Redistribution
You should have received a copy of the GNU General Public License
along with |
This Html page has been produced by
Skribe.
Last update Sun Dec 3 20:16:43 2006.