K L University

Department Electronics and Computer Engineering

Course Handout B. Tech - II/IV
A.Y.2018-19, Even Semester

Course Title : Automata and Compiler Design

Course Code : 15EM3207
L-T-P Structure : 2-2-2
Credits :4
Pre-requisite : Discrete Mathematics (15CS2003)
Course Coordinator : Mr. Ketan Anand
Team of Instructors : Mr. Ketan Anand, Mrs Spandana

Course Objective: The objective of this course is to enable the student to equip with the concepts of Formal language,
Automata theory and Compiler design necessary to analyse the core of all computers and their applications. It provides
the notion of automata which helps to model the hardware of a computer.

Course Rationale: This course covers the concepts of Automata and Compiler design which helps in the construction of
the abstract models of Computers and Computations. These models embody the important features that are common to
both hardware and software and that are essential to many of the special and complex constructs we encounter while
working with the computers. Even when such models are too simple to be applicable immediately to real world situations,
the insight we gain from studying them provide the foundation on which specific development is based. The development
of models is one of essentials of any scientific discipline.

COURSE OUTCOMES (COs):

Blooms
Taxonomy
C.O.No Course Outcome (CO) PO/PSO Level(BTL)

Able to analyze formal languages, Grammars P01,P02/PSO1 4

CO1
and finite automata

Able to analyze the grammar based on Top P03,P04/PSO1 4

CO2
Down and bottom up parser.
Able to understand SDT and generate
CO3 intermediate code P04/PSO1 4

Able to apply code optimization techniques P01,P04/PSO1 3

CO4
Able to implement various phases of compiler
CO5 through project based labs P05/PSO1 3
 COURSE OUTCOME INDICATORS (COIs):

Course Highest COI-1 (BTL 1) COI-2 (BTL 2) COI-3 (BTL 3) COI-4 (BTL 4)
Outcome BTL
No.

CO1 3 Recalling the basic Understand the Apply the concepts Finite Analyze the concept
concepts of Discrete concepts of FA and Automata to convert DFA of FA for its
Mathematics (its Regular Expression. to NFA and introduction minimization and
prerequisite) and to € NFA. Conversion of regular
Introduction to expression to NFA
automata and compiler with examples
design.

CO2 4 Recall and Remember Understand the Apply the concepts of Able to analyze the
the basic concepts of concept of designing a Parse Tree and check for concept of parsing
Grammar, CFG, Parse CFG for a given the ambiguity of a CFG, and construction of
Tree and derivations to language, Introduction Parser, Types of parses, parsing table,
solve some conceptual to Parsing, Parse tree and Backtracking with introduction to
questions. and different types of examples. Bottom-Up parsing,
parsing. Construction of
LALR Parser and
construction of parser
with ambiguous
grammar.
CO3 4 Concept of SDT, Understanding the
Apply the concepts type Analysis of Storage
Syntax trees, Bottom concepts of control
checking for type allocation strategies,
Up evaluation of S- flow statements and
conversion, overloading Access to non-local
attributed and L- building Abstract
of the functions and Names, parametric
attributed definition. Syntax tree, Type
operators and storage passing, symbol
checking
organization. tables and dynamic
storage allocation.
CO4 4 Concept of Understanding the Principal source of Analysis of global
Intermediate code concept of a simple optimization, Peephole data flow of
generation, The basic code generator, DAG optimization structured flow
flow graphs. representation of graph, symbolic
block. debugging of
optimized code.

CO5 The implementation of the problems related to the Automata in JFLAP and lexical
Analysis using C programming as well as LEX tool apart from the fundamentals.
Program Outcomes (POs):

P.O. Number Description

An ability to apply knowledge of mathematics, science, engineering fundamentals and an engineering
PO1 specialization for the solution of complex engineering problems in Electronics and Computer Science
Engineering
An ability to identify, formulate, research literature, analyse complex engineering problems in Electronics
PO2 and Computer Science Engineering using first principles of mathematics, natural sciences and engineering
sciences
An ability to design solutions for complex engineering problems and system component or processes that
PO3 meet the specified needs considering public health & safety and cultural, societal & environment
An ability to use research-based knowledge and research methods including design of experiments,
PO4 analysis and interpretation of data and synthesis of the information to obtain solutions to Electronics and
Computer Science Engineering problems
PO5 Ability to create, select and apply appropriate techniques, resources and modern engineering activities, with
an understanding of the limitations
Ability to apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and
PO6 cultural issues and the consequent responsibilities relevant to the professional engineering practice
Ability to demonstrate the knowledge of engineering solutions, contemporary issues understanding their
PO7 impacts on societal and environmental contexts, leading towards sustainable development
PO8 An ability to apply ethical principles and commit to professional ethics and responsibilities and norms of
engineering practice
PO9 An ability to function effectively as an individual, and as a member or leader in diverse teams and in
multi-disciplinary settings
PO10 Ability to communicate effectively oral, written reports and graphical forms on complex engineering
activities
Ability to demonstrate knowledge and understanding of the engineering and management principles and
PO11 apply those one’s own work, as a member and leader in team, to manage projects and in multi-
disciplinary environments
PO12 An ability to recognize the need for and having the preparation and ability to engage independent and
life-long learning in broadest context of technological change

