LESSON PLAN

SUBJECT : Automata Theory and Compiler Design

DEPARTMENT : CSE (ARTIFICIAL INTELLIGENCE & MACHINE LEARNING)
ACADEMIC YEAR : 2024-2025
PROGRAM : B-TECH
YEAR/SEM : II-II
SECTION : A
FACULTY : Mrs. S. Naveena

Course Objectives
● To introduce the fundamental concepts of formal languages, grammars and
automata theory.
● To understand deterministic and non-deterministic machines and the
differences between decidability and undecidability.
● Introduce the major concepts of language translation and compiler
design and impart the knowledge of practical skills necessary for
constructing a compiler.
● Topics include phases of compiler, parsing, syntax directed translation,
type checking use of symbol tables, intermediate code generation

Course Outcomes
● Able to employ finite state machines for modeling and solving computing
problems.
● Able to design context free grammars for formal languages.
● Able to distinguish between decidability and undecidability.
● Demonstrate the knowledge of patterns, tokens & regular expressions for lexical
analysis.
● Acquire skills in using lex tool and design LR parsers
 Program Reference
Unit Lesson No. of Topic/Sub Mode of Course
Date Outcome Text
No. No. Periods Topic Teaching Outcome
(PO) Books
Introduction to
1.1 10.01.25 1 PPT T1
Finite Automata
Structural
Representations,
1.2 11.01.25 2 PPT T1
Automata and
Complexity
The central
concepts of
1.3 17.01.25 1 PPT T1
Automata Theory
- Alphabets
Strings,
1.4 20.01.25 1 Languages, PPT T1
Problems
NFA : Formal
definition, an
1.5 21.01.25 1 PPT T1
application, Text
search CO1
I Finite Automata
1.6 22.01.25 1 with Epsilon- PPT T1
Transitions
DFA: Definition of
1.7 23.01.25 2 DFA, How a DFA PPT T1
process Strings
The language of
1.8 24.01.25 1 PPT T1
DFA
Conversion of NFA
with Epsilon-
1.9 27.01.25 1 Transition to NFA PPT T1
without Epsilon-
Transition
Conversion of NFA
1.10 28.01.25 2 PPT T1
to DFA

Assignment Test Unit 1

Regular
Expressions:
2.1 29.01.25 1 Finite Automata PPT T1
and Regular
II CO3
expressions
30.01.25 Applications of
2.2 1 Regular PPT T1
expressions
 31.01.25 Algebraic laws for
2.3 1 Regular PPT T1
expressions
03.02.25 Conversion of
Finite Automata
2.4 1 PPT T1
to Regular
expressions
04.02.25 Pumping Lemma
for Regular
2.5 1 Expressions: PPT T1
Statement of the
pumping lemma
05.02.25 Applications of
pumping lemma,
Context-Free
Grammars:
2.6 2 Definition of PPT T1
context free
grammar,
Derivations using
a grammar
06.02.25 Left most and
2.7 1 Right most PPT T1
Derivations
07.02.25 The language of a
grammar, Parse
2.8 2 Trees, Ambiguity PPT T1
in grammars and
languages

Assignment Test Unit 2

10.02.25 Push Down
Automata:
3.1 1 PPT T1
Definition of push
down Automata
11.02.25 The languages of
3.2 1 PDA, Equivalence PPT T1
of PDA and CFG’s
13.02.25 Acceptance by
final state, Turing
III 3.3 2 Machines: PPT CO1 T1
Introduction to
Turing Machine
14.02.25
3.4 1 Formal PPT T1
Description
17.02.25 Instantaneous
3.5 1 PPT T1
description
18.02.25 The language of a
3.6 2 PPT T1
Turing Machine
 3.7 19.02.25 1 PPT T1
Undecidability
20.02.25 A language that is
3.8 1 Not Recursively PPT T1
Enumerable
21.02.25 An undecidable
3.9 2 PPT T1
problem that is RE
24.02.25 Undecidable
3.10 1 Problems about PPT T1
Turing Machines

Assignment Test Unit 3

24.03.25 Introduction: The
4.1 2 structure of a PPT T1
compiler
25.03.25 Lexical Analysis
4.2 1 The role of Lexical PPT T1
analyzer
26.03.25 Input Buffering,
4.3 1 Recognition of PPT T1
Tokens
27.03.25 The Lexical
4.4 2 Analyzer PPT T1
generator Lex
IV 01.04.25 Syntax Analysis: CO2
4.5 1 PPT T1
Introduction
02.04.25 Context- free
4.6 1 grammars, writing PPT T1
a grammar
03.04.25 Top-down parsing,
4.7 2 PPT T1
Bottom up Parsing
04.04.25
4.8 1 Introduction to LR PPT T1
Parsing:
07.04.25 Simple LR, More
4.9 1 powerful LR PPT T1
Parsers

