Project Summary
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
In a Nutshell, lalr-scm...
- ...
- ...
- ...
-
...
took an estimated 1 years of effort (COCOMO model)
starting with its first commit in April, 2008
ending with its most recent commit almost 5 years ago
Quick Reference
MIT
Permitted
Commercial Use
Modify
Distribute
Place Warranty
Use Patent Claims
Forbidden
Sub-License
Hold Liable
Required
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.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
nearly 1 in 3 companies have no process for identifying, tracking, or remediating known open source vulnerabilities
-
...
by exploring contributors within projects, you can view details on every commit they have made to that project
-
...
there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
-
...
you can subscribe to e-mail newsletters to receive update from the Open Hub blog
30 Day SummaryOct 22 2025 — Nov 21 2025
|
12 Month SummaryNov 21 2024 — Nov 21 2025
|
