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

Implementation of Simple LR (SLR) Parser in Python.

🍁 Compiler Compiler based on CSharp with GUI Program

Build lexer and simple parser(SimpleLR) in macro, It also provides lexer and simpleLR tool for c language

Code for Compiler Design Lab, Semester 7

These are the various assignments that were done as a part of the Compiler Design Laboratory

CIT-412 (Compiler Design and Autometa Theory Sessional)

Generating LR parser for a given grammar.

Implementation of LL(0), LR(0), SLR(1), CLR(1) algorithms in C# (Visual Representation is also available)

No description provided.

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.

No description provided.

Several implementations in Python language of some of the parsing techniques such as LL(1) parsing, SLR(1) parsing ,LR(0) parsing and LR(1) parsing.

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.

Compiler with custom SLR parser for mylang.

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

Implementation of parsers

C Compiler in Python - For Computer Science Students

No description provided.

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

Compiler Construction assignments

Yet Another Parser — A flexible C++20-based SDT-enabled parser

Parser Generator (OmniMark)

stelar is an SLR parser

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

Implementation of SLR Parser

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

LL(1) (Top-Down) and SLR(1) (Bottom-Up) parsers

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.

Perform certain analysis on a specific grammar.