Program Specific Outcomes (PSOs):

PSO No Description

An ability to solve Electronics Engineering problems, using latest hardware and software tools, to arrive cost
PSO1 effective and appropriate solutions in the domain of embedded systems and Internet of Things.

An ability to demonstrate basic knowledge of Web Technologies for development of web based applications
PSO2 along with knowledge and skill related to cyber security.
SYLLABUS (As approved by BOS):

Formal Language and Regular Expressions: Languages, Definition Languages regular expressions, Finite Automata - DFA,
NFA. Conversion of regular expression to NFA, NFA to DFA. Applications of Finite Automata to lexical analysis, lex tools.

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.

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, equivalence of type expressions, overloading of functions and operations. Run time storage: Storage
organization, storage allocation strategies scope access to now local names, parameters, language facilities for dynamics storage
allocation. Code optimization: Principal sources of optimization, optimization of basic blocks, peephole optimization, flow graphs,
Dataflow analysis of flow graphs. Code generation: Machine dependent code generation, object code forms, generic
code generation algorithm, Register allocation and assignment. Using DAG representation of Block.
TEXT BOOKS:
1. Introduction to Theory of Computation by Sipser, 2nd Edition,Thomson.,2009.
2. Compilers Principles, Techniques and Tools Aho, Ullman, Ravisethi, Pearson Education,2009.

REFERENCES :

1. Introduction Automata theory and formal languages, and computation, John E Hopcraft and JD Ullman,2007.
2. Modern Compiler Construction in C, Andrew W.Appel Cambridge University Press. 2005.
3. Compiler Construction, LOUDEN, Thomson,2006.

Deviations (if any) from BoS approved syllabus and the topics planned:

BOS Approved Deviation Reason for deviation

YES NO NA

COURSE DELIVERY PLAN:

Sess. Evaluation
CO COI Topic (s) Teaching-Learning Methods
No. Components

Mathematical Preliminaries and

1.
1 1 notations.(Sets, Functions and Chalk and Talk, PPT – Observe Test-1, End Exam
Relations)
2. Introduction to automata and compiler
1 1 Chalk and Talk, PPT – Observe Test-1, End Exam
design and relation between the two.

3. Test-1, End Exam,

1 1 Finite Automata, Definition, Examples Chalk and Talk, PPT – Observe
Online Quiz
4. Deterministic Finite Automata with Test-1, End Exam,
1 2 Chalk and Talk, PPT – Observe
some more examples Online Quiz

5. Regular Expression and Regular Test-1, End Exam,

1 2 Chalk and Talk, PPT – Observe
language with examples. Online Quiz

6. Problems on Regular Expression and

1 2
Regular Language

7. Non Deterministic Finite Automata Test-1, End Exam,

1 3 Chalk and Talk, PPT – Observe
(NFA), NFA representation, Examples Online Quiz

8. Test-1, End Exam,

1 3 Conversion from NFA to DFA Chalk and Talk, PPT – Observe
Online Quiz

9. Test-1, End Exam,

1 3 NFA with € - Transitions, Examples Chalk and Talk, PPT – Observe
Online Quiz

Conversion from NFA with € -

10. Test-1, End Exam,
1 4 Transitions to NFA without ε Chalk and Talk, PPT – Observe
Online Quiz
transitions and hence to DFA
11. Test-1, End Exam,
1 4 Minimization of FA and its importance Chalk and Talk, PPT – Observe
Online Quiz

12. Conversion of regular expression to Test-1, End Exam,

1 4 Chalk and Talk, PPT – Observe
NFA with examples Online Quiz

13. Test-1, End Exam,

2 1 Introduction to Grammars (CFG), CFG Chalk and Talk, PPT - Observe
Tutorial

14. Represent CFG, Parse Tree and its Test-1, End Exam,
2 1 Chalk and Talk, PPT - Observe
relation to CFG, Tutorial
Types of Derivations in deriving a
15. string from any CFG, Parse trees Chalk and Talk, PPT - Observe Test-1, End Exam,
2 1
Construction. Tutorial

Designing a CFG for a given language.

16. Chalk and Talk, PPT - Observe Test-1, End Exam,
2 2
Tutorial

17. Test-1, End Exam,

2 2 Introduction to Parsing and Parse Trees Chalk and Talk, PPT - Observe
Tutorial

