PDA

View Full Version : CS402:Thoery of Automata Assignment 6 Deadline 28 July 2010



viki
07-24-2010, 11:15 PM
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 (c).

imonly_ik
07-29-2010, 10:33 PM
brother is ka solution b hai kya?

imonly_ik
07-29-2010, 10:33 PM
agar hai to wo b upload kar do pleeeeeeeeeeeeeeeeeeeeeeeeeeeeeas

imonly_ik
07-29-2010, 10:34 PM
agar hai to wo b upload kar do pleeeeeeeeeeeeeeeeeeeeeeeeeeeeease