UNIT 1:
Formal Language and Regular Expressions
Languages regular expressions
DFA, NFA.Conversion of regular expression to NFA, NFA to DFA.
Applications of Finite Automata to lexical analysis
UNIT 2:
Context Free grammars and parsing
ambiguity LL(K) grammars and LL(1) parsing Bottom up parsing
LALR parsing, parsing ambiguous grammars
LALR parsing, parsing ambiguous grammars
handle pruning, LR Grammar Parsing,
LALR parsing, parsing ambiguous grammars
UNIT 3:
Syntax directed translation
abstract syntax tree, translation of simple statements and control flow statements
Type checking, type conversions, equivalence of type expressions
overloading of functions and operations
Type checking, type conversions, equivalence of type expressions
Type checking, type conversions, equivalence of type expressions
UNIT 4:
Symbol table, Storage organization, storage allocation strategies
parameters, language facilities for dynamics storage allocation
parameters, language facilities for dynamics storage allocation
Principal sources of optimization
optimization of basic blocks, peephole optimization,
flow graphs, optimization techniques
UNIT 5:
Register allocation and assignment
object code forms, generic code generation algorithm
Machine dependent code generation