18. Top Down and Bottom Up Parsing Chalk and Talk, PPT - Observe Test-1, End Exam,
2 2
Tutorial

Checking the Ambiguity of a CFG by

Chalk and Talk, PPT – Observe
19. constructing the parse trees Test-1, End Exam,
2 3
Tutorial

Ambiguous grammars & eliminating

20. Chalk and Talk - Practice Test-1, End Exam,
2 3 ambiguity Tutorial
 Types of Parsers, Backtracking with
21. Chalk and Talk - Practice Test-1, End Exam,
2 3 problem Tutorial

22. Recursive Descent Parsing, Predictive Test-1, End Exam,

2 4 Chalk and Talk - Practice
Parsing with algorithm Tutorial

23. Test-1, End Exam,

2 4 Construction of LL(1) Parsing Table Chalk and Talk, PPT - Observe
Tutorial

24. Test-1, End Exam,

2 4 Introduction to Bottom-up Parsing Chalk and Talk, PPT - Observe Tutorial

25.
2 4 Construction of LALR Parser Test-1, End Exam,
Chalk and Talk, PPT – Observe Tutorial

26. Construction of bottom-up parser with Chalk and Talk, PPT – Observe Test-1, End Exam,
2 4
ambiguous grammar Tutorial

27. Syntax directed translation definition Chalk and Talk, PPT – Observe Test-2, End Exam,
3 1
(Attribute Grammar) Tutorial

28. Construction of Syntax Trees Chalk and Talk, PPT – Observe Test-2, End Exam,
3 1
Tutorial

29. Bottom Up evaluation of S- attributed Chalk and Talk, PPT – Observe Test-2, End Exam,
3 1
definition Tutorial

30. Chalk and Talk, PPT – Observe Test-2, End Exam,

3 1 L-attributed definition
Tutorial

31. Translation of simple statements and Chalk and Talk, PPT – Observe Test-2, End Exam,
3 2
control flow statements Tutorial

32. Building Chalk and Talk, PPT – Observe Test-2, End Exam,
3 2
Abstract Syntax Tree(AST) Tutorial

33. Chalk and Talk, PPT – Observe Test-2, End Exam,

3 2 Type Checking- Type systems
Tutorial

34. Chalk and Talk, PPT – Observe Test-2, End Exam,

3 2 Equivalence of type expression
Tutorial

35. Chalk and Talk, PPT – Observe Test-2, End Exam,

3 3 Type conversion
Tutorial

36. Chalk and Talk, PPT – Observe Test-2, End Exam,

3 3 Overloading of functions and operators
Tutorial

37. Run Time Storage- Source language Chalk and Talk, PPT – Observe Test-2, End Exam,
3 3
issues Tutorial

38. Chalk and Talk, PPT – Observe Test-2, End Exam,

3 3 Storage Organization
Tutorial
39. Chalk and Talk, PPT – Observe Test-2, End Exam,
3 4 Storage allocation strategies
Tutorial

40. Chalk and Talk, PPT – Observe Test-2, End Exam,

3 4 Access to non-local names
Tutorial

41. Chalk and Talk, PPT – Observe Test-2, End Exam,

3 4 Parametric passing
Tutorial

42. Chalk and Talk, PPT – Observe Test-2, End Exam,

3 4 Symbol tables
Tutorial

43. Language facilities for dynamic storage Chalk and Talk, PPT – Observe Test-2, End Exam,
3 4
allocation Tutorial

44. Chalk and Talk, PPT – Observe Test-2, End Exam,

4 1 Intermediate code generation
Tutorial

45. Chalk and Talk, PPT – Observe Test-2, End Exam,

2 1 The target machine
Tutorial

46.
3 1 Basic blocks and flow graphs Chalk and Talk, PPT – Observe Test-2, End Exam,
Tutorial

47. Chalk and Talk, PPT – Observe Test-2, End Exam,

4 2 A simple code generator
Tutorial

48. Chalk and Talk, PPT – Observe Test-2, End Exam,

4 2 Register Allocation and assignment Tutorial

49. Test-2, End Exam,

4 2 DAG representation of Block Chalk and Talk, PPT – Practice Online Quiz

50. Chalk and Talk, PPT – Practice Test-2, End Exam,

4 3
Generating code from DAGs Online Quiz

51.
4 3 Peephole optimization Chalk and Talk, PPT – Practice Test-2, End Exam,
Online Quiz
52.
4 3 The principal source of optimization Chalk and Talk, PPT - Practice Test-2, End Exam

Test-2, End Exam

53.
4 4 Optimization of basic blocks Chalk and Talk, PPT - Practice

Test-2, End Exam

