Overview

Course Description

UNIT-I

Formal Language and Regular Expressions: Languages, DefinitionLanguages regular expressions, Finite Automata-DFA, NFA.Conversion of a 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 Bottom-up parsing, handle pruning, LR Grammar Parsing, LALR parsing, parsing ambiguous grammars, YACC programming specification.  






 

UNIT-III

Semantics: Syntax directed translation, S-attributed and L-attributed grammars, Intermediate code abstract syntax tree, translation of simple statements and control flow statements. Context-Sensitive features- Chomsky hierarchy of languages and recognizers. Type checking, type conversions, the equivalence of type expressions, overloading of functions and operations.

 

UNIT-IV

The symbol table, Storage organization, storage allocation strategies scope access to now local names, parameters, language facilities for dynamic storage code forms allocation. Code optimization Principal sources of optimization,  optimization of basic blocks, peephole optimization, flow graphs, optimization techniques.

 

UNIT-V

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

What you'll learn

Requirements