Automata Theory and Compiler Design 21CS51

Automata Theory and Compiler Design 21CS51

Automata Theory and Compiler Design 21CS51

Course Code: 21CS51

Credits: 03

CIE Marks: 50

SEE Marks: 50

Total Marks: 100

Exam Hours: 03

Total Hours of Pedagogy: 40T

Teaching Hours/Weeks: [L:T:P:S] 3:0:0:0

Introduction to Automata Theory: Central Concepts of Automata theory, Deterministic Finite Automata(DFA), Non- Deterministic Finite Automata(NFA) ,Epsilon- NFA, NFA to DFA Conversion, Minimization of DFA.

Introduction to Compiler Design: Language Processors, Phases of Compilers.

Regular Expressions and Languages: Regular Expressions, Finite Automata and Regular Expressions, Proving Languages Not to Be Regular.

Lexical Analysis Phase of compiler Design: Role of Lexical Analyzer, Input Buffering , Specification of Token, Recognition of Token.

Context Free Grammars: Definition and designing CFGs, Derivations Using a Grammar, Parse Trees, Ambiguity and Elimination of Ambiguity, Elimination of Left Recursion, Left Factoring.

Syntax Analysis Phase of Compilers: part-1: Role of Parser , Top-Down Parsing.

Push Down Automata: Definition of the Pushdown Automata, The Languages of a PDA.

Syntax Analysis Phase of Compilers: Part-2: Bottom-up Parsing, Introduction to LR Parsing: SLR, More Powerful LR parsers.

Introduction to Turing Machine: Problems that Computers Cannot Solve, The Turing machine, problems, Programming Techniques for Turing Machine, Extensions to the Basic Turing Machine.

Undecidability: A language That Is Not Recursively Enumerable, An Undecidable Problem That Is RE.

Other Phases of Compilers: Syntax Directed Translation- Syntax-Directed Definitions, Evaluation Orders for SDD’s.Intermediate-Code Generation- Variants of Syntax Trees, Three-Address Code.

Code Generation: Issues in the Design of a Code Generator

Document

2021 SCHEME QUESTION PAPER

Important Question 1

Important Question 2

Regular Paper

Document

2018 SCHEME QUESTION PAPER

Model Set 1 Paper

Previous Year Paper 1

Previous Year Paper 2

Previous Year Paper 2 Solution

Previous Year merged Paper

Previous Year merged Paper Solution

14 thoughts on “Automata Theory and Compiler Design 21CS51

  1. A lot of thanks for your own effort on this web site. Ellie loves doing investigation and it’s really easy to understand why. We all know all about the lively way you give insightful strategies via your web site and even foster response from visitors about this theme plus our own princess is now understanding a whole lot. Have fun with the remaining portion of the new year. You are conducting a powerful job.

Leave a Reply

Your email address will not be published. Required fields are marked *