left-recursion-elimination

There are 0 repository under left-recursion-elimination topic.

shushrutsharma / 18CSC304J-CD
All the weekly lab work of the subject 18CSC304J Compiler Design.
compiler-design lexical-analyzer nfa dfa nfa-to-dfa-conversion left-recursion-elimination left-recursion left-factoring first-and-follow predictive-parser shift-reduce-parsers leading-and-trailing directed-acyclic-graph postfix prefix quadruple triple
Language:C++ 95
PratikSavla / compiler-design-lab
These are my programs for compiler design lab work in my sixth semester
python python-3 regular-expression nfa regex regular-expression-to-nfa compiler-design theory-of-computation lexical-analyzer lexical-analysis eliminate-left-recursion left-recursion-elimination
Language:Python 59
glebec / left-recursion
Quick explanation of eliminating left recursion in Haskell parsers
parsing recursive-descent-parser left-recursion-elimination grammars cfg
Language:Haskell 53
tanmaya0102 / Compiler-Design-Programs
Compiler Design Lab Programs
c cpp compiler-design lexical-analyzer firstandfollow nfa-to-dfa-conversion re-to-nfa left-factoring left-recursion-elimination predictive-parser first-and-follow shift-reduce-parsers leading-and-trailing lr-parser intermediate-code-generation directed-acyclic-graph target-code-generation
Language:C 17
Showndarya / SPCC
System Programming and Compiler Construction programs
lexical-analyzer assembler system-programming compiler-construction macro-processor recursive-descent-parser operator-precedence-parser static-library lex yacc lex-yacc-parser first-and-follow-sets code-generation left-recursion-elimination
Language:Java 12
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)
python java dfa dfa-construction nfa nfa-to-dfa-conversion nfa-closure nfa2dfa nfa-implementation fallback automaton finite-state-automata automata-theory context-free-grammar left-recursion-elimination
Language:Python 5
man-yadul / S7-CSL411-COMPILER-LAB
compiler compiler-design first-of-grammar lexical-analysis lexical-analyzer nfa-to-dfa-conversion parser recursive-descent-parser shift-reduce-parsers yacc yacc-lex ktu s7 constant-propagation intermediate-code-generation left-recursion-elimination
Language:C 5
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
compiler compiler-principles engineering-grads-students code c programming first follow left-recursion-elimination first-follow-compiler first-follow-sets
Language:C 3
beccadsouza / System-Programming-and-Compiler-Construction
Lexical and Semantic analysis for compiler design
flex lexical-analysis lex lexical-parser python-3 python-modules left-recursion-elimination indirect-recursion semantic-analysis
Language:C 3
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
antlr compiler first-and-follow java left-recursion-elimination lexical-analysis ll1-parser regular-expressions theory-of-computation context-free-grammar deterministic-finite-automata non-deterministic-finite-automata syntax-directed-definition
Language:Java 2
AumkarG / System-Programming-and-Compiler-Construction
compiler macros assembler left-recursion-elimination ll-parser first-follow-pos system-programming-laboratory compiler-construction
Language:Jupyter Notebook 2
nagasai123-k / Compiler-Design---18CSC304J-
18CSC304J Compiler Design Lab codes
dfa left-recursion left-recursion-elimination nfa nfa-implementation nfa-to-dfa-conversion regular-expression left-facto first-and-follow lexical-analysis paser predictive-parsing quadruple semantic-analysis syntax-analysis
Language:C++ 1
vinayakrit / compiler-design
compiler-design lexical-analysis symbol-table left-recursion-elimination left-factoring first-follow-compiler ll1-parser recursive-descent-parser
Language:C 1
biuld / ctd
compiling theory demostration
compiling-theory dangling-else left-recursion-elimination ll1-parser lr1-parser nfa-to-dfa-conversion parsers
Language:JavaScript 0
NaimuL0 / compiler_design
c compiler compiler-design cpp first-and-follow intermediate-code-generation leading-and-trailing left-factoring left-recursion left-recursion-elimination lexical-analyzer nfa-to-dfa-conversion naimul0
Language:C 0
yagna-bork / Interpreter
Interpreter for non-negative arithmetic
javacc interpreter python-syntax java left-recursion-elimination
Language:Java 0
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.
compiler-design first-and-follow left-factoring left-recursion-elimination lexical-analysis predictive-parsing regular-expressions parsing-syntax-trees slr-parsing
Language:C
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
cfg compiler-design compilers context-free-grammar left-recursion left-recursion-elimination
Language:Java