‭̀‬

‭AUTOMATA THEORY AND COMPILER DESIGN‬

‭Course Code:‬‭22CM1108‬ ‭ T‬ ‭P C‬
L
‭3 0 0 3‬
‭Prerequisites: NIL‬
‭Course Outcomes:‬‭At the end of the Course the student‬‭shall be able to‬
‭CO1: Explain finite state machines for modeling and their power to recognize the‬
‭languages.(L2) CO2: Summarize the concept of Regular languages and context free‬
‭languages(L2)‬
‭CO3: Construct PDA and Turing machines for the given set of languages (L3)‬
‭CO4:‬‭Build the lexical and Syntax analyzer phases‬‭of compiler (L3)‬
‭CO5:‬‭Model SDD’s using Intermediate Representations‬‭(L3)‬

‭ NIT-I‬
U ‭(12 Lectures)‬
‭Fundamentals‬‭:‬ ‭Formal‬ ‭Languages,‬ ‭Strings,‬ ‭Alphabets,‬ ‭Languages,‬ ‭Chomsky‬ ‭Hierarchy‬ ‭of‬
‭languages.‬
‭Finite‬ ‭Automata:‬ ‭Introduction‬ ‭to‬ ‭Finite‬ ‭State‬ ‭machine,‬ ‭Acceptance‬‭of‬‭strings‬‭and‬‭languages,‬
‭Deterministic‬ ‭finite‬ ‭automaton‬ ‭(DFA)‬ ‭and‬ ‭Non-deterministic‬ ‭finite‬ ‭automaton‬ ‭(NFA),‬
‭Equivalence‬ ‭of‬ ‭NFA‬ ‭and‬ ‭DFA‬ ‭–‬ ‭Equivalence‬ ‭of‬ ‭NDFAs‬ ‭with‬ ‭and‬ ‭without‬ ‭€-moves,‬
‭Minimization‬‭of‬‭finite‬‭automata,‬‭Equivalence‬‭between‬‭two‬‭DFA’s,‬‭Finite‬‭automata‬‭with‬‭output‬
‭– Moore and Mealy machines, conversion of Moore to Mealy and Mealy to Moore‬
‭Learning Outcomes:‬‭At the end of the module the student‬‭will be able to‬
‭1. describe about Finite Automata Model (L2)‬
‭2. translate NFA to DFA and vice versa (L2)‬
‭3. translate NFA with €-moves to NFA and DFA (L2)‬
‭4. translate Mealy to Moore and Vice-versa (L2)‬

‭ NIT-II‬
U ‭(12 Lectures )‬
‭Regular‬ ‭Languages:‬ ‭Regular‬ ‭expressions,‬ ‭Identity‬ ‭rules,‬ ‭Conversion‬ ‭of‬ ‭a‬ ‭given‬ ‭regular‬
‭expression‬ ‭into‬ ‭a‬ ‭finite‬ ‭automaton,‬ ‭Conversion‬ ‭of‬ ‭finite‬ ‭automata‬ ‭into‬ ‭a‬ ‭regular‬ ‭expression,‬
‭Pumping lemma for regular sets, Closure properties of regular sets (proofs not required).‬
‭Context‬‭Free‬‭Grammars‬‭:‬‭Context‬‭free‬‭grammars‬‭and‬‭languages,‬‭Derivation‬‭trees,‬‭Leftmost‬‭and‬
‭rightmost‬‭derivation‬‭of‬‭strings‬‭and‬‭Sentential‬‭forms,‬‭Ambiguity,‬‭left‬‭recursion‬‭and‬‭left‬‭factoring‬
‭in‬‭context‬‭free‬‭grammars,‬‭Minimization‬‭of‬‭context‬‭free‬‭grammars,‬‭Normal‬‭forms‬‭for‬‭context‬‭free‬
‭grammars,‬ ‭Chomsky‬ ‭normal‬ ‭form,‬ ‭Greibach‬ ‭normal‬ ‭form,‬ ‭Pumping‬ ‭Lemma‬ ‭for‬ ‭Context‬ ‭free‬
‭Languages, Closure and decision properties of context free languages.‬
‭̀‬

‭Learning Outcomes:‬‭At the end of the module the student will be able to‬
‭1. explain about Regular Sets and Regular Expressions (L2)‬
‭2. relate Closure Properties of Regular sets (L2)‬
‭3. explain Ambiguity of Context Free Grammar (L2)‬

