cparse is an LR(1) and LALR(1) parser generator
-
Updated
Jul 19, 2025 - C
cparse is an LR(1) and LALR(1) parser generator
Yet another CLR compiler compiler.
Simple, unoptimized regular expression engine written for learning purposes. Kanaya generates it's LR(1) parser from a grammar, then takes a regular expression's parse tree to an equivalent non-deterministic finite automata, then computes the automata's acceptance of stdin.
Add a description, image, and links to the lr1-parser topic page so that developers can more easily learn about it.
To associate your repository with the lr1-parser topic, visit your repo's landing page and select "manage topics."