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

cparse is an LR(1) and LALR(1) parser generator

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.

bison-like parser generator & compiler frontend that converts context-free grammars into IELR(1)/LALR(1) tables with deterministic LR and non-deterministic GLR parsing. Write custom reduce actions in Rust and get beautiful diagnostics out of the box.

An infrastructure of compiler front end in less code and less dependencies

LR(1) Parser for the Ambients Protocol

Yet Another Parser Generator takes a grammar specification for an LR(1) grammar as input and generates a C++ header file containing tables and helper structs for parsing the LR(1) grammar.

A lame c compiler which implements a basic lexer, an LR(1) parser and a recursive descent parser.

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

北京邮电大学 2024-2025 秋季学期《编译原理与技术》课程实验——语法分析程序

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.

Yet another CLR compiler compiler.

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

lexical analyzer and LR1 parser written in python , with documentation

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…

LR1 and LL1 , supporting left recursion.

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"