LL(1) parser combinators in Scala

JuCC - Jadavpur University Compiler Compiler

An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)

an interpreter for λ-calculus implemented in ruby

C++ ( C++ 17 ) codes for creating a Lexical and LL1 Syntax Analyser

Knife is a Java top-down parser generator for building parsers from grammars in BNF format.

CIT-412 (Compiler Design and Autometa Theory Sessional)

C Pascal like language compiler made from scratch

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

Collection of parser utilities for nim - compile/runtime parser generator.

This is a compiler for LL(1) types of grammar.

My universal LL(1) parser

A simple math expression LL(1) parser written in python.

Implementation of full LL1 Parser (First-Follow, Parse Table, String Parsing)

さや香の M-1 2023 決勝ネタ「見せ算」に対応した五則演算器実装および npm package

LL1 parser / analyseur syntaxique descendant LL1

Python program to calculate the First and Follow of a given LL(1) Grammar

Desktop app for visualizing parse tree , abstract syntax tree , action table , parse table for any valid LL1 grammar.

First and follow set solver in Javascript

Lexical Analyzer and Parser implementation for a programming language named Galaxy

Assignments in course:Compilers.

An LL1 parser developed with Python

Python LL1 Parser

LR1 and LL1 , supporting left recursion.

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.

Implementation of a Compiler for MiniJava to LLVM, Implementation of a LL(1) parser for a calculator

Programming Language Translation FER labs

A LL1 algorithm implementation for CFG and string recognition.

A full-featured compiler implementation that translates the PO teaching language into MIPS assembly, featuring LL(1) parsing, intermediate TAC generation, and custom grammar support. Built to make programming education accessible.

Official Submission for Compiler Design (18CSC304J) Course Project