Assignment Test Unit 4

08.04.25 Syntax-Directed
Translation:
Syntax-Directed
5.1 2 PPT T1
Definitions,
V Evaluation orders CO1
for SDD’s
09.04.25 Syntax-Directed
5.2 1 Translation PPT T1
schemes
 11.04.25
5.3 1 Implementing PPT T1
L-Attributed SDD’s
16.04.25
5.4 1 Intermediate- PPT T1
code generation
17.04.25 Variants of syntax
5.5 2 Trees, Three- PPT T1
Address code
19.04.25 Run time
5.6 1 PPT T1
Environments
21.04.25 Stack Allocation of
5.7 1 PPT T1
space
22.04.25 Access to Non
local Data on the
5.8 2 PPT T1
stack, Heap
Management
Assignment Test Unit 5

TEXT BOOKS:
1. Introduction to Automata Theory, Languages, and Computation, 3 nd Edition,
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
2. Theory of Computer Science – Automata languages and computation,

Mishra and Chandrashekaran, 2nd Edition, PHI.

REFERENCE BOOKS:
1. Compilers: Principles, Techniques and Tools, Alfred V. Aho, Monica S. Lam, Ravi
Sethi, Jeffry
D. Ullman, 2nd Edition, Pearson.
2. Introduction to Formal languages Automata Theory and Computation,
Kamala Krithivasan, Rama R, Pearson.
3. Introduction to Languages and The Theory of Computation, John C Martin, TMH.
4. lex & yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly Compiler Construction,
Kenneth
C. Louden, Thomson. Course Technology.
 SUBJECT : Automata Theory and Compiler Design

DEPARTMENT : CSE (ARTIFICIAL INTELLIGENCE & MACHINE LEARNING)

ACADEMIC YEAR : 2024-2025
PROGRAM : B-TECH
YEAR/SEM : II-II

SECTION : B
FACULTY : Mrs. S. Naveena

Course Objectives
● To introduce the fundamental concepts of formal languages, grammars and
automata theory.
● To understand deterministic and non-deterministic machines and the
differences between decidability and undecidability.
● Introduce the major concepts of language translation and compiler
design and impart the knowledge of practical skills necessary for
constructing a compiler.
● Topics include phases of compiler, parsing, syntax directed translation,
type checking use of symbol tables, intermediate code generation

Course Outcomes
● Able to employ finite state machines for modeling and solving computing
problems.
● Able to design context free grammars for formal languages.
● Able to distinguish between decidability and undecidability.
● Demonstrate the knowledge of patterns, tokens & regular expressions for lexical
analysis.
● Acquire skills in using lex tool and design LR parsers
 Program Reference
Unit Lesson No. of Topic/Sub Mode of Course
Date Outcome Text
No. No. Periods Topic Teaching Outcome
(PO) Books
Introduction to
1.1 10.01.25 1 PPT T1
Finite Automata
17.01.25 Structural
1.2 1 PPT T1
Representations
18.01.25 Automata and
1.3 1 PPT T1
Complexity
20.01.25 The central
concepts of
1.4 1 PPT T1
Automata Theory
- Alphabets
21.01.25 Strings,
1.5 1 Languages, PPT T1
Problems
22.01.25 NFA : Formal
definition, an
1.6 1 PPT T1
application, Text
search
24.01.25 Finite Automata CO1
I 1.7 1 with Epsilon- PPT T1
Transitions
25.01.25 DFA: Definition of
1.8 1 PPT T1
DFA
27.01.25 How a DFA
1.9 1 PPT T1
process Strings
28.01.25 The language of
1.10 1 PPT
DFA
T1
29.01.25
1.11 1 Conversion of NFA PPT
31.01.25 Epsilon-Transition
1.12 1 to NFA without PPT T1
Epsilon-Transition
01.02.25
Conversion of NFA
1.13 1 PPT T1
to DFA

Assignment Test Unit 1

03.02.25 Regular
Expressions:
II 2.1 1 PPT CO3 T1
Finite Automata
and Regular
 expressions

