LR parser topic
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.
ctpg
Compile Time Parser Generator is a C++ single header library which takes a language description as a C++ code and turns it into a LR1 table parser with a deterministic finite automaton lexical analyze...
parglare
A pure Python LR/GLR parser - http://www.igordejanovic.net/parglare/
LR-Parser
LR Parser (LR(0), SLR(1), CLR(1) and LALR(1))
Asparserations
Asparserations is an LR(1) and LALR(1) parser generator frontend. It outputs JSON representing the parse table.
lr1-parser-vis
Create LR(1) parsers in your browser and see how they work
MicroCompiler
一个微型的 LL/LR/LALR 语法解析器 | A micro compiler project to provide LL/LR/LALR syntax parser
Compiler-Design-Laboratory
These are the various assignments that were done as a part of the Compiler Design Laboratory
Compiler-Design-Programs
Compiler Design Lab Programs
CFront
A C language parser built from the scratch, without using compiler generator.