COURSE PLAN

Computer Science and Engineering

Department :

Compiler Design & CSE 3201

Course Name & code :

VI & CSE
Semester & branch :

Enter name of the faculty.

Name of the faculty :
L T P C
No of contact hours/week:
2 1 0 3

Course Outcomes (COs)

No. of
At the end of this course, the student should be able to: Contact Marks
Hours
CO1: Develop a familiarity on different phases of a compiler and recognize 7 19
steps involved in lexical analyser generators.
CO2: Describe top down and bottom up parsing techniques. 9 26

CO3: Identify ambiguous grammars and analyse syntax directed translation 5 14

techniques.
CO4: Translate expressions into three address code and elaborate code 12 33
generation phase.
CO5: Discuss storage organization issues and make use of LEX and YACC tools. 3 8

Total 36 100

(Page 1 of 5) MIT/GEN/F-01/R2
 Assessment Plan
End Semester/
Components Assignments Sessional Tests
Make-up Examination
Duration 20 to 30 minutes 60 minutes 180 minutes
Weightage 20 % (4 X 5 marks) 30 % (2 X 15 Marks) 50 % (1 X 50 Marks)
Understanding; Applying; Remembering; Understanding;
Typology of Analyzing; Evaluating; Creating Understanding; Applying; Analyzing;
Questions Applying Evaluating; Creating
Answer one randomly selected MCQ (10 marks): Answer all 5 full
question from the problem sheet 10 questions of 0.5 questions of 10 marks
(Students can refer their class marks each each. Each question
Pattern
notes) Short Answers (10 may have 2 to 3 parts
marks): questions of of 3/4/5/6/7 marks
2 or 3 marks
As notified by Associate Director
Schedule (Academics) at the start of each Calendared activity Calendared activity
semester
Assignment 1 (L 1-7 & T 1-2 ) (CO Test 1 Comprehensive
1) (L 1-12 & T 1-4 ) examination covering
Assignment 2 (L 8-13 & T 3-5 ) (CO 1&2) full syllabus. Students
Topics (CO 2 &3) are expected to answer
Covered Assignment 3 (L 14-19 & T 6-8 ) Test 2 all questions (CO1-5)
(CO 3 &4) (L 13-23 & T 5-9 )
Assignment 4 (L 20-26 & T 9-10 ) (CO 3&4)
(CO 5)

Lesson Plan
Course
L. No./
Topics Outcome
T. No.
Addressed
L0 Introduction to the course CO 1

L1 Language Processors, The Structure of a Compiler- Lexical Analysis, Syntax Analysis, CO 1

Semantic Analysis
L2 Intermediate Code Generation, Code Optimization, Code Generation, Symbol-Table CO 1
Management
L3 The Role of the Lexical Analyzer, Input Buffering CO 1
L4 Recognition of Tokens, Architecture of a Transition-Diagram-Based Lexical Analyzer CO 1
T1 Tutorial on Recognition of Tokens CO 1
L5 Design of a Lexical Analyzer Generator- The Structure of the Generated Analyzer, CO 1
Pattern Matching Based on NFAs
T2 Tutorial on Pattern Matching Based on NFAs CO 1
L6 Syntax Analysis - Introduction, Writing a Grammar- Lexical versus Syntactic Analysis, CO 2
Eliminating Ambiguity and Left Recursion, Left Factoring
L7 Tutorial on Eliminating Ambiguity and Left Recursion CO 2

(Page 2 of 5) MIT/GEN/F-01/R2
L8 Top-Down Parsing - Recursive-Descent, First and Follow, LL(1) Grammars, CO 2
Nonrecursive Predictive Parsing
L9 Error Recovery in Predictive Parsing, Bottom-Up Parsing - Reductions, Handle CO 2
Pruning
T3 Tutorial on Predictive Parsing CO 2
L10 Shift-Reduce Parsing, Introduction to LR parsing- Simple LR, Why LR Parsers? CO 2
L11 Items and LR(0) Automaton, The LR-Parsing Algorithm, Constructing SLR-Parsing CO 2
Tables
T4 Tutorial on LR parsing CO 2
L12 More Powerful LR parsers- Canonical LR(1) Items, Constructing LR(1) Sets of Items, CO 2
Canonical LR(1) Parsing Tables
L13 Using Ambiguous Grammars-Precedence and Associativity to Resolve Conflicts CO 3
T5 Tutorial on Ambiguous Grammars CO 3
L14 Syntax-Directed Translation - Syntax-Directed Definitions, Evaluation Order for CO 3
SDD’s- Dependency Graphs
L15 Ordering the Evaluation of Attributes, Applications of Syntax-Directed Translation - CO 3
Construction of Syntax Trees
T6 Tutorial on Construction of Syntax Trees CO 3
L16 Intermediate-Code Generation - Variants of Syntax Trees CO 4
L17 Three Address Code- Addresses and Instructions, Quadruples, Triples CO 4
T7 Tutorial on Three Address Code CO 4
L18 Types and Declarations- Type Expressions, Type Equivalence, Declarations CO 4
L19 Translation of Expressions- Operations Within Expressions CO 4
T8 Tutorial on Translation of Operations within expressions CO 4
L20 Code Generation - Issues in Design of Code Generator CO 4
L21 The Target Language, Basic Blocks and Flow Graphs CO 4
L22 Optimization of Basic Blocks- The DAG Representation of Basic Blocks CO 4
T9 Tutorial on Optimization of Basic Blocks CO 4
L23 Peephole Optimization, Register Allocation and Assignment- Global Register CO 4
Allocation, Run-Time Environments - Storage Organization
T10 Tutorial on Peephole Optimization CO 4
L24 Stack Allocation of Space- Activation Trees, Activation Records CO 5
L25 Theory of FLEX- Structure of a FLEX program, Regular Expression, FLEX library CO 5
functions
L26 Theory of YACC- YACC Symbols, Symbol values, Symbol Types, YACC Library CO 5

(Page 3 of 5) MIT/GEN/F-01/R2
References:
1. Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, “Compilers Principles, Techniques and
Tools”, Pearson Education, 2nd edition. 2010.
2. Vinu V. Das, “Compiler Design using FLEX and YACC”, Prentice-Hall, 2007.

3. Kenneth C. Louden, “Compiler Construction - Principles and Practice”, Thomson, First Edition,
2007.
4. John R. Levine, Tony Manson, Doug Brown, “LEX & YACC”, O Reilly Media, Second Edition, 2012.

5. Click or tap here to enter text.

6. Click or tap here to enter text.

7. Click or tap here to enter text.

Submitted by: Ashwath Rao B

(Signature of the faculty)

Date: 22-01-2020

Approved by: Dr. Ashalatha Nayak

(Signature of HOD)

Date: Click or tap to enter a date.

FACULTY MEMBERS TEACHING THE COURSE (IF MULTIPLE SECTIONS EXIST):

FACULTY SECTION FACULTY SECTION
A
B
C
D

(Page 4 of 5) MIT/GEN/F-01/R2
 *********

(Page 5 of 5) MIT/GEN/F-01/R2