04.02.25 Applications of
2.2 1 Regular PPT T1
expressions
05.02.25 Algebraic laws for
2.3 1 Regular PPT T1
expressions
07.02.25 Conversion of
Finite Automata
2.4 1 PPT T1
to Regular
expressions
10.02.25 Pumping Lemma
for Regular
2.5 1 Expressions: PPT T1
Statement of the
pumping lemma
11.02.25
2.6 1 Applications of PPT T1
pumping lemma
12.02.25 Context-Free
Grammars:
2.7 1 Definition of PPT T1
context free
grammar
14.02.25 Derivations using
2.8 1 PPT T1
a grammar
15.02.25 Left most and
Right most
2.9 1 Derivations, The PPT T1
language of a
grammar
17.02.25 Parse Trees,
Ambiguity in
2.10 1 PPT T1
grammars and
languages

Assignment Test Unit 2

18.02.25 Push Down
Automata:
3.1 1 PPT T1
Definition of push
down Automata
19.02.25 The languages of
3.2 1 PPT T1
III PDA CO1
21.02.25 Equivalence of
3.3 1 PPT T1
PDA and CFG’s
22.02.25
3.4 1 Acceptance by PPT T1
final state
 24.02.25 Turing Machines:
3.5 1 Introduction to PPT T1
Turing Machine
25.02.25 Formal
3.6 1 PPT T1
Description
28.02.25 Instantaneous
3.7 1 PPT T1
description
01.03.25 The language of a
3.8 1 PPT T1
Turing Machine
3.9 03.03.25 1 PPT T1
Undecidability
04.03.25 A language that is
3.10 1 Not Recursively PPT T1
Enumerable
05.03.25 An undecidable
3.11 1 PPT T1
problem that is RE
07.03.25 Undecidable
3.12 1 Problems about PPT T1
Turing Machines

Assignment Test Unit 3

24.03.25 Introduction: The
4.1 1 structure of a PPT T1
compiler
25.03.25 Lexical Analysis
4.2 1 The role of Lexical PPT T1
analyzer
26.03.25 Input Buffering,
4.3 1 Recognition of PPT T1
Tokens
28.03.25 The Lexical
4.4 1 Analyzer PPT T1
generator Lex
29.03.25 Syntax Analysis:
IV 4.5 1 PPT CO2 T1
Introduction
31.03.25 Context- free
4.6 1 grammars, writing PPT T1
a grammar
01.04.25 Top-down parsing,
4.7 1 PPT T1
Bottom up Parsing
02.04.25
4.8 1 Introduction to LR PPT T1
Parsing:
04.04.25

4.9 1 Simple LR, More PPT T1

powerful LR
Parsers
 Assignment Test Unit 4
07.04.25 Syntax-Directed
Translation:
5.1 1 PPT T1
Syntax-Directed
Definitions
08.04.25 Evaluation orders
5.2 1 PPT T1
for SDD’s
09.04.25 Syntax-Directed
5.3 1 Translation PPT T1
schemes
11.04.25
5.4 1 Implementing PPT T1
L-Attributed SDD’s
15.04.25 Intermediate-
5.5 1 PPT T1
code generation
16.04.25 Variants of syntax
5.6 1 PPT T1
V Trees CO1
19.04.25 Three-Address
5.7 1 PPT T1
code
21.04.25 Run time
5.8 1 PPT T1
Environments
22.04.25 Stack Allocation of
5.9 1 PPT T1
space
23.04.25 Access to Non
5.10 1 local Data on the PPT T1
stack
24.04.25
5.11 1 Heap PPT T1
Management
Assignment Test Unit 5
 TEXT BOOKS:
1. Introduction to Automata Theory, Languages, and Computation, 3 nd Edition,
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
2. Theory of Computer Science – Automata languages and computation,

Mishra and Chandrashekaran, 2nd Edition, PHI.

REFERENCE BOOKS:
1. Compilers: Principles, Techniques and Tools, Alfred V. Aho, Monica S. Lam, Ravi
Sethi, Jeffry
D. Ullman, 2nd Edition, Pearson.
2. Introduction to Formal languages Automata Theory and Computation,
Kamala Krithivasan, Rama R, Pearson.
3. Introduction to Languages and The Theory of Computation, John C Martin, TMH.
4. lex & yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly Compiler Construction,
Kenneth
C. Louden, Thomson. Course Technology.
 SUBJECT : Automata Theory and Compiler Design

DEPARTMENT : CSE (ARTIFICIAL INTELLIGENCE & MACHINE LEARNING)

ACADEMIC YEAR : 2024-2025
PROGRAM : B-TECH
YEAR/SEM : II-II

