cs606 compiler construction assignment # 2

[sny2ksa]

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 ;

[+ M.Tariq Malik]

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

[sny2ksa]

[sny2ksa]

can any one confirm that the answer for question # 2  will be from LECTURE 12//?

GIVEN THERE TWO PARSE TREES?

[Aamir Mughal]

yup, that is the same example. :)

[sny2ksa]

what about 1st question?

can we write all terminal in one line and their FIRST in one go..?

[sny2ksa]

is there any idea about this assignment.?

[Zeeshan Naseer]

plz share the solution of this assignment or the idea of this assignment.

[05cha530rul7d]

is there any helping material ?? or idea ??

[M saqib khan]

help for first question..

[Noor fatima]

plz koi to assigm,enk ka soltion day aj extended date ha

[Shamoon]

plz any one have idea how to solve or give some idea or reference...

to solve it/....

[Noor fatima]

Tariq Malik plz upload the Solution today is extended day