Lecture-10

Regular Expression, regular grammar, Conversion of regular expression into

NFA
Ref: Automata Theory, KLP Mishra, N. Chandrasekharan
Automata Theory, AV Aho, JD Ullman

Lecture-11
A language for specifying lexical analyzer, Design of lexical analyzer
generator
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-12
The role of Parser, Syntactic errors and recovery actions
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-13
Context free Grammar, Parse Tree, Parse tree Derivation, Left most
Derivation, Right most derivation, ambiguity.
Ref: Automata Theory, KLP Mishra, N. Chandrasekharan
Automata Theory, AV Aho, JD Ullman

Lecture-14
Eliminating ambiguity, predictive parsing, Recursive decent parsing,
predictive parsing using tables.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-15
Top down parsing, bottom up parsing, shift reduce parsing using the
ACTION/GOTO Tables.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-16
Table construction, SLR, LL, LALR Grammar, Practical consideration for
LALR grammar.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman
Automata Theory, KLP Mishra, N. Chandrasekharan

Lecture-17
Syntax directed translation, Syntax directed definition, bottom up evaluation
of S-attributed definition.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-18
L-attribute definition, top-down translation, bottom up evaluation of inherited
attributes.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-19
Recursive evaluators, space for attribute values at compile time, assigning
space at compiler construction time, analysis of syntax directed definitions.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman
Lecture-20
Semantic actions, semantic analysis, symbol tables, types and type checking.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-21
Run time Environment, Activation Records, run time storage organization.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-22
Symbol Tables, Language facilities for dynamic storage allocation, Dynamic
storage allocation techniques
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-23
Intermediate code Generation, intermediate languages, Declarations.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-24
Assignment statements, Boolean expressions, Case statements, Back patching,
Procedure Calls.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-25
Code Generation, Issues in the design of code generation, The target machine.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-26
Run time storage management, Basic blocks and flow graphs.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-27
A simple code generator, Register and address descriptors, A code generation
algorithm.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-28
Register allocation and assignments, global register allocation, usage counts,
register assignment for outer loops, Register allocation by graph coloring.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lecture-29
The Dag representation of basic blocks, Dag Construction, Application of
Dag.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman

Lectur-30
Peephole optimization, Redundant-instruction elimination, Flow of control
optimizations, algebraic simplifications, Use of machine idioms.
Ref: Principle of Compiler Design, A.V.Aho, Rabi Sethi, J.D.Ullman