Compiler Construction (CS606)
Assignment # 01
Total marks = 20
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:
You should consult the recommended books to clarify your concepts as handouts are not sufficient.
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.
· The objective of this assignment is to provide hands on experience of:
· To learn and understand the basic concept of an Operating System
· To learn Directory Structure of Operating System
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. = a ( ab | ba )* a
Questions No 02 10 marks
Use Subset Construction algorithm to find DFA for the NFA constructed in Task 1.
i solved this assignment
kindly send me brother I need it
solution send kar do koi
Plz share the solution.
There is just one mistake in this ANSWER.
Bottom CURVE line should be start from "1" & end to "12"
Rest all answer is correct. @sameer ahmed
Sarmad bhai, ap ka solution bilkul correct hai likan more refined than shown in handouts :)
bhai ma nay handouts ko he follow krty hovy bnaya hai