CS606 Assignment no 01 Spring 2013 Solution Required

Assignment No. 01
Semester Spring 2013
Compiler Construction CS606

Total Marks: 20

Due Date: 30/04/2013

Objective:

To learn and understand basic concepts of Context free grammar, regular expression, deterministic and nondeterministic finite automata in building a Lexical analyzer.

Lectures Covered: 1-8                                                               


Instructions:

Please read the following instructions carefully before submitting assignment:

• You will submit your assignment before or on due date on VU-LMS.
• Assignment should be completed by your own efforts it should not be copied from internet, handouts or books.
• You should submit your solution in Word File only via assignment interface at VU-LMS.
• Assignment sent via Email will not be replied and accepted/graded in any case.
• If the submitted assignment does not open or file is corrupt, it will not be graded.

For any query about the assignment, contact at cs606@vu.edu.pk

BEST OF LUCK

 Given the regular expression

a) Construct an equivalent NFA using the Thompson’s Constructions algorithm. (10 marks)

b) Convert the NFA (constructed in part a) to a DFA. (10 marks)