We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.


+ Link For Assignments, GDBs & Online Quizzes Solution


+ Link For Past Papers, Solved MCQs, Short Notes & More

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).


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)

Views: 626


Replies to This Discussion

plzzzzzzzzzzzzzzzzzzzzzzzzzzzzz explain part 3,4 agar solved form may mil gay to zayada better hy
Please explain part no2, 3, 4.
bhai plz upload the complete solutin of 6th assignment of cs 402 theory of automata
is the tree crrect?
no its tree will be infinite
Given CFG has a tree that is infinate due to aXY.... it returns again same value....
complete solution up load karen
complete solution upload kar bhi deya jay to keya faidah , mark to wasay zero hey mill tay hein.
oooooooooooo yaroooooooooo jaldi karo last date hay and last hour plzzzzzzzz i m watiing
bhai plz jaldi krain plz
yar ab solution send bhe ker do kun tarsa rahey ho>>>>>>>
CS402 assignment o6........ Given CFG is non-regular grammer it is not possible to find TLT, CNF and PDA....................... wrong question


Looking For Something? Search Here

Today Top Members 


This is a member-supported website. Your contribution is greatly appreciated!

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

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