SECTION : C
FACULTY : Mrs. S. Naveena

Course Objectives
● To introduce the fundamental concepts of formal languages, grammars and
automata theory.
● To understand deterministic and non-deterministic machines and the
differences between decidability and undecidability.
● Introduce the major concepts of language translation and compiler
design and impart the knowledge of practical skills necessary for
constructing a compiler.
● Topics include phases of compiler, parsing, syntax directed translation,
type checking use of symbol tables, intermediate code generation

Course Outcomes
● Able to employ finite state machines for modeling and solving computing
problems.
● Able to design context free grammars for formal languages.
● Able to distinguish between decidability and undecidability.
● Demonstrate the knowledge of patterns, tokens & regular expressions for lexical
analysis.
● Acquire skills in using lex tool and design LR parsers
 Program Reference
Unit Lesson No. of Topic/Sub Mode of Course
Date Outcome Text
No. No. Periods Topic Teaching Outcome
(PO) Books
Introduction to
1.1 10.01.25 1 PPT T1
Finite Automata
17.01.25 Structural
1.2 1 PPT T1
Representations
18.01.25 Automata and
1.3 1 PPT T1
Complexity
20.01.25 The central
concepts of
1.4 1 PPT T1
Automata Theory
- Alphabets
22.01.25 Strings,
1.5 1 Languages, PPT T1
Problems
23.01.25 NFA : Formal
definition, an
1.6 1 PPT T1
application, Text
search
24.01.25 Finite Automata CO1
I 1.7 1 with Epsilon- PPT T1
Transitions
25.01.25 DFA: Definition of
1.8 1 PPT T1
DFA
27.01.25 How a DFA
1.9 1 PPT T1
process Strings
29.01.25 The language of
1.10 1 PPT
DFA
T1
30.01.25
1.11 1 Conversion of NFA PPT
31.01.25 Epsilon-Transition
1.12 1 to NFA without PPT T1
Epsilon-Transition
01.02.25
Conversion of NFA
1.13 1 PPT T1
to DFA

Assignment Test Unit 1

03.02.25 Regular
Expressions:
II 2.1 1 PPT CO3 T1
Finite Automata
and Regular
 expressions

05.02.25 Applications of
2.2 1 Regular PPT T1
expressions
06.02.25 Algebraic laws for
2.3 1 Regular PPT T1
expressions
07.02.25 Conversion of
Finite Automata
2.4 1 PPT T1
to Regular
expressions
10.02.25 Pumping Lemma
for Regular
2.5 1 Expressions: PPT T1
Statement of the
pumping lemma
12.02.25
2.6 1 Applications of PPT T1
pumping lemma
13.02.25 Context-Free
Grammars:
2.7 1 Definition of PPT T1
context free
grammar
14.02.25 Derivations using
2.8 1 PPT T1
a grammar
15.02.25 Left most and
Right most
2.9 1 Derivations, The PPT T1
language of a
grammar
17.02.25 Parse Trees,
Ambiguity in
2.10 1 PPT T1
grammars and
languages

Assignment Test Unit 2

19.02.25 Push Down
Automata:
3.1 1 PPT T1
Definition of push
down Automata
20.02.25 The languages of
III 3.2 1 PPT CO1 T1
PDA
21.02.25 Equivalence of
3.3 1 PPT T1
PDA and CFG’s
22.02.25 Acceptance by
3.4 1 PPT T1
final state
 24.02.25 Turing Machines:
3.5 1 Introduction to PPT T1
Turing Machine
27.02.25 Formal
3.6 1 PPT T1
Description
28.02.25 Instantaneous
3.7 1 PPT T1
description
01.03.25 The language of a
3.8 1 PPT T1
Turing Machine
3.9 03.03.25 1 PPT T1
Undecidability
05.03.25 A language that is
3.10 1 Not Recursively PPT T1
Enumerable
06.03.25 An undecidable
3.11 1 PPT T1
problem that is RE
07.03.25 Undecidable
3.12 1 Problems about PPT T1
Turing Machines
3.13 10.03.25 1 PPT T1
Turing Machines

Assignment Test Unit 3

