Automata Theory and Compiler Design CSENET Syllabus for B.Tech 2nd Year 2nd Sem R22 Regulation JNTUH

Automata Theory and Compiler Design detailed syllabus for CSE (Networks) (CSENET), 2nd Year 2nd Sem R22 regulation has been taken from the JNTUH official website and presented for the B.Tech 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. We make sure the result links and syllabus uploaded here is latest and up to date, also the syllabus PDF files can also be downloaded from the universities official website.

For CSE (Networks) (CSENET) 2nd Year 2nd Sem R22 Regulation Scheme, do visit CSENET 2nd Year 2nd Sem R22 Scheme. The detailed syllabus for automata theory and compiler design is as follows.

Automata Theory and Compiler Design Subject Syllabus for CSENET 2nd Year 2nd Sem R22 Regulation

Prerequisite:

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 pdf platform to make students’s lives easier.
.

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 and regular expressions for lexical analysis.
Acquire skills in using lex tool and design LR parsers

UNIT – I

UNIT – II

Regular Expressions: Finite Automata and Regular Expressions, Applications of Regular Expressions, Algebraic Laws for Regular Expressions, Conversion of Finite Automata to Regular Expressions. Pumping Lemma for Regular Languages: Statement of the pumping lemma, Applications of the Pumping Lemma. Context – Free Grammars: Definition of Context – Free Grammars, Derivations Using a Grammar, Leftmost and Rightmost Derivations, the Language of a Grammar, Parse Trees, Ambiguity in Grammars and Languages.

UNIT – III

Push Down Automata: Definition of the Pushdown Automaton, the Languages of a PDA, Equivalence of PDA and CFG’s, Acceptance by final state Turing Machines: Introduction to Turing Machine, Formal Description, Instantaneous description, The language of a Turing machine Undecidability: Undecidability, A Language that is Not Recursively Enumerable, An Undecidable Problem That is RE, Undecidable Problems about Turing Machines

UNIT – IV

UNIT – V

Syntax – Directed Translation: Syntax – Directed Definitions, Evaluation Orders for SDD’s, Syntax – Directed Translation Schemes, Implementing L – Attributed SDD’s. Intermediate – Code Generation: Variants of Syntax Trees, Three – Address Code Run – Time Environments: Stack Allocation of Space, Access to Nonlocal Data on the Stack, Heap Management

TEXT BOOKS:

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

REFERENCE BOOKS:

For detailed syllabus of all the other subjects of B.Tech 2nd Year CSE (Networks) (CSENET), visit CSE (Networks) (CSENET) 2nd Year Syllabus Subjects.

For results of CSE (Networks) (CSENET) 2nd Year 2nd Sem R22 Regulation, visit CSENET 2nd Year 2nd Sem R22 Regulation results direct link.