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).
Please Discuss Here about this Assignmnet. Thanks
+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)