Outline of Syllabus
B5.2-R4:-Automata Theory And Compiler Design
Topic
Duration (Hrs)
1
Review Of Mathematical Theory
05
2
Regular Languages And Finite Automata
06
3
Context Free Grammar (CFG) and PDA
10
4
Turing Machine (TM)
06
5
Basics of Compiler & Lexical Analysis
05
6
Syntax Analysis
10
7
Syntax-Directed Translation
06
8
Dynamic Memory Allocation & Memory Management
06
9
Code Optimization And Code Generation
06
Lecture =60
Practical =60
Total class =120
Practical =60
Total class =120
BOOKS RECOMMENDED FOR READING AND REFERENCE
MAIN READING
- John C. Martin "Introduction to Languages and Theory of Computation" TMH; Third Edition
- Alfred Aho, Ravi Sethi, Jeffrey D Ullman, "Compilers Principles, Techniques and Tools", Pearson Education Asia
SUPPLEMENTARY READING
- Adesh K. Pandey "An introduction to automata theory and formal languages", Publisher: S.K. Kataria & Sons.
- Deniel I. Cohen , Joh Wiley & Sons, Inc "Introduction to computer theory".
- Allen I. Holub "Compiler Design in C", Prentice Hall of India.
- J.P. Bennet, "Introduction to Compiler Techniques", Tata McGraw-Hill, Second Edition.