Lesson Plan

Name of the Faculty : Ms. Priyanka Kalra

Discipline : Computer Science & Engineering

Semester : 6th

Subject : Compiler Design

Lesson Plan duration : 15 weeks (from January, 2018 to April, 2018)

Work load (Lectures) per week (in hours) - 03

Week Theory

Lecture Day Topic (including assignment / test)

1st 1st • Introduction to compilers

• Analysis and synthesis phase
• Computer Languages
2nd • Translators
• Cousins of compiler
3rd • Language Processing System
• Diagram of compiler Phases
2nd 4th • Structure of compiler
5th • Example String for compilation
• Compiler Construction Tools
6th • Lexical Analysis
• Role of Lexical Analyzer
• Assignment 1
3rd 7th • Input buffering
• Design of Lexical Analyzer
8th • Syntax Analysis – Grammars
• Derivation Parse Trees
• Ambiguity
9th • Parsing
• Role of Parsers
4th 10th • Parsing Techniques
• Bottom Up - Shift Reduce Parsing
11th • Bottom Up – Operator Precedence Parsing
12th • Precedence Relations in Operator Grammar
5th 13th • Top Down Parsing
• With Backtracking
14th • Left Recursion Problem – Elimination
• Left Factoring – elimination
15th • Top Down Parsing
 • Without Backtracking
• Recursive Descent Parser
6th 16th • Predictive Parser
17th • Computation of FIRST
• Numericals
18th • Computation of FOLLOW
• Numericals
7th 19th • Predictive Parsing Table
• Predictive Parsing
20th • Checking Acceptance
• LL (1) Grammar
• Numerical
21st • LR Parsers
• Structure
• Algorithm
• Types
8th 22nd • SLR Parsers – Algo
• Working
23rd • Canonical construction of Items
24th • SLR Parsing Table
• Filling Shift Enteries
9th 25th • Filling Reduce enteries
• Goto Enteries
26th • Filling of Accept enteries
• Checking Acceptance of string
27th • Another Example
10 th
28th • CLR Parser
• Structure
• Working
29th • Numerical of CLR Parser
30th • LALR Parser
• Working
11th 31st • Numerical of LALR Parser
32nd • Check Acceptance of string
33rd • Syntax Directed Translation schemes
• Synthesized Translation
• Inherited Translation
12th 34th • Translation on Parse Trees
35th • Intermediate Code Generation
• Postfix notation
36th • Three Address Code
• Boolean Expressions
13th 37th • Control statements
• Assignments statements
38th • Code Optimization – Introduction
• Local Optimization Techniques
• Loop Optimization Techniques
 39th • Basic Blocks
• Flow Graphs
• DAGs
• Optimization through DAG
14th 40th • Value Numbers
• Global data flow analysis, Code Generation
• Problems in Code Generation
41st • Simple Code Generator
• Issues of Code Generator
• Peephole Optimization
42nd • Code Generation from DAG
15th 43rd • Symbol Table
• Contents of symbol table
44th • Error handling
• Type Checking
45th • Run time Storage Management
• Implementation of different schemes