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

18CSC304J Compiler Design Lab codes

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

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

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

Theory of Automatas and Formal Languages + Theory of Programming Languages