24.03.25 Introduction: The
4.1 1 structure of a PPT T1
compiler
26.03.25 Lexical Analysis
4.2 1 The role of Lexical PPT T1
analyzer
27.03.25 Input Buffering,
4.3 1 Recognition of PPT T1
Tokens
28.03.25 The Lexical
4.4 1 Analyzer PPT T1
generator Lex
IV 29.03.25 Syntax Analysis: CO2
4.5 1 PPT T1
Introduction
31.03.25 Context- free
4.6 1 grammars, writing PPT T1
a grammar
02.04.25 Top-down parsing,
4.7 1 PPT T1
Bottom up Parsing
03.04.25
4.8 1 Introduction to LR PPT T1
Parsing:
04.04.25 Simple LR, More
4.9 1 powerful LR PPT T1
Parsers
 Assignment Test Unit 4
07.04.25 Syntax-Directed
Translation:
5.1 1 PPT T1
Syntax-Directed
Definitions
08.04.25 Evaluation orders
5.2 1 PPT T1
for SDD’s
09.04.25 Syntax-Directed
5.3 1 Translation PPT T1
schemes
10.04.25
5.4 1 Implementing PPT T1
L-Attributed SDD’s
11.04.25 Intermediate-
5.5 1 PPT T1
code generation
16.04.25 Variants of syntax
5.6 1 PPT T1
V Trees CO1
17.04.25 Three-Address
5.7 1 PPT T1
code
19.04.25 Run time
5.8 1 PPT T1
Environments
21.04.25 Stack Allocation of
5.9 1 PPT T1
space
23.04.25 Access to Non
5.10 1 local Data on the PPT T1
stack
24.04.25
5.11 1 Heap PPT T1
Management
Assignment Test Unit 5
 TEXT BOOKS:
1. Introduction to Automata Theory, Languages, and Computation, 3 nd Edition,
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
2. Theory of Computer Science – Automata languages and computation,

Mishra and Chandrashekaran, 2nd Edition, PHI.

REFERENCE BOOKS:
1. Compilers: Principles, Techniques and Tools, Alfred V. Aho, Monica S. Lam, Ravi
Sethi, Jeffry
D. Ullman, 2nd Edition, Pearson.
2. Introduction to Formal languages Automata Theory and Computation,
Kamala Krithivasan, Rama R, Pearson.
3. Introduction to Languages and The Theory of Computation, John C Martin, TMH.
4. lex & yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly Compiler Construction,
Kenneth
C. Louden, Thomson. Course Technology.
 SUBJECT : Automata Theory and Compiler Design

DEPARTMENT : CSE (ARTIFICIAL INTELLIGENCE & MACHINE LEARNING)

ACADEMIC YEAR : 2024-2025
PROGRAM : B-TECH
YEAR/SEM : II-II

SECTION : D
FACULTY : Mrs. S. Naveena

Course Objectives
● To introduce the fundamental concepts of formal languages, grammars and
automata theory.
● To understand deterministic and non-deterministic machines and the
differences between decidability and undecidability.
● Introduce the major concepts of language translation and compiler
design and impart the knowledge of practical skills necessary for
constructing a compiler.
● Topics include phases of compiler, parsing, syntax directed translation,
type checking use of symbol tables, intermediate code generation

Course Outcomes
● Able to employ finite state machines for modeling and solving computing
problems.
● Able to design context free grammars for formal languages.
● Able to distinguish between decidability and undecidability.
● Demonstrate the knowledge of patterns, tokens & regular expressions for lexical
analysis.
● Acquire skills in using lex tool and design LR parsers
 Program Reference
Unit Lesson No. of Topic/Sub Mode of Course
Date Outcome Text
No. No. Periods Topic Teaching Outcome
(PO) Books
Introduction to
1.1 10.01.25 1 PPT T1
Finite Automata
17.01.25 Structural
1.2 1 PPT T1
Representations
18.01.25 Automata and
1.3 1 PPT T1
Complexity
20.01.25 The central
concepts of
1.4 1 PPT T1
Automata Theory
- Alphabets
21.01.25 Strings,
1.5 1 Languages, PPT T1
Problems
22.01.25 NFA : Formal
definition, an
1.6 1 PPT T1
application, Text
search
24.01.25 Finite Automata CO1
I 1.7 1 with Epsilon- PPT T1
Transitions
25.01.25 DFA: Definition of
1.8 1 PPT T1
DFA
27.01.25 How a DFA
1.9 1 PPT T1
process Strings
28.01.25 The language of
1.10 1 PPT
DFA
T1
29.01.25
1.11 1 Conversion of NFA PPT
31.01.25 Epsilon-Transition
1.12 1 to NFA without PPT T1
Epsilon-Transition
01.02.25
Conversion of NFA
1.13 1 PPT T1
to DFA

Assignment Test Unit 1

