IT250
Course Name:
Automata and Compiler Design (IT250)
Programme:
B.Tech (IT)
Semester:
Fourth
Category:
Programme Core (PC)
Credits (L-T-P):
(3-0-2) 4
Content:
Introduction to Automata and Compiler Design, Regular Expressions, DFA, NFA, Minimization of states, Lexical analysis, usage of Lex, CFG, BNF notation, PDA, Parsing Techniques, Top-down and bottom-up parsing, Error Recovery strategies, Intermediate Code Generation, Runtime environment, Code Generation and introduction to code optimizations. Simple projects to demonstrate the usage of parsers for code generation for a simple C-like language.
References:
John E. Hopcroft et al., Introduction to Automata Theory, Languages and Computation, 3rd Ed., Pearson, 2007.
A.V. Aho et al., “Compilers: Priniciples, Techniques, Tools”, 2nd Edition, Pearson, 2006.
Allen I. Holub, "Compiler Design in C", Prentice-Hall, 1990.
Department:
Information Technology