54. Introduction to global data flow
4 4 Chalk and Talk, PPT - Practice
analysis
Test-2, End Exam
55. Data flow analysis of structured flow
4 4 Chalk and Talk, PPT - Practice
graph
 Test-2, End Exam
56.
4 4 Symbolic debugging of optimized code Chalk and Talk, PPT - Practice

Session wise Teaching – Learning Plan

Lecture Number: 1
Lecture Outcome:
Recap to discrete mathematics

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Mathematical Preliminaries and notations.(Sets, Functions and Relations) 1 Talk - Discussion
30 Overview of the Course Outcomes (Handout) 1 PPT’s - Observe
05 Conclusion & Summary Discussion

Lecture Number: 2
Lecture Outcome:
Understand the basics of Compiler and automata

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap of Preliminaries and notations 1 Talk - Discussion
Introduction to automata and compiler design and relation between the
20 1 Chalk and Talk, PPT’s - Observe
two.
10 ALM : related problems 2 Match the following, Brain Maps
05 Conclusion & Summary Discussion

Lecture Number: 3
Lecture Outcome:
Understand the Finite Automata

Time(m BT Teaching – Learning

Topic
in) L Method
05 Attendance
10 Recap of relation between automata and compiler design 1 Talk – Discussion
Chalk and Talk, PPT’s -
20 Finite Automata, Definition, Examples 1
Observe
10 ALM : related problems 2 In class Assessments
05 Conclusion & Summary Discussion

Lecture Number: 4
Lecture Outcome:
Understand DFA

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap of Finite Automata 1 Talk – Discussion
20 Deterministic Finite Automata with some more examples 1 Chalk and Talk, PPT’s - Observe
10 ALM : related problems 2 Puzzle
05 Conclusion & Summary Discussion

Lecture Number: 5
Lecture Outcome:
Understand Regular Expresssions
 Topic BTL Teaching – Learning Method
Time(min)
05 Attendance
10 Recap of DFA 1 Talk – Discussion
20 Regular Expression and Regular language with examples. 1 Chalk and Talk, PPT’s - Observe
10 ALM : related problems 2 Quiz
05 Conclusion & Summary Discussion

Lecture Number: 6
Lecture Outcome:
Understand the Problems on Regular Expresssions.

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap of Expression and Regular language 1 Talk – Discussion
20 Problems on Regular Expression and Regular Language 1 Chalk and Talk, PPT’s - Observe
10 ALM : related problems 2 Self Learning
05 Conclusion & Summary Discussion

Lecture Number: 7
Lecture Outcome:
Understand Non Deterministic Finite Automata (NFA)

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap of Expression and Regular language 1 Talk – Discussion
20 Non Deterministic Finite Automata (NFA), NFA representation, Examples 1 Chalk and Talk, PPT’s - Observe
10 ALM 2 Video
05 Conclusion & Summary Discussion

Lecture Number: 8
Lecture Outcome:
Understand the conversion from NFA to DFA

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on NFA 1 Talk - Discussion
20 Conversion from NFA to DFA 1 Chalk and Talk, PPT’s - Observe
10 ALM : related problems 2 Cross word puzzle
05 Conclusion & Summary Discussion

Lecture Number: 9
Lecture Outcome:
Understand the CFG

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Conversion from NFA to DFA 1 Talk - Discussion
20 NFA with € - Transitions, Examples 1 Chalk and Talk, PPT’s - Observe
10 ALM : related problems 2 In class Assessment
05 Conclusion & Summary Discussion

Lecture Number: 10
Lecture Outcome:
Understand converstion from NFA with € - Transitions to NFA without ε transitions and hence to DFA

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on NFA with € - Transitions 1 Talk - Discussion
20 Conversion from NFA with € - Transitions to NFA without ε transitions and 1 Chalk and Talk, PPT’s - Observe
 hence to DFA
10 ALM : related problems 2 In class assessment
05 Conclusion & Summary Discussion

Lecture Number: 11
Lecture Outcome:
Understand Minimization of FA

Time(min) theorem Topic BTL Teaching – Learning Method

05 Attendance
Recap on NFA with € - Transitions to NFA without ε transitions and hence to
10 1 Talk - Discussion
DFA
20 Minimization of FA and its importance 1 Chalk and Talk - Listen
10 ALM : related problems 2 Self Learning Material
05 Conclusion & Summary Discussion

Lecture Number: 12
Lecture Outcome:
Understand Conversion of regular expression to NFA

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Minimization of FA and its importance 1 Talk - Discussion
20 Conversion of regular expression to NFA with examples 1 Chalk and Talk - Listen
10 ALM : related problems 2 In class assessment
05 Conclusion & Summary Discussion

Lecture Number: 13
Lecture Outcome:
Understand CFG

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Conversion of regular expression to NFA 1 Talk - Discussion
20 Introduction to Grammars (CFG), CFG 1 Chalk and Talk - Listen
10 ALM : related problems 2 In class assessment
05 Conclusion & Summary Discussion