03.02.25 Regular
Expressions:
II 2.1 1 PPT CO3 T1
Finite Automata
and Regular
 expressions

04.02.25 Applications of
2.2 1 Regular PPT T1
expressions
05.02.25 Algebraic laws for
2.3 1 Regular PPT T1
expressions
07.02.25 Conversion of
Finite Automata
2.4 1 PPT T1
to Regular
expressions
10.02.25 Pumping Lemma
for Regular
2.5 1 Expressions: PPT T1
Statement of the
pumping lemma
11.02.25
2.6 1 Applications of PPT T1
pumping lemma
12.02.25 Context-Free
Grammars:
2.7 1 Definition of PPT T1
context free
grammar
14.02.25 Derivations using
2.8 1 PPT T1
a grammar
15.02.25 Left most and
Right most
2.9 1 Derivations, The PPT T1
language of a
grammar
17.02.25 Parse Trees,
Ambiguity in
2.10 1 PPT T1
grammars and
languages

Assignment Test Unit 2

18.02.25 Push Down
Automata:
3.1 1 PPT T1
Definition of push
down Automata
19.02.25 The languages of
3.2 1 PPT T1
III PDA CO1
21.02.25 Equivalence of
3.3 1 PPT T1
PDA and CFG’s
22.02.25
3.4 1 Acceptance by PPT T1
final state
 24.02.25 Turing Machines:
3.5 1 Introduction to PPT T1
Turing Machine
25.02.25 Formal
3.6 1 PPT T1
Description
28.02.25 Instantaneous
3.7 1 PPT T1
description
01.03.25 The language of a
3.8 1 PPT T1
Turing Machine
3.9 03.03.25 1 PPT T1
Undecidability
04.03.25 A language that is
3.10 1 Not Recursively PPT T1
Enumerable
05.03.25 An undecidable
3.11 1 PPT T1
problem that is RE
07.03.25 Undecidable
3.12 1 Problems about PPT T1
Turing Machines

Assignment Test Unit 3

24.03.25 Introduction: The
4.1 1 structure of a PPT T1
compiler
25.03.25 Lexical Analysis
4.2 1 The role of Lexical PPT T1
analyzer
26.03.25 Input Buffering,
4.3 1 Recognition of PPT T1
Tokens
28.03.25 The Lexical
4.4 1 Analyzer PPT T1
generator Lex
29.03.25 Syntax Analysis:
IV 4.5 1 PPT CO2 T1
Introduction
31.03.25 Context- free
4.6 1 grammars, writing PPT T1
a grammar
01.04.25 Top-down parsing,
4.7 1 PPT T1
Bottom up Parsing
02.04.25
4.8 1 Introduction to LR PPT T1
Parsing:
04.04.25

4.9 1 Simple LR, More PPT T1

powerful LR
Parsers
 Assignment Test Unit 4
07.04.25 Syntax-Directed
Translation:
5.1 1 PPT T1
Syntax-Directed
Definitions
08.04.25 Evaluation orders
5.2 1 PPT T1
for SDD’s
09.04.25 Syntax-Directed
5.3 1 Translation PPT T1
schemes
11.04.25
5.4 1 Implementing PPT T1
L-Attributed SDD’s
15.04.25 Intermediate-
5.5 1 PPT T1
code generation
16.04.25 Variants of syntax
5.6 1 PPT T1
V Trees CO1
19.04.25 Three-Address
5.7 1 PPT T1
code
21.04.25 Run time
5.8 1 PPT T1
Environments
22.04.25 Stack Allocation of
5.9 1 PPT T1
space
23.04.25 Access to Non
5.10 1 local Data on the PPT T1
stack
24.04.25
5.11 1 Heap PPT T1
Management
Assignment Test Unit 5
 TEXT BOOKS:
1. Introduction to Automata Theory, Languages, and Computation, 3 nd Edition,
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
2. Theory of Computer Science – Automata languages and computation,

Mishra and Chandrashekaran, 2nd Edition, PHI.

REFERENCE BOOKS:
1. Compilers: Principles, Techniques and Tools, Alfred V. Aho, Monica S. Lam, Ravi
Sethi, Jeffry
D. Ullman, 2nd Edition, Pearson.
2. Introduction to Formal languages Automata Theory and Computation,
Kamala Krithivasan, Rama R, Pearson.
3. Introduction to Languages and The Theory of Computation, John C Martin, TMH.
4. lex & yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly Compiler Construction,
Kenneth
C. Louden, Thomson. Course Technology.