CS402:Thoery of Automata Assignment 6 Deadline 28 July 2010

[viki]

Question: Mark:5+5+5+5

Consider the following Context Free Grammar (CFG)

S → aY | Ybb | Y
X → Λ | a
Y → aXY | bb | XXa

a) Is the CFG ambiguous, if Yes then justify your answer.
b) Draw a Total Language Tree (TLT) for the given CFG.
c) Convert the CFG into CNF.
d) Build the PDA corresponding to the CFG (in CNF) of part ©.

[imonly_ik]

brother is ka solution b hai kya?

[imonly_ik]

agar hai to wo b upload kar do pleeeeeeeeeeeeeeeeeeeeeeeeeeeeeas

[imonly_ik]

agar hai to wo b upload kar do pleeeeeeeeeeeeeeeeeeeeeeeeeeeeease