Lecture Number: 14
Lecture Outcome:
Represent CFG, Parse Tree and its relation to CFG,

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on CFG 1 Talk - Discussion
20 Represent CFG, Parse Tree and its relation to CFG, 1 Chalk and Talk - Listen
10 ALM : related problems 2 In class assessment
05 Conclusion & Summary Discussion

Lecture Number: 15
Lecture Outcome:
Understand Representation of CFG, Parse Tree and its relation to CFG,

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Representation of CFG, Parse Tree and its relation to CFG, 1 Talk - Discussion
20 Types of Derivations in deriving a string from any CFG, Parse trees 1 Chalk and Talk - Listen
Construction.
 10 ALM : related problems 2 Quiz / Puzzle
05 Conclusion & Summary Discussion

Lecture Number: 16
Lecture Outcome:
Understand CFG for a given language.

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
Recap on deriving a string from any CFG, Parse trees Construction.
10 1 Talk - Discussion
20 Designing a CFG for a given language. 1 Chalk and Talk - Listen
10 ALM : related problems 2 Quiz / Puzzle
05 Conclusion & Summary Discussion

Lecture Number: 17
Lecture Outcome:
Understand to Parsing and Parse Trees

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Designing a CFG 1 Talk – Discussion
20 Introduction to Parsing and Parse Trees 2 Chalk and Talk, PPT’s - Observe
10 ALM : related problems 2 Poster
5 Conclusion & Summary Discussion

Lecture Number: 18
Lecture Outcome:
Understand Top Down and Bottom Up Parsing

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Parsing and Parse Trees 1 Talk – Discussion
Top Down and Bottom Up Parsing
20 1 Chalk and Talk, PPT’s - Observe

10 ALM : related problems 2 Jumbled Sentences

05 Conclusion & Summary Discussion

Lecture Number: 19
Lecture Outcome:
Checking the Ambiguity of a CFG by constructing the parse trees

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Top Down and Bottom Up Parsing 1 Talk – Discussion
20 Checking the Ambiguity of a CFG by constructing the parse trees 1 Chalk and Talk, PPT’s - Observe
10 ALM : related problems 2 Jumbled Sentences
05 Conclusion & Summary Discussion

Lecture Number: 20
Lecture Outcome:
How eliminating ambiguity in CFG
 Time(min) Topic BTL Teaching – Learning Method
05 Attendance
10 Recap on Checking the Ambiguity of a CFG by constructing the parse trees 1 Talk – Discussion
20 Ambiguous grammars & eliminating ambiguity 1 Chalk and Talk – Listen
10 ALM : related problems 1 In class assessment
05 Conclusion & Summary Discussion

Lecture Number: 21
Lecture Outcome:
Understand Parsers, Backtracking.

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Ambiguous grammars & eliminating ambiguity- 1 Talk – Discussion
20 Types of Parsers, Backtracking with problem 1 Chalk and Talk – Listen
10 ALM : related problems 2 In class assessment
05 Conclusion & Summary Discussion

Lecture Number: 22
Lecture Outcome:
Understand Recursive Descent Parsing, Predictive Parsing .

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Types of Parsers, Backtracking with problem 1 Talk – Discussion
20 Recursive Descent Parsing, Predictive Parsing with algorithm 1 Chalk and Talk, PPT’s - Observe
10 ALM : related problems 2 In class assessment
05 Conclusion & Summary Discussion

Lecture Number: 23
Lecture Outcome:
Learn Construction of LL(1) Parsing Table

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Recursive Descent Parsing, Predictive Parsing 1 Talk – Discussion
20 Construction of LL(1) Parsing Table 1 Chalk and Talk – Listen
10 ALM : related problems 2 Quiz
05 Conclusion & Summary Discussion

Lecture Number: 24
Lecture Outcome:
Understand Bottom-up Parsing

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Construction of LL(1) Parsing Table 1 Talk – Discussion
10 Introduction to Bottom-up Parsing 1 Chalk and Talk – Listen
20 ALM 2 In class assessment
05 Conclusion & Summary Discussion

Lecture Number: 25
Lecture Outcome:
Learn Construction of LALR Parser
Time(min) Topic BTL Teaching – Learning Method
05 Attendance
10 Recap on Construction of LL(1) Parsing Table 1 Talk – Discussion
20 Construction of LALR Parser 1 Chalk and Talk, PPT’s - Observe
 10 ALM 2 In class assessment
05 Conclusion & Summary Discussion

