Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

discuss here.

Assignment No. 02
Semester Fall 2012
Compiler Construction CS606
Total Marks: 20
Due Date: 04-12-2012

Question No 1: Marks 10
Considering the following grammar, find the first sets for each non-terminal of the grammar.
S →aS | Ab
A →XYZ | ε
X →cX | ε
Y →dS | ε
Z →eS | ε

Question No 2: Marks 10
Prove that the following grammar is ambiguous because the sentence if ( id == id) then if ( id == id)
then id := id ; else id := id ;can be derived using two different parse trees.
S →id := id ;
S →if (E) then S
S →if (E) then S else S
E →id == id ;

Views: 1642

Replies to This Discussion

Epsilon nai aata ... jo file me ne upload ki ha us me sara method dia hua ha me ne wahen se kia ha plz check file on 1st page

IN UR FILE..there is no epsilon,so is not in production.bu tin our case there is epsilon in our grammar.so i think there will be epsilon .

in file they use lemda insted of epsilon.. epsilon mean nothing 

any ways may be i am wrong but i tried its up to u that u accept it or not

in step 1, all terminals added .. next in step 2 non terminals one by one expended, i dont know how to explain but if u consult file u understand.

u did a greattt job .at least tried well..

please some upload idea solution of q no 2 please ....

Sir G, Ye kin gunahoon ke saza mil rae hai?

yar plz word file share kar do koe...nh samjh aa rhe..plz..bht kaam tym rah gya ha,..

Hi dears all plz shsre only iea plz

Submitted...

RSS

© 2022   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service