left-recursion-elimination
There are 19 repositories under left-recursion-elimination topic.
shushrutsharma/18CSC304J-CD
All the weekly lab work of the subject 18CSC304J Compiler Design.
PratikSavla/compiler-design-lab
These are my programs for compiler design lab work in my sixth semester
glebec/left-recursion
Quick explanation of eliminating left recursion in Haskell parsers
tanmaya0102/Compiler-Design-Programs
Compiler Design Lab Programs
Showndarya/SPCC
System Programming and Compiler Construction programs
maggieezzat/Automaton-Theory
A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)
ayushman1024/Compiler-Design-Programs
Some important C programs on various subjects of Engineering grads students, which i have implemented in my course by myself, and are not available anywhere else on internet. Subjects like Compiler, Operating system, Data structures, Networking, Python and many more
alphinaud11/Compiler
An implementation of multiple concepts and techniques related to the theory of computation and compilers like DFA, NFA, Regular Expressions, Fallback DFA, CFG Left-Recursion Elimination, First and Follow, LL(1) Parsing, Lexical Analysis, and SDD
becca-bytes/System-Programming-and-Compiler-Construction
Lexical and Semantic analysis for compiler design
biuld/ctd
compiling theory demostration
yagna-bork/Interpreter
Interpreter for non-negative arithmetic
AkashSasikumar47/Compiler-Design-Lab
This repository contains programs from the Compiler Design Lab, covering lexical analysis, parsing, syntax tree generation, and more. Implemented in C, C++, Java, and Lex, these programs demonstrate essential compiler design concepts and techniques.
alafty/LeftRecursionElimination
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
hafsa-imtiaz/cc-cfg-parser
A C++ implementation for parsing and transforming Context-Free Grammars (CFGs), including left factoring, left recursion removal, and FIRST & FOLLOW set computation.
Nagasai125/Compiler-Design---18CSC304J-
18CSC304J Compiler Design Lab codes