Lecture Number: 26
Lecture Outcome:
Construction of bottom-up parser
Time(min) Topic BTL Teaching – Learning Method
05 Attendance
10 Recap on Construction of LALR Parser 1 Talk – Discussion
20 Construction of bottom-up parser with ambiguous grammar 1 Chalk and Talk, PPT’s – Observe
10 ALM: construction of bottom -up parser 2 In class assessment
5 Conclusion & Summary Discussion

Lecture Number: 27
Lecture Outcome:
Understand Syntax directed translation definition (Attribute Grammar)

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Construction of bottom-up parser with ambiguous grammar 1 Talk – Discussion
20 Syntax directed translation definition (Attribute Grammar) 1 Chalk and Talk, PPT’s – Observe
10 ALM 2 In class assessment
5 Conclusion & Summary Discussion

Lecture Number: 28
Lecture Outcome:
Understand Construction of Syntax Trees

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Syntax directed translation definition (Attribute Grammar) 1 Talk – Discussion
20 Construction of Syntax Trees 1 Chalk and Talk, PPT’s - Observe
10 ALM: Problems related 2 In class assessment
5 Conclusion & Summary Discussion

Lecture Number: 29
Lecture Outcome:
Learn Bottom Up evaluation of S- attributed definition

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Construction of Syntax Trees 1 Talk – Discussion
20 Bottom Up evaluation of S- attributed definition 1 Chalk and Talk, PPT’s - Observe
10 ALM 2 In class assessment
5 Conclusion & Summary Discussion

Lecture Number: 30
Lecture Outcome:
Understand L-attributed definition

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Bottom Up evaluation of S- attributed definition 1 Talk – Discussion
20 L-attributed definition 1 Chalk and Talk, PPT’s - Observe
10 ALM 2 In class assessment
5 Conclusion & Summary Discussion

Lecture Number: 31
Lecture Outcome:
Understand Translation of simple statements and control flow statements

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on L-attributed definition 1 Talk – Discussion
20 Translation of simple statements and control flow statements 1 Chalk and Talk, PPT’s - Observe
10 ALM 2 In class assessment
5 Conclusion & Summary Discussion

Lecture Number: 32
Lecture Outcome:
Understand building AST

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Translation of simple statements and control flow statements 1 Talk – Discussion
Building
20 1 Chalk and Talk, PPT’s - Observe
Abstract Syntax Tree(AST)
10 Problems on AST 2 Quiz
5 Conclusion & Summary Discussion

Lecture Number: 33
Lecture Outcome:
Understand Type Checking- Type systems

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
Recap on
10 Building 1 Talk – Discussion
Abstract Syntax Tree(AST)
20 Type Checking- Type systems 1 Chalk and Talk, PPT’s - Observe
10 ALM 2 In class assessment
5 Conclusion & Summary Discussion

Lecture Number: 34
Lecture Outcome:
Apply Equivalence of type expression

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on TypeChecking- Type systems 1 Talk – Discussion

20 Equivalence of type expression 1 Chalk and Talk – Listen

10 Problems related checking equivalence of type expression 2 Quiz

5 Conclusion & Summary Discussion

Lecture Number: 35
Lecture Outcome:
Understand type conversion

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on 1 Talk – Discussion
 Equivalence of type expression

20 Type conversion 1 Chalk and Talk – Listen

10 ALM: problems on type conversion 2 Jumbled Sentences
5 Conclusion & Summary Discussion

Lecture Number: 36
Lecture Outcome:
Understand Overloading of functions and operators

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Type conversion 1 Talk – Discussion
20 Overloading of functions and operators 1 Chalk and Talk – Listen
10 ALM 2 Quiz
5 Conclusion & Summary Discussion

Lecture Number: 37
Lecture Outcome:
Understand POSETS

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Overloading of functions and operators 1 Talk – Discussion
20 Run Time Storage- Source language issues 1 Chalk and Talk – Listen
10 ALM 2 In class assessment
5 Conclusion & Summary Discussion

Lecture Number: 38
Lecture Outcome:
Understand Problems on Lattices

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Run Time Storage- Source language issues 1 Talk – Discussion
20 Storage Organization 1 Chalk and Talk – Listen
10 ALM 2 Quiz
5 Conclusion & Summary Discussion

Lecture Number: 39
Lecture Outcome:
Understand and Apply Topological sorting

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Storage Organization 1 Talk – Discussion
20 Storage allocation strategies 1 Chalk and Talk – Listen
10 ALM 2 In class assessment
5 Conclusion & Summary Discussion

Lecture Number: 40
Lecture Outcome:
Analyzes Graphs, Types of Graphs and Subgraphs
 Time(min) Topic BTL Teaching – Learning Method
05 Attendance
10 Recap on Storage allocation strategies 1 Talk – Discussion
20 Access to non-local names 1 Chalk and Talk – Listen
10 Active Learning Program (LTC) 2 Match the following
5 Conclusion & Summary Discussion

