Discussion is right way to get Solution of the every assignment, Quiz and GDB.
We are always here to discuss and Guideline, Please Don’t visit Cyberian only for Solution.
Cyberian Team always happy to facilitate to provide the idea solution. Please don’t hesitate to contact us!
NOTE: Don’t copy or replicating idea solutions.
SOLVED CS606 Assignment 1 Solution and Discussion
CS606 – Compiler Construction
Assignment # 01
Total marks = 20
14th Nov 2019
Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.
You should consult the recommended books to clarify your concepts as handouts are not enough.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.
Objective of this assignment is to increase the learning capabilities of the students about
• Deterministic Finite Automaton (DFA)
• Nondeterministic Finite Automaton (NFA)
• Thompson’s Construction Algorithm
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
Questions No 01 10 marks
For regular expression below, construct an NFA using Thompson’s construction.
R.E. = ((v + x)*y) + z
Questions No 02 10 marks
Use Subset Construction algorithm to find DFA for the NFA constructed in Task 1.