Formal Languages and Automata Theory It 7th Sem Syllabus for BE 2017 Regulation Anna Univ (Professional Elective II) detail syllabus for Information Technology (It), 2017 regulation is collected from the Anna Univ official website and presented for students of Anna University. The details of the course are: course code (IT8003), Category (PE), Contact Periods/week (3), Teaching hours/week (3), Practical Hours/week (0). The total course credits are given in combined syllabus.
For all other it 7th sem syllabus for be 2017 regulation anna univ you can visit It 7th Sem syllabus for BE 2017 regulation Anna Univ Subjects. For all other Professional Elective II subjects do refer to Professional Elective II. The detail syllabus for formal languages and automata theory is as follows.
Course Objective:
- To understand a finite automata for a given language.
- To understand the relation between grammar and language
- To understand the basic principles of working of a compiler
- To study about the type checking procedure during the compilation
- To understand the storage structure of the running program
Unit I
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit II
Context Free Grammars and Languages
Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages -Definition of the Pushdown automata – Languages of a Pushdown Automata -Equivalence of Pushdown automata and CFG- Deterministic Pushdown Automata- Normal forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing
Machines – Programming Techniques for TM.
Unit III
Basics of Compilation
Compilers – Analysis of source program – Phases of a compiler – Grouping of phases – Compiler construction tools – Lexical Analyzer : Token Specification – Token Recognition – A language for Specifying lexical analyzer – Top down parser : Table implementation of Predictive Parser – Bottom up Parser : SLR(1) Parser – Parser generators.
Unit IV
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit V
Code Generation and Optimization
Issues in the design of a code generator – The target machine – Run-time storage management -Basic blocks and flow graphs – Next-use information – A simple code generator – Register allocation and assignment – The dag representation of basic blocks – Generating code from DAG – Dynamic programming code generation algorithm – Code generator generators – Code optimization.
Course Outcome:
Upon completion of the course, the students should be able to :
- Design a finite automaton for a specific language.
- Design a Turing machine.
- Select appropriate grammar for the implementation of compiler phases
- Design a lexical analyzer
- Design a simple parser
- Design and implement techniques used for optimization by a compiler.
- Write a very simple code generator
Text Books:
- J.E. Hopcroft, R. Motwani and J.D. Ullman, Introduction to Automata Theory, Languages and Computations, Second Edition, Pearson Education, 2007.
- Alfred V. Aho, Monica S.Lam, Ravi Sethi, Jeffrey D.Ullman, Compilers Principles, Techniques and Tools, Second Edition, Pearson Education,2008.
References:
- J.Martin, Introduction to Languages and the Theory of computation Third Edition, Tata Mc Graw Hill, 2007
- Randy Allen, Ken Kennedy, Optimizing Compilers for Modern Architectures: A Dependencebased Approach, Morgan Kaufmann Publishers, 2002.
- Steven S. Muchnick, Advanced Compiler Design and Implementation, Morgan Kaufmann Publishers – Elsevier Science, India, Indian Reprint 2003.
- Muneeswaran. K, Compiler Design, Oxford University Press, 2012
For detail syllabus of all other subjects of BE It, 2017 regulation do visit It 7th Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.