Lecture Number:41
Lecture Outcome:
Understand concepts of Isomorphism

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
Recap on Access to non-local names
10 1 Talk – Discussion
20 Parametric passing 1 Chalk and Talk – Listen
20 Active Learning Program 2 One minute paper
05 Conclusion & Summary Discussion

Lecture Number: 42
Lecture Outcome:
Understand the Symbol tables

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Parametric passing 1 Talk – Discussion
20 Symbol tables 1 Chalk and Talk, PPT’s - Observe
10 Active Learning Program (LTC): related problems 2 Chart / Follow chart
5 Conclusion & Summary Discussion

Lecture Number: 43
Lecture Outcome:
Understand Language facilities for dynamic storage allocation

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Symbol tables 1 Talk – Discussion
20 Language facilities for dynamic storage allocation 1 Chalk and Talk, PPT’s - Observe
Active Learning Program (LTC) :
10 2 Video synthesis
related problems
5 Conclusion & Summary Discussion

Lecture Number: 44
Lecture Outcome:
Understand Intermediate code generation

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Language facilities for dynamic storage allocation 1 Talk – Discussion
20 Intermediate code generation 1 Chalk and Talk, PPT’s - Observe
10 Active Learning Program (LTC) 2 In class Assessment
5 Conclusion & Summary Discussion

Lecture Number: 45
Lecture Outcome:
Understand The target machine

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Intermediate code generation 1 Talk – Discussion
20 The target machine 1 Chalk and Talk, PPT’s - Observe
10 Active Learning Program (LTC) : related problems 2 Match the following
5 Conclusion & Summary Discussion

Lecture Number: 46
Lecture Outcome:
Understand concepts Basic blocks and flow graphs

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on The target machine 1 Talk – Discussion
20 Basic blocks and flow graphs 1 Chalk and Talk, PPT’s - Observe
10 ALM: related problems 2 In class Assessment
5 Conclusion & Summary Discussion

Lecture Number: 47
Lecture Outcome:
A simple code generator

Time(min) Topic BTL Teaching – Learning Method

05 Attendance
10 Recap on Basic blocks and flow graphs 1 Talk – Discussion
20 A simple code generator 1 Chalk and Talk, PPT’s - Observe
10 Active Learning Program (LTC) : related problems 2 In class Assessment
5 Conclusion & Summary Discussion

Lecture Number: 48
Lecture Outcome:
Register Allocation and assignment

Time(min) Topic BTL Teaching – Learning Method

05
Attendance
10 Recap on A simple code generator 1 Talk – Discussion
Register Allocation and assignment
20 1 Chalk and Talk, Practice

10 Active Learning Program : related applications 2 Develops applications

5 Conclusion & Summary Discussion

Lecture Number: 49
Lecture Outcome:
DAG representation of Block

Time(min) Topic BTL Teaching – Learning Method

05
Attendance
Recap on Register Allocation and assignment
10 1 Talk – Discussion
20 DAG representation of Block 1 Chalk and Talk, Practice
10 Active Learning Program 2 Develops applications
 5 Conclusion & Summary Discussion

Lecture Number: 50
Lecture Outcome:
Generate code for DAG’s

Time(min) Topic BTL Teaching – Learning Method

05
Attendance
10 Recap on DAG representation of Block 1 Talk – Discussion
20 Generating code from DAGs 1 Chalk and Talk, Practice
10 Active Learning Program : related applications 2 Develops applications
5 Conclusion & Summary Discussion

Lecture Number: 51
Lecture Outcome:

Peephole optimization

Time(min) Topic BTL Teaching – Learning Method

05
Attendance
10 Recap on Generating code from DAGs 1 Talk – Discussion
20 Peephole optimization 1 Chalk and Talk, Practice
10 Active Learning Program : related applications 2 Develops applications
5 Conclusion & Summary Discussion

Lecture Number: 52
Lecture Outcome:
Understand source of optimization

Time(min) Topic BTL Teaching – Learning Method

05
Attendance
10 Recap on Peephole optimization 1 Talk – Discussion
20 The principal source of optimization 1 Chalk and Talk, Practice
10 Active Learning Program : related applications 2 Develops applications
5 Conclusion & Summary Discussion

Lecture Number: 53
Lecture Outcome:
Optimization of basic blocks

Time(min) Topic BTL Teaching – Learning Method

05
Attendance
10 Recap on The principal source of optimization 1 Talk – Discussion
20 Optimization of basic blocks 1 Chalk and Talk, Practice
10 Active Learning Program : related applications 2 Develops applications
5 Conclusion & Summary Discussion

Lecture Number: 54
Lecture Outcome:
Global data flow analysis
 Time(min) Topic BTL Teaching – Learning Method
