Automata and Compiler Design Syllabus for MCA 2nd Year 2nd Sem R19 Regulation JNTUH (Professional Elective-I)

Automata and Compiler Design detailed Syllabus for Master of Computer Applications (MCA), R19 regulation has been taken from the JNTUH official website and presented for the students affiliated to JNTUH course structure. For Course Code, Subject Names, Theory Lectures, Tutorial, Practical/Drawing, Credits, and other information do visit full semester subjects post given below. The Syllabus PDF files can also be downloaded from the universities official website.

For all the other MCA 2nd Year 2nd Sem Syllabus for R19 Regulation JNTUH, visit Master of Computer Applications 2nd Year 2nd Sem R19 Scheme.

For all the (Professional Elective-I) subjects refer to Professional Elective-I Scheme. The detail syllabus for automata and compiler design is as follows.

Course Objectives:

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

Course Outcomes:

1. Able to understand the concept of abstract machines and their power to recognize the languages.
2. Able to employ finite state machines for modeling and solving computing problems.
3. Able to design context free grammars for formal languages.
4. Demonstrate the ability to design a compiler given a set of language features.
5. Demonstrate the knowledge of patterns, tokens and regular expressions for lexical analysis.
6. Design and implement LL and LR parsers
7. Design algorithms to do code optimization in order to improve the performance of a program in terms of space and time complexity.
8. Design algorithms to generate machine code.

Unit I

Introduction to Finite Automata: Structural Representations, Automata and Complexity, the Central Concepts of Automata Theory – Alphabets, Strings, Languages, Problems. Nondeterministic Finite Automata: Formal Definition, an application, Text Search, Finite Automata with Epsilon-Transitions. Regular Expressions: Finite Automata and Regular Expressions, Applications of Regular Expressions, Algebraic Laws for Regular Expressions, Conversion of Finite Automata to Regular Expressions.

Unit II

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

Unit III

Turing Machines: Introduction to Turing Machine, Formal Description, Instantaneous description, The language of a Turing machine Introduction to compiler: The structure of a compiler, the science of building a compiler, programming language basics

Unit IV

Syntax Analysis: Introduction, Context-Free Grammars, Writing a Grammar, Top-Down Parsing, Bottom-Up Parsing, Introduction to LR Parsing: Simple LR, More Powerful LR Parsers, Using Ambiguous Grammars and Parser Generators.

Unit V

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

Text Books:

1. Introduction to Automata Theory, Languages, and Computation, John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, 3rd Edition, Pearson Education.
2. Compilers: Principles, Techniques and Tools, Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffry D. Ullman, 2nd Edition,

Reference Books:

1. Theory of Computer Science – Automata languages and computation, Mishra and Chandrashekaran, 2nd edition, PHI.
2. Introduction to Languages and The Theory of Computation, John C Martin, TMH.
3. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
4. A Text book on Automata Theory, P. K. Srimani, Nasir S. F. B, Cambridge University Press.
5. Introduction to the Theory of Computation, Michael Sipser, 3rd edition, Cengage Learning.
6. Introduction to Formal languages Automata Theory and Computation Kamala Krithivasan, Rama R, Pearson.

For detail Syllabus of all other subjects of 2nd Year 2nd Sem Master of Computer Applications, visit MCA 2nd Year 2nd Sem Syllabus Subjects.

For all MCA results, visit JNTUH MCA all years, and semester results from direct links.