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…

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

《编译原理》课程设计，基于 LR (1) 分析的类 C 语言语法分析器

parser for simple c

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

Testing out different parser implementations

lexical analyzer and LR1 parser written in python , with documentation

Compiler Design IIT BHU Viva

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

compiling theory demostration

Yet another CLR compiler compiler.

LR1 and LL1 , supporting left recursion.

liquid is easy to use and fast typescript parser generator.

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

GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action

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

LR(1) parser with implement actions

LR(1) Parser for the Ambients Protocol

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.