View more random threads:
- CS301‐ Data Structures Assignment No. 1 Solution Semester...
- CS506 Web Design and Development Assignment no 3 Solution...
- mth202 Assignment NO:5 spring 2011 idea solution
- CS605 Software Engineering-II Assignment No.2 Solution Fall...
- CS402 Assignment No.4 Spring 2011
- cs606assignment no 2 spring 2011 MAY Solution
- CS402 Theory of Automata Assignment No.4 Fall 2012 Due Date...
- cs615 assignment no 2 idea solution
- CS501 Advanced Computer Architecture Assignment No.2...
- CS402 theory of Automata assignmment no 4 fall January 2012
CS606 Compiler Construction Assignment No.1 Solution Spring Semester 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:
Sponsored Links
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
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)
There are currently 1 users browsing this thread. (0 members and 1 guests)