We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

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


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

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

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 570

.

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

Attachments:

Replies to This Discussion

if any one have GDB solution then plx share i want some idea plx..
yes an FA recognizes all the languages accepted by a PDA Actually PDA is a new form to express a language like as FA. The new machines which are to be defined are more powerful and can be constructed with the help of FAs with new format. Languages accepted by FA or NFA or TG also accepted by deterministic PDA.
no FA doesnot recognize all the languages accepted by PDA. FA has low memory problem. so it does not accept the language which require large memory.PDA has stack so it has no memory problem
NO, an Fa does not recognize all the languages accepted by PDA. A PDA can make use of a stack to remember how many times a symbol has appeared in a given word.That means the language a^nb^n can be accepted by a PDA, but a FA has no way of keeping track of how many times a symbol has occured, so it can't accept a language a^nb^n.
plz yar send assignment solution.................
Question No 1:
Write CFG for the language given by the following Regular Expression
(ab+ba)(aa+b)*(aaa+bba)
Solution;
S-àabA│ baA
AàaaA│ bA │aB│ bB
BàaC│ bC
CàaD
D→∆
bhai plz upload the solution of 6th assignment of cs 402 plz
bhai plz give the solution of GDB of automata thanx today is last date
assigment solution tips required..........................share plz
first ka answer mjy lgta ha yes it is ambiguous coz one string can be formed from different formats. 2nd ques me tree ki diagram buht complicated hoti ha ne bun rai
1) this CFG Is not ambiguous because any string in not shown two derivation tree.
2) second is its total language tree may be arbitrary wide as well as infinity long.
3) CFG Into CNF removing null and unit production
s-> Ay| yBB | b
x-> a | a
y-> Axy | Ax |BB | xxa| xx | xA | a
A->a
B->b

If there is else solution kindly, discuss it.
This is wrong.I was not able to convert it into CNF, but I am very close to do it so!
S->aY|Ybb|Y
X->^|a
Y->aXY|bb|XXa
null production
Y->aY|bb|Xa|a
after removing null production
S->aY|Ybb|Y
X->a
Y->aY|bb|Xa|a
Unit production
S->Y
S->Y->aY gives S->abb (Y->bb)
S->Y->aY gives S->aa (Y->a)
S->Y->aY->aXa gives S->aaa (X->a)
New CFG will be
S->aY|Ybb|abb|aa|aaa
X->a
Y->aY|bb|Xa|a
(i am stuck here)

RSS

Latest Activity

Aliya replied to + M.Tariq Malik's discussion CS504 Current Mid Term Papers Fall 2019 (14 to 26 December 2019) & All Solved Past Papers, Solved MCQs & Helping Material in the group CS504 Software Engineering - I
3 minutes ago
Aliya joined + M.Tariq Malik's group
3 minutes ago
+ ! ! ! ! ! NoOr E KaYeNaT updated their profile
6 minutes ago
Nayab replied to + M.Tariq Malik's discussion My First Day Earning On Hapo App ! You Can also Earn
13 minutes ago
+ " J ɨ y α •" ⋆ replied to + " J ɨ y α •" ⋆'s discussion Let's celebrate the Birthday of our Beloved Mod + "αяsαℓ " Ќąƶµяɨ •"
14 minutes ago
+ "αяsαℓ " Ќąƶµяɨ •" replied to + " J ɨ y α •" ⋆'s discussion Let's celebrate the Birthday of our Beloved Mod + "αяsαℓ " Ќąƶµяɨ •"
23 minutes ago
+ "αяsαℓ " Ќąƶµяɨ •" replied to + " J ɨ y α •" ⋆'s discussion Let's celebrate the Birthday of our Beloved Mod + "αяsαℓ " Ќąƶµяɨ •"
24 minutes ago
Kanwal posted a photo
25 minutes ago
+ ! ❤SΕNSΙТΙVΕ(∂ΕSΕЯТ ΡЯΙNCΕSS)❤ replied to ملالٖ یار's discussion Who can save u ?
28 minutes ago
+ ! ❤SΕNSΙТΙVΕ(∂ΕSΕЯТ ΡЯΙNCΕSS)❤ liked ملالٖ یار's discussion Who can save u ?
28 minutes ago
Nishat liked + ℱȺℋ££M ᏕȺQǐβ's discussion ╰☆╮Mid Term Papers Solving Techniques During Paper Do These Steps╰☆╮
40 minutes ago
haniya liked + M.Tariq Malik's discussion MTH401 All Current Mid Term Papers Fall 2019 (14 to 26 December 2019) & All Solved Past Papers, Solved MCQs & Helping Material
41 minutes ago

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

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

.