A parser generator for C

💡 Build your own programming language! A C++17 PEG parser generator supporting parser combination, memoization, left-recursion and context-dependent grammars.

All the weekly lab work of the subject 18CSC304J Compiler Design.

Arborist is a PEG parser that supports left-associative left recursion

c++ ascii not poisonous parsing library

Compiler Design experiments including c, flex, bison, scanner, java and other codes

LL(1) parser toolkit in C: reads a grammar, performs left factoring and left recursion removal, computes FIRST/FOLLOW, builds an LL(1) table, and parses strings with a custom stack and detailed debug output. Includes Makefile, Windows script, sample grammar, and inputs.

C-based toolkit for context-free grammars: reads a grammar, performs left factoring and left recursion removal, computes FIRST/FOLLOW sets, and builds/prints an LL(1) parsing table. Includes sample grammars, Makefile, and a PowerShell build script for Windows.

Grammar transformations and ambiguity resolution - CST229 Grammars

A monadic GLL parser combinator library for R6RS Scheme. Designed as a robust alternative to sllgen for the EOPL curriculum.

Parsing complex expressions into a tree and getting the answer. Built with C++.

This open-source project is a tool for analyzing context-free grammar (CFG) productions.

Task 5 for the Compilers lab where the needed deliverable is a class that takes a CFG without unit rules and epsilon closures and outputs the same CFG after eliminating Left Recursion

18CSC304J Compiler Design Lab codes

Parser combinators for Dart 3. Typed errors, left recursion, stack-safe trampolining. Sealed ADT, 6 format parsers, expression evaluator, binary codec.

📚 Build an LL(1) parser that processes grammars, computes FIRST/FOLLOW sets, and visualizes stack operations while parsing input strings efficiently.