This 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.
The new features are:
error
productions).output:
option).out-table:
option).expect:
option)Send questions, comments or suggestions to boucherd@iro.umontreal.ca
I would like to thank the following people for their contributions to this software:
Dominique Boucher -- Nu Echo Inc.