JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD 
III Year B.Tech. IT I-Sem T P C 
4+1* 0 4 
AUTOMATA AND COMPILER DESIGN 

UNIT-I 
Formal Language and Regular Expressions : Languages, Definition Languages regular expressions, Finite Automata – DFA, NFA. Conversion of regular expression to NFA, NFA to DFA. Applications of Finite Automata to lexical analysis, lex tools. 

UNIT-II 
Context Free grammars and parsing : Context free grammars, derivation, parse trees, ambiguity LL(K) grammars and LL(1) parsing 

UNIT-III 
Bottom up parsing handle pruning LR Grammar Parsing, LALR parsing, parsing ambiguous grammars, YACC programming specification. 

UNIT-IV 
Semantics : Syntax directed translation, S-attributed and L-attributed grammars, Intermediate code – abstract syntax tree, translation of simple statements and control flow statements. 

UNIT-V 
Context Sensitive features – Chomsky hierarchy of languages and recognizers. Type checking, type conversions, equivalence of type expressions, overloading of functions and operations. 

UNIT-VI 
Run time storage : Storage organization, storage allocation strategies scope access to now local names, parameters, language facilities for dynamics storage allocation. 

UNIT-VII 
Code optimization : Principal sources of optimization, optimization of basic blocks, peephole optimization, flow graphs, Data flow analysis of flow graphs. 

UNIT-VIII 
Code generation : Machine dependent code generation, object code forms, generic code generation algorithm, Register allocation and assignment. Using DAG representation of Block. 

TEXT BOOKS : 
1. Introduction to Theory of computation.Sipser,2nd Edition,Thomson. 
2. Compilers Principles, Techniques and Tools Aho, Ullman, Ravisethi, Pearson  Education. 

REFERENCES : 
1. Modern Compiler Construction in C , Andrew W.Appel Cambridge University  Press. 
2. Compiler Construction, LOUDEN, Thomson.