Compile time SLR/LALR/LR (1) parser generator.

Toy parser generator and parser for LL(1), LR(0), SLR(1), LR(1), LALR(1) grammars from scratch.

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.

Professional-grade grammar generator frontend development with the following features: Automatically constructs SLR(1) parsing tables, and generates corresponding syntax parsing programs. Implements the SLR(1) parsing process. Environment : VSCode +(HTML/CSS/JavaScript)+ Live Server (for demonstration)

SLR(1) parser generator using Jison-style syntax — outputs ASTs or s-expressions

SLR, LR(1) and LALR parsers in Rust with grammar generator (WIP)

Yet another parser generator. Yacc-ish syntax, supports LR(0), SLR, LR(1), LALR(1) and semantic actions.

Parser generator for SLR(1) grammars

SLR(1) Parser Generator using Streamlit.

SLR(1) Parsing Table Generator – Compiler Design mini project using HTML, CSS & JavaScript.

Lexer and parser generator based on YALex and YAPar, capable of building LR(0) automata, SLR(1) parsing tables, and validating strings against a defined grammar. Includes a graphical user interface and automata visualization.