Introduction to Compiling[3L]

Compilers
The phases of the compiler

Analysis of the source program
Cousins of the compiler

Lexical Analysis [6L]

The role of the lexical analyzer
Patterns
Input buffering
Recognition of a tokens
From a regular expression to an NFA
Design of a lexical analyzer generator (Lex)

Tokens
Lexemes
Specifications of a token
Finite automata
From a regular expression to DFA

Syntax Analysis [9L]

The role of a parser
Writing a grammar
Non-recursive Predictive parsing(LL)
Handles
Operator precedence parsing
Parser generators (YACC)

Context free grammars
Top down Parsing
Bottom up parsing
Viable prefixes
LR parsers (SLR,LALR)
Error Recovery strategies for different parsing techniques

Syntax directed translation [5L]

Syntax director definitions
Bottom-up evaluation of S attributed definitions
Bottom-up evaluation of inherited attributes

Construction of syntax trees
L attributed definitions

Type checking [4L]

Type systems
Equivalence of type expressions

Specification of a simple type checker
Type conversions

Run time environments [5L]

Source language issues (Activation trees, Controlstack, scope of declaration, Binding of names)
Storage allocation strategies, Parameterpassing (call by value, call by reference, copyrestore, call by name)

Storage organization(Subdivision of run-time memory, Activationrecords)
Symbol tables, dynamic storage allocation techniques

Intermediate code generation [4L]

Intermediate languages
Implementation of three address statements(Quadruples, Triples, Indirect triples)

Graphical representation
Three-address code

Code optimization [5L]

Introduction
Transformation of basic blocks, Dag representation of basic blocks
The principle sources of optimization
Peephole optimization

Basic blocks & flow graphs
Dag representation of basic blocks
Loops in flow graph

Code generations [4L]

Issues in the design of code generator
Register allocation

a simple code generator
assignment

Fill up

Hello I am Meta.