5th Sem, IT

IT5502: Compiler Engineering Syllabus for IT 5th Sem 2019 Regulation Anna University

Compiler Engineering detailed syllabus for Information Technology (IT) for 2019 regulation curriculum has been taken from the Anna Universities official website and presented for the IT students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.

For Information Technology 5th Sem scheme and its subjects, do visit IT 5th Sem 2019 regulation scheme. The detailed syllabus of compiler engineering is as follows.

Compiler Engineering

Course Objective:

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 pdfs platform to make students’s lives easier.
Get it on Google Play.

Unit I

Introduction To Automata Theory and Regular Expressions
Finite Automata – Deterministic Finite Automata – Non-deterministic Finite Automata – NFA to DFA – Finite Automata with Epsilon Transitions – Epsilon-NFA to DFA – Kleene”s Theorem – Minimization of Automata – Regular Expressions – Equivalence between Regular Expression and Automata – Properties of Regular Expressions.

Suggested Activities:

  • Flipped classroom on Finite Automata and Regular Expressions.
  • External learning – Automata, Basics of Finite Automata, NFA, DFA ,Finite state machines – Regular expressions.
  • Practical – Study of Lexical analysis tools and lexer generators.

Suggested Evaluation Methods:

  • Tutorials on minimization of automata.
  • Assignments on regular expressions.
  • Quizzes on automata.

Unit II

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 pdfs platform to make students’s lives easier.
Get it on Google Play.

Unit III

Syntax Analysis
Introduction – Context Free Grammar – Top Down Parsing – Recursive Descend Parsing -Predictive Parsing – Non-Recursive Predictive Parsing – Error Recovery – Bottom Up Parsing – LR Parsers – Construction of SLR (1) Parsing Table, Canonical LR (1) Parsing Table and LALR (1) Parsing Table – Parser Generators.

Suggested Activities:

  • Flipped classroom on languages, writing grammars for programming languages, transformations on grammars.
  • External learning – Parser generators.
  • Practical – Read and write grammars for programming language constructs, Perform top-down parsing, bottom-up parsing and use parser generators, Implementation of Parsers using YACC in Unix Environment.

Suggested Evaluation Methods:

  • Tutorials on context-free grammar.
  • Assignments on various parsers.
  • Quizzes on parsers.

Unit IV

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 pdfs platform to make students’s lives easier.
Get it on Google Play.

Unit V

Code Generation and Optimization
Issues – Design of Code Generator – Addresses in the Target Code – Basic Blocks in Flow Graph – Simple Code Generator – Peephole Optimization – Machine Independent Optimization – Principal Sources of Optimizations – Bootstrapping a Compiler – Compiling Compilers – Full Bootstrap.

Suggested Activities:

  • Flipped classroom on Target machine.
  • External learning – Code generation, Elementary optimizations. Basicblocks, Dataflow analysis.
  • Practical – Perform code generation.

Suggested Evaluation Methods:

  • Tutorials on code generation.
  • Assignment problems flow graph.
  • Quizzes on code optimization.

Course Outcome:

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 pdfs platform to make students’s lives easier.
Get it on Google Play.

Text Books:

  1. Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman, “Compilers: Principles, Techniques, and Tools”, Second Edition, Pearson Education, 2009.
  2. John Hopcroft, Rajeev Motwani, Jeffrey Ullman, “Introduction To Automata Theory Languages, and Computation”, Third Edition, Pearson Education, 2007.

References:

  1. Torbengidius Mogensen, “Basics of Compiler Design”, Springer, 2011.
  2. Charles N, Ron K Cytron, Richard J LeBlanc Jr., “Crafting a Complier”, Pearson Education, 2010.
  3. K. D. Cooper, L. Torczon, “Engineering a Compiler”, Morgan-Kaufmann, Second Edition, 2011.
  4. Micheal Sipser, “Introduction to the Theory of Computation”, Third Edition,2014.

For detailed syllabus of all other subjects of Information Technology, 2019 regulation curriculum do visit IT 5th Sem subject syllabuses for 2019 regulation.

For all Information Technology results, visit Anna University IT all semester results direct link.

Leave a Reply

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

*