LR Parser (LR(0), SLR(1), CLR(1) and LALR(1))

Code for Compiler Design Lab, Semester 7

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…

A Compiler made using Maven that offers to the user the possibility to provide the language of the compiler .works only on SLR grammars and generates the SLR table according to the grammar given , An SLR parser generator and type checking.

Grammax is a Java & C++ bottom-up SLR/CLR parser generator that builds parsers from grammars in Backus-Naur-Form.

In this project, we have defined an SLR grammar. We have also developed a lexical analyzer and also a syntactical analyzer in Java

It is an efficient bottom-up syntax analysis technique that can be used to parse large classes of context free grammar

Simple lexer and and an SLR(1) parser

A backend implementation of an SLR parser built with Spring Boot, designed to efficiently parse context-free grammars and generate parsing tables. It supports grammar analysis, stack management, and reduce state handling, exposing its functionality through a REST API.

A lexer and an SLR1 parser

💻 Implementation of a lexical analyser and an SLR parser in Java for my IA to IB compilers summer work task. (more details in README).