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