DescriptionLalr-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.
DocumentationNew Features Portability Defining a parser Parser syntax GLR Parsing Symbol Index Acknowledgments Licensing
Commercial Use
Modify
Distribute
Place Warranty
Use Patent Claims
Sub-License
Hold Liable
Distribute Original
Disclose Source
Include Copyright
State Changes
Include License
Include Install Instructions
These details are provided for information only. No information here is legal advice and should not be used as such.
30 Day SummaryMar 24 2024 — Apr 23 2024
|
12 Month SummaryApr 23 2023 — Apr 23 2024
|