There are 0 repository under lr1-parser topic.
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.
Parser Generator for LR(1) and LALR
A lame c compiler which implements a basic lexer, an LR(1) parser and a recursive descent parser.
This is my labs from Compilers Design Course, being taught in BMSTU. Lab 1 - Constructing minimal DFA from regex in 3 phases (r => NFA => DFA => minimal DFA). Lab 2 = Grammar processing. (Removing cycles, left recursion, left factorizing, etc.) Lab 3 = LL(1), SLR(1) and LR(1) parser generator and lexer generator. Lexer based on minimal DFA. Each final state of DFA contains pattern name (terminal name). Lab 4 = Operator Precedence Grammar Parser. Generate a matrix of precedence relations.
LL(1) LR(1) SLR(1) LALR(1) Visualization
LR1-Parser可作为编译前端语法分析部件,基于Burke-Fisher错误恢复方案,和LR(1)算法开发,包括LR(1)分析表生成器模块和分析栈模块。
Takes a grammar's production rules and creates a LR(1) parsing table, then finally parses the grammar to "accept" or "reject"
Implementation Of LR1 Parser Using Python 3
Compiler Design IIT BHU Viva
Programming language parsers, including LL(1), LR(0), LR(1), SLR(1), and LALR(1).
OCaml parsers (not compilers!) for (limited) regular expressions