Sponsored Links

CS606 Compiler Construction Assignment No.1 Solution Spring Semester 2013

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
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
Question No 1: Marks 20

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)