Compiler Design: Lab Experiments

Experiments performed in the Compiler Design lab as a part of the Course

List of Experiments

Conversion of Non-Deterministic Finite Automata to Deterministic Finite Automata
Implementing a Deterministic Finite Automata
- Constructing Deterministic Finite Automata
- Checking for String Acceptance by DFA
Implementing Lexical Analyzer
- Constructing Lexical Analyzer
- Tokenizing an input program
Removing Left Recursion from given grammar
- Removing Immediate Left Recursion
- Removing Non-Immediate Left Recursion
Removing Non-Determinism from given grammar
Computing FIRST of all grammar symbols
Computing FOLLOW of all non-terminals in a grammar
Creating Parser Table for the LL(1) parser

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
Computing FIRST		Computing FIRST
Computing FOLLOW		Computing FOLLOW
Construction of Lexical Analyzer		Construction of Lexical Analyzer
Conversion from NFA to DFA		Conversion from NFA to DFA
Create LL1 Parser Table		Create LL1 Parser Table
Removing Left Recursion from Grammar		Removing Left Recursion from Grammar
Removing Non Determinism from Grammar		Removing Non Determinism from Grammar
String acceptance by DFA		String acceptance by DFA
LICENSE		LICENSE
README.md		README.md