CS402 Theory of Automata Assignment No.5 Solution Fall Semester 2013

[Vuhelper]

CS402 Theory of Automata Assignment No.5 Solution Fall Semester 2013



Theory of Automata (CS402)
Assignment # 5

Total marks = 20
Deadline Date = January 28, 2013

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. Students will be punished severely in either case.


1) You should concern recommended books to clarify your concepts as handouts are not sufficient.
2) You are supposed to submit your assignment in .doc format. Any other formats like scan images, PDF, zip, rar, bmp etc will not be accepted.
3) You are advised to upload your assignment at least two days before the due date.
4) The assignment file comprises of two pages.


Note:

Assignment comprises of lectures No. 31-35.

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 deadline.

For any query, feel free to email at:
cs402@vu.edu.pk

Q 1: Marks [5+8]
S XYZ
X aX | bX | ^
Y aY | bY | ^
Z aZ | ^


a. Remove all NULL productions from the given grammar.

b. Remove all UNIT productions from the grammar obtained in part (a).




Q 2:
S mno | mA | nB | oC
A mX | ^
B nY | ^
C oZ | ^
X mn | m
Y no | n
Z om | o

Draw the total language tree for above CFG. Marks [7]

Best of luck!