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

These are my programs for compiler design lab work in my sixth semester

Quick explanation of eliminating left recursion in Haskell parsers

Compiler Design Lab Programs

System Programming and Compiler Construction programs

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)

Lexical and Semantic analysis for compiler design

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

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

18CSC304J Compiler Design Lab codes

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

compiling theory demostration

Interpreter for non-negative arithmetic

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.