FU compiler complier, LALR and LL parser generator for Common Lisp; main repo after BitBucket Mercurial migration
-
Updated
Mar 25, 2020 - Common Lisp
In computer science, LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time.[1] There are several variants of LR parsers: SLR parsers, LALR parsers, Canonical LR(1) parsers, Minimal LR(1) parsers, and GLR parsers. LR parsers can be generated by a parser generator from a formal grammar defining the syntax of the language to be parsed. They are widely used for the processing of computer languages.
FU compiler complier, LALR and LL parser generator for Common Lisp; main repo after BitBucket Mercurial migration
YACC for command-line options. Declaratively generate bulletproof command-line parsers.