Repository navigation
LR parser
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.
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 analyzer, all in compile time.
A pure Python LR/GLR parser - http://www.igordejanovic.net/parglare/
Asparserations is an LR(1) and LALR(1) parser generator frontend. It outputs JSON representing the parse table.
一个微型的 LL/LR/LALR 语法解析器 | A micro compiler project to provide LL/LR/LALR syntax parser
Compiler Design Lab Programs
These are the various assignments that were done as a part of the Compiler Design Laboratory
This is a python program implementation for the shift-reduce parsing algorithm.
A compiler-compiler for lexers, LL and LALR grammars, written in python
Implementation of LL(0), LR(0), SLR(1), CLR(1) algorithms in C# (Visual Representation is also available)
Programming Languages @ Hanyang Univ.