COMPILER DESIGN LAB
CS431
Overview
The course requires the students to implement various phases of a Compiler. They are also required to test simple optimization techniques and are given exposure to compiler writing tools.
Instructors
THARA R J
tharaneelima@cet.ac.in
NEETHU GEORGE
neethugeorge@cet.ac.in
Prerequisites
- CS304 – Compiler Design
Teaching Assistants
Santhosh S
Sneha K
Nithin Bhasi
Syllabus
Schedule
- Cycle 1 -Automata Concepts
- Program to find epsilon-closure of all states of any given NFA with epsilon transition
- Program to convert NFA with epsilon transition to NFA without epsilon transition
- Program to convert NFA to DFA
- Program to minimize any given DFA
- Cycle 2 – Lex and Yacc
- Implement a lexical analyzer for given language using C and the lexical analyzer should ignore redundant spaces, tabs and new line
- Cycle 3 – Parser Implementation
- Implement a operator precedence parser for a given language
- Program to find First and Follow of any given grammar
- Implement a recursive decent parser for an expression
- Implement a Shift-Reduce parser for an expression
- Cycle 4 – Code Generation and Interpretation
- Construct a compiler-interpreter for a simple imperative programming language.