‭ NIT-III‬
U ‭(10 Lectures)‬
‭Pushdown‬ ‭Automata:‬ ‭Introduction‬ ‭to‬ ‭Pushdown‬ ‭automata,‬ ‭Acceptance‬ ‭of‬ ‭context‬ ‭free‬
‭languages,‬ ‭Acceptance‬ ‭by‬ ‭final‬ ‭state‬ ‭and‬ ‭acceptance‬ ‭by‬ ‭empty‬ ‭state‬ ‭and‬ ‭its‬ ‭equivalence,‬
‭Equivalence‬ ‭of‬ ‭context‬ ‭free‬ ‭grammars‬ ‭and‬ ‭pushdown‬ ‭automata,‬ ‭Inter-conversion‬ ‭(Proofs‬ ‭not‬
‭required).‬
‭Turing‬‭Machine:‬‭Introduction‬‭to‬‭Turing‬‭Machine,‬‭Design‬‭of‬‭Turing‬‭machines,‬‭Types‬‭of‬‭Turing‬
‭machines.‬

‭Learning Outcomes:‬‭At the end of the module the student‬‭will be able to‬
‭1. construct a PushDown Automata for a Language (L3)‬
‭2. translate PDA to Context Free Grammar and vice versa (L2)‬
‭3. construct a Turing Machine for a Language (L3)‬
‭4. classify Different Types of Turing machines (L2)‬

‭ NIT-IV‬
U ‭(10 Lectures)‬
‭Introduction To Compiling‬‭: Overview of Compilers,‬‭Phases of a Compiler.‬
‭Lexical Analysis:‬‭The Role of Lexical Analyzer, Input‬‭Buffering, Specification of Tokens, Recognition‬
‭ f Tokens, A language for specifying Lexical Analyzers(LEX).‬
o
‭Syntax Analysis:‬‭The role of the Parser, First and‬‭Follow, Predictive Parsing, LR Parsers-SLR, Canonical‬
‭LR, LALR, Parser Generator(YACC).‬

‭Learning Outcomes:‬‭At the end of the module the student‬‭will be able to‬
‭ . explain the phases of a compiler. (L2)‬
1
‭2. identify the tokens and lexemes in a given input. (L3)‬
‭3. construct a Predictive Parsing table for the given grammar. (L3)‬
‭4. build various LR Parsing tables for a given grammar. (L3)‬

‭UNIT-V‬ ‭(6‬ ‭Lectures)‬

‭ yntax-Directed‬ ‭Translation‬‭:‬ ‭Syntax-Directed‬ ‭Definition,‬ ‭S-Attributed‬ ‭SDD,‬ ‭L-Attributed‬ ‭SDD,‬
S
‭Translation Schemes.‬
‭Intermediate‬ ‭Code‬ ‭Generation:‬ ‭Intermediate‬ ‭Languages-‬ ‭Graphical‬ ‭Representations,‬ ‭Three‬ ‭address‬
‭code, Implementations.‬
‭Learning Outcomes:‬‭At the end of the module the student‬‭will be able to‬
‭ .compare S-Attributed SDD and L-Attributed SDD. (L2)‬
1
‭2. explain graphical representations in intermediate code generation. (L2)‬
‭3. develop various representations for three address codes.(L3)‬
‭̀‬

‭TEXT BOOKS:‬
‭1.‬ ‭John E Hopcroft, Rajeev Motwani, Jeffrey D.Ullman, “‬‭Introduction to Automata Theory‬
‭Languages and Computation‬‭”, 3rd Edition, Pearson Education, 2011.‬
‭2.‬ ‭Alfred Aho,Monica S Lam, RaviSethi, JeffreyD.Ullman, “‬‭Compilers- Principles‬
‭Techniques and Tool”,‬‭2‭n‬ d‬‭Edition, Pearson Education‬‭India, 2013.‬

‭REFERENCE BOOKS:‬
‭1.‬ ‭Peter Linz, “‬‭An introduction to Formal Languages‬‭and Automata‬‭”, 6th Edition, Jones‬
‭& Bartlett, 2016‬
‭2.‬ ‭V.Raghavan, “‬‭Principles of Compiler Design”‬‭,1‬‭st‬‭Edition,McGrawHillEducation,2017.‬
‭3.‬ ‭Mishra and Chandrashekaran, “‬‭Theory of Computer Science‬‭– Automata Languages and‬
‭Computation‬‭”, 3rd Edition, PHI, 2009‬
‭4.‬ ‭K.V.N.Sunitha , N.Kalyani, “‬‭Formal Languages and Automata‬‭Theory‬‭”, 1st Edition,‬
‭TMH, 2010‬
‭5.‬ ‭Michel Sipser, “‬‭Introduction to Theory of Computation‬‭”,‬‭2nd Edition, Thomson, 2012‬

‭WEB REFERENCES:‬
‭1.‬ ‭Web Reference: https://swayam.gov.in/nd1_noc19_cs79/preview‬