{"id":19265,"date":"2019-12-10T05:46:51","date_gmt":"2019-12-10T05:46:51","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/formal-languages-and-automata-theory-it-7th-sem-syllabus-for-be-2017-regulation-anna-univ-professional-elective-ii\/"},"modified":"2019-12-10T05:46:51","modified_gmt":"2019-12-10T05:46:51","slug":"formal-languages-and-automata-theory-it-7th-sem-syllabus-for-be-2017-regulation-anna-univ-professional-elective-ii","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/formal-languages-and-automata-theory-it-7th-sem-syllabus-for-be-2017-regulation-anna-univ-professional-elective-ii\/","title":{"rendered":"Formal Languages and Automata Theory It 7th Sem Syllabus for BE 2017 Regulation Anna Univ (Professional Elective II)"},"content":{"rendered":"<p>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 <a href=\"https:\/\/www.annauniv.edu\/\" target=\"_blank\" rel=\"noopener\">Anna Univ<\/a> 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.<\/p>\n<p>For all other it 7th sem syllabus for be 2017 regulation anna univ you can visit <a href=\"..\/it-7th-sem-syllabus-for-be-2017-regulation-anna-univ\">It 7th Sem syllabus for BE 2017 regulation Anna Univ Subjects<\/a>. For all other Professional Elective II subjects do refer to <a href=\"..\/professional-elective-ii-it-7th-sem-syllabus-for-be-2017-regulation-anna-univ\">Professional Elective II<\/a>. The detail syllabus for formal languages and automata theory is as follows.<\/p>\n<p><h4>Course Objective:<\/h4>\n<ul>\n<li>To understand a finite automata for a given language.<\/li>\n<li>To understand the relation between grammar and language<\/li>\n<li>To understand the basic principles of working of a compiler<\/li>\n<li>To study about the type checking procedure during the compilation<\/li>\n<li>To understand the storage structure of the running program<\/li>\n<\/ul>\n<p><h4>Unit I<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<p><h4>Unit II<\/h4>\n<p><strong> Context Free Grammars and Languages<\/strong><br \/>\nContext-Free Grammar (CFG) &#8211; Parse Trees &#8211; Ambiguity in grammars and languages -Definition of the Pushdown automata &#8211; Languages of a Pushdown Automata -Equivalence of Pushdown automata and CFG- Deterministic Pushdown Automata- Normal forms for CFG &#8211;\tPumping Lemma\tfor CFL\t&#8211; Closure Properties of CFL &#8211; Turing<br \/>\nMachines &#8211; Programming Techniques for TM.\n<\/p>\n<p><h4>Unit III<\/h4>\n<p><strong> Basics of Compilation<\/strong><br \/>\nCompilers &#8211; Analysis of source program &#8211; Phases of a compiler &#8211; Grouping of phases &#8211; Compiler construction tools &#8211; Lexical Analyzer : Token Specification &#8211; Token Recognition &#8211; A language for Specifying lexical analyzer &#8211; Top down parser : Table implementation of Predictive Parser &#8211; Bottom up Parser : SLR(1) Parser &#8211; Parser generators.\n<\/p>\n<p><h4>Unit IV<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<p><h4>Unit V<\/h4>\n<p><strong> Code Generation and Optimization<\/strong><br \/>\nIssues in the design of a code generator &#8211; The target machine &#8211; Run-time storage management -Basic blocks and flow graphs &#8211; Next-use information &#8211; A simple code generator &#8211; Register allocation and assignment &#8211; The dag representation of basic blocks &#8211; Generating code from DAG &#8211; Dynamic programming code generation algorithm &#8211; Code generator generators &#8211; Code optimization.\n<\/p>\n<p><h4>Course Outcome:<\/h4>\n<p>Upon completion of the course, the students should be able to :<\/p>\n<ul>\n<li>Design a finite automaton for a specific language.<\/li>\n<li>Design a Turing machine.<\/li>\n<li>Select appropriate grammar for the implementation of compiler phases<\/li>\n<li>Design a lexical analyzer<\/li>\n<li>Design a simple parser<\/li>\n<li>Design and implement techniques used for optimization by a compiler.<\/li>\n<li>Write a very simple code generator<\/li>\n<\/ul>\n<p><h4>Text Books:<\/h4>\n<ol>\n<li>J.E. Hopcroft, R. Motwani and J.D. Ullman, Introduction to Automata Theory, Languages and Computations, Second Edition, Pearson Education, 2007.<\/li>\n<li>Alfred V. Aho, Monica S.Lam, Ravi Sethi, Jeffrey D.Ullman, Compilers Principles, Techniques and Tools, Second Edition, Pearson Education,2008.<\/li>\n<\/ol>\n<p><h4>References:<\/h4>\n<ol>\n<li>J.Martin, Introduction to Languages and the Theory of computation Third Edition, Tata Mc Graw Hill, 2007<\/li>\n<li>Randy Allen, Ken Kennedy, Optimizing Compilers for Modern Architectures: A Dependencebased Approach, Morgan Kaufmann Publishers, 2002.<\/li>\n<li>Steven S. Muchnick, Advanced Compiler Design and Implementation, Morgan Kaufmann Publishers &#8211; Elsevier Science, India, Indian Reprint 2003.<\/li>\n<li>Muneeswaran. K, Compiler Design, Oxford University Press, 2012<\/li>\n<\/li>\n<\/ol>\n<p>For detail syllabus of all other subjects of BE It, 2017 regulation do visit <a href=\"..\/category\/it+7th-sem\">It 7th Sem syllabus for 2017 Regulation<\/a>.<\/p>\n<p>Dont forget to <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a> for latest syllabus and results, class timetable and more.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>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 [&hellip;]<\/p>\n","protected":false},"author":2297,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[50,72],"tags":[],"class_list":["post-19265","post","type-post","status-publish","format-standard","hentry","category-7th-sem","category-it"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/19265","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/users\/2297"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/comments?post=19265"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/19265\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=19265"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=19265"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=19265"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}