This open-source project is a tool for analyzing context-free grammar (CFG) productions.
-
Updated
Sep 5, 2023 - C
This open-source project is a tool for analyzing context-free grammar (CFG) productions.
Theory of Automatas and Formal Languages + Theory of Programming Languages
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
Compiler Design experiments including c, flex, bison, scanner, java and other codes
18CSC304J Compiler Design Lab codes
c++ ascii not poisonous parsing library
Arborist is a PEG parser that supports left-associative left recursion
All the weekly lab work of the subject 18CSC304J Compiler Design.
💡 Build your own programming language! A C++17 PEG parser generator supporting parser combination, memoization, left-recursion and context-dependent grammars.
A parser generator for C
Add a description, image, and links to the left-recursion topic page so that developers can more easily learn about it.
To associate your repository with the left-recursion topic, visit your repo's landing page and select "manage topics."