05
Attendance
10 Recap on Optimization of basic blocks 1 Talk – Discussion
20 Introduction to global data flow analysis 1 Chalk and Talk, Practice
10 Active Learning Program : related applications 2 Develops applications
5 Conclusion & Summary Discussion

Lecture Number: 55
Lecture Outcome:
Understand structured flow graph

Time(min) Topic BTL Teaching – Learning Method

05
Attendance
10 Recap on global data flow analysis 1 Talk – Discussion
Data flow analysis of structured flow graph
20 1 Chalk and Talk, Practice

10 Active Learning Program : related applications 2 Develops applications

5 Conclusion & Summary Discussion

Lecture Number: 56
Lecture Outcome:
Understand Symbolic debugging of optimized code

Time(min) Topic BTL Teaching – Learning Method

05
Attendance
Recap on Data flow analysis of structured flow graph
10 1 Talk – Discussion
20 Symbolic debugging of optimized code 1 Chalk and Talk, Practice
10 Active Learning Program : related applications 2 Develops applications
5 Conclusion & Summary Discussion

Laboratory Delivery Plan:

session no List of Experiments CO-Mapping

1 CO 1
Write a program to perform operations on sets.

2 CO 1
Write a program to find the possible subsets for a given set.

3 CO 1
a) Write a program to find the inversion of a given matrix.
b) Write a program to display the rows of a given matrix by eliminating the duplicate rows.

4 CO 1
a) Write a program to display the ncr table.
b)Write a program to find the no. of ways to rearrange the given word by placing the vowels
together

5 CO 2
Write a program to find the given expression is tautology or not.
 6 CO 2
Write a program to find the super digit of an integer.

7 CO 3
Write a program to sort the given elements in an array using divide and conquer approach.

8 CO 4
Write a program to find the minimum cost spanning tree for a given graph using kruskal's
algorithm

9 CO 4
Write a program to implement the shortest path routing using dijsktra's algorithm

10 CO 4
Write a program to find the minimum number of colors for a given graph.

Tutorial Delivery Plan:

Tutorial Topics discussed in Tutorials CO-Mapping

Session

1 CO 1

2 CO 1

3 CO 1

4 CO 2

5 CO 2

6 CO 2

7 CO 3

8 CO 3

9 CO 3

10 CO 4

11 CO 4

12 CO 4
 EVALUATION PLAN:

Evaluation CO CO CO CO CO
Type Evaluation Component Weightage /Marks Assessment Dates Duration 1 2 3 4 5
Bloom's Taxonomy Level 2,3 2,3 2,3 2,3 2,3
Weightage 10 2.5 2.5 2.5 2.5
ALM & Tutorial Max Marks 160 Continuous Evaluation 40 40 40 40
Weightage 5 Lab experiment 5
continuous
evaluation will be for
25 marks for each
experiment and the
Formative
average of all
Evaluation
experiments is scaled
Total = 20%
to 5. Initial rubrics for
evaluation are:
[ Record(5) +
Lab Continuous Experimentation (10)
Evaluation Max Marks 25 Continuous Evaluation + Viva-voce(10)] 25
Weightage 5
Attendance Max Marks 5 Continuous Evaluation (Equal weightage to all sessions)
Weightage 12 6 6
Test-1 Max Marks 30 Test 1 Dates 1.5 hrs 15 15
Weightage 12 6 6
Test-2 Max Marks 30 Test 2 Dates 1.5 hrs 15 15
In-Semester
Summative Lab exam will be
Evaluation conducted for 25
Total = 30% Weightage 6 marks and scaled to 6
Lab Internal Tests 6. Initial rubrics for
evaluation are:[Write
up (10) +
Experimentation (10)
Max Marks 25 Lab Internal Dates 1.5 hrs + Vivavoce(5)] 25
 Lab exam will be
conducted for 50
marks and scaled to
End 10. Initial rubrics for
Semester evaluation are:
Summative [Record (10) + Write
Evaluation up (10) +
Total = 50% Weightage 10 Experimentation (20) 10
SE LAB EXAM Max Marks 50 Lab External Dates 1.5 hrs + Vivavoce(10)] 50
Weightage 40 10 10 10 10
Sem End Exam
Semester End Exam Max Marks 60 Dates 3 hrs 15 15 15 15

Course Team members, Chamber Consultation Hours and Chamber Venue details:

Chamber
Chamber Consultation Chamber Consultation Signature of
S.No. Name of Faculty Consultation
Day(s) Timings for each day Course faculty
Room No:
1
Ketan Anand All working days 12:40 to 1:30PM R-202

2 Mrs. Spandana All working days 12:40 to 1:30 PM R-202

Signature of Course Coordinator:

Signature of Vetting Team:

Recommended by HEAD OF DEPARTMENT: Approved By: DEAN-ACADEMICS

(Sign with Office Seal)