Lecture plan: No. of Lecture date S.No Topic lectures 1 Overview of Compilation 1 26-12-2011 Phases of Compilation 28-12-2011 – 2 1 Lexical Analysis Regular Grammar and regular 29-12-2011 3 expression for common 1 programming language features 4 pass and Phases of translation 1 31-12-2011 5 interpretation, 1 02-01-2012 6 bootstrapping 1 02-01-2012 7 data structures in compilation 1 04-01-2012 LEX lexical analyzer generator. 1 05-01-2012 8 Revision of previous topics 07-01-2012 1 9 Important Questions : 1. Design a DFA that accepts the language over the alphabet, _ = {0, 1, 2} Where the decimal equivalent of the language is divisible by 3. [Sup.Feb 2008, Set1] 2. Compare compiler and an interpreter with the help of suitable examples. [Sup.Feb 2008, Set1] 3. Obtain the Kleen Closure and Positive Closure of the language {ba, bb}, Where the alphabet _ = {a, b}. [Sup.Feb 2008, Set2] 4. Give a finite state diagram that accepts all the floating-point numbers. [Sup.Feb 2008, Set2] 5. Explain Regular Expressions with suitable examples. [Sup.Feb 2008, Set3]
Lecture plan: S.No Topic No. of lectures Lecture date 1 Overview of Compilation 1 26-12-2011 2 Phases of Compilation – Lexical Analysis 1 28-12-2011 3 Regular Grammar and regular expression for common programming language features 1 29-12-2011 4 pass and Phases of translation 1 31-12-2011 5 interpretation, 1 02-01-2012 6 bootstrapping 1 02-01-2012 7 data structures in compilation 1 04-01-2012 8 LEX lexical analyzer generator. 1 05-01-2012 Revision of previous topics 1 07-01-2012 9 Important Questions : 1. Design a DFA that accepts the language over the alphabet, _ = {0, 1, 2} Where the decimal equivalent of the language is divisible by 3. [Sup.Feb 2008, Set1] 2. Compare compiler and an interpreter with the help of suitable examples. [Sup.Feb 2008, Set1] 3. Obtain the Kleen Closure and Positive Closure of the language {ba, bb}, Where the alphabet _ = {a, b}. [Sup.Feb 2008, Set2] 4. Give a finite state diagram that accepts all the floating-point numbers. [Sup.Feb 2008, Set2] 5. Explain Regular Expressions with suitable examples. [Sup.Feb 2008, Set3]
Compiler-Design.docx