lr1-parser

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.

An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)

A general-purpose parser generator library in Swift with ambiguity detection and conflicts resolution.

Self-hosted parser/scanner generator from LR grammar with semantic annotations in C++20

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.

LR1 and LL1 , supporting left recursion.

Static library of whatever are seen required in general purpose but not directly supported from Modern C++. Or whatever reusable originated from my side projects.

Programming language parsers, including LL(1), LR(0), LR(1), SLR(1), and LALR(1).

Takes a grammar's production rules and creates a LR(1) parsing table, then finally parses the grammar to "accept" or "reject"

LR(1) parser with implement actions

Implementation Of LR1 Parser Using Python 3

LR1-Parser可作为编译前端语法分析部件，基于LR(1)算法开发，包括LR(1)分析表生成器模块和分析栈模块（含错误恢复）。

Testing out different parser implementations

parser for simple c

LL(1) LR(1) SLR(1) LALR(1) Visualization

LR(1) Parser Generator for C++.用C++编写的LR1语法分析器生成器。

compiling theory demostration

OCaml parsers (not compilers!) for (limited) regular expressions