Skip to content
Dominique Boucher edited this page Jun 16, 2015 · 6 revisions

lalr-scm

Lalr-scm is yet another LALR(1) parser generator written in Scheme. In contrast to other such parser generators, this one implements an 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.

Documentation

Clone this wiki locally