UNIT 1:
Introduction - Central concepts of Automata Theory
Regular Expressions, Identity rules for Regular Expressions
Finite State Automata Deterministic Finite State Automata(DFA), Non Deterministic Finite State Automata(NDFA)
Equivalence of DFA and NDFA
Pushdown Automata - Languages of a Pushdown Automata
Turing Machines- Languages of Turing Machine
UNIT 2:
Introduction to Compiling
Compilers – Analysis of the source program – The phases – Cousins – The grouping of phases
The role of the lexical analyzer – Input buffering
The role of the lexical analyzer – Input buffering
Finite automata – Regular expression to finite automata
Finite automata – Regular expression to finite automata
UNIT 3:
Canonical LR Parsers – LALR Parsers
UNIT 4:
Run-Time Environments, Source language issues
UNIT 5:
Issues in the design of a code generator&The target machine