Thank you so much for this video. I have question. For context sensitive grammar type1, 0^n1^n0^n is type 1 but it is ambiguous how can we have it not ambiguous? Thank you
The problem with ambiguous grammar is that a single input string corresponds to more than one possible parse tree. So, it may create a confusion for the compiler.
Watch in 2x if tommorow is your exam.
Asheesh Thakur hehe thanks..tomorrow IS my exam... slacked off 10 days for this lol
Today is my exam
2 hrs to exam
😂🤣😂🤣
4hrs
Explanation for ambiguity 100/100
Exp. For removing amb.. . -100/100
true 100
Enroll now to Unacademy Combat for FREE & avail a chance to register for GATE 2023 from us:
unacademy.com/combat/gate-cs-it/NVLIA
As usual, indian RUclipsrs saving me at last moment. Thank u so much
Bhai aap Kaha se hoo
Sir how did u choose the string aab?
Is there any conditions for choosing a string?
I am also stuck with same problem no one is answering that
how to check ambiguity if which string to be generated is not given and only grammar given?
Take a random string
In such cases, you have to take random strings that can be generated from the given grammar and then check them out.
Thank you so much for this video. I have question. For context sensitive grammar type1, 0^n1^n0^n is type 1 but it is ambiguous how can we have it not ambiguous? Thank you
what is the problem if a cfg is ambiguous??
The problem with ambiguous grammar is that a single input string corresponds to more than one possible parse tree. So, it may create a confusion for the compiler.
Why was the association problem ambiguous. If you would have followed the leftmost path both the trees would have been same
I don't know how you managed to make this more confusing but you did
u r right !
Haha
🤣
someone help i dont what this is i was just looking ambiguity with two meaninngs in english what is this chemistry??? idk anymore
sir how do we decide the string ourself
Powerful lesson. Thank you Sir
Why did u choose left recursion? Could it be right recursion.
so .. there is no formal rule to solve the ambiguity ?! :(
I think so
Thank you so much for the video! Great explanation! Please keep it up!
right linear grammer and left linear grammar tell me
Thanks alot
This is exactly what i was looking for
I cannot understand cfg
I'm not understand how to last in last few minutes.....and your voice quality is very poor
Thanks you
it's very helpful , thanx a lot
It means if having same results by applying different rules then it is ambiguous??
Its not about same answers, its about of multiple trees. If you can create multiple trees with grammar, then the grammar is ambiguous
How to remove ambiguity from first eg? The one without operators,?
Thank you so much for this.. It was really helpful😊😊
How do you consider w=aab
That maybe given in the question
tnx for all vedio sir and good and easy explain all topic☺☺ all the best for next vedio
it is necessary to one tree is maked my lhd and another one is rhd
Thank you sir
MIC QUALITY GODDAMMIT
awaz hi esse hai iski😖😖
lol
""Hail Hydra" :P
my dude, thanks so much for this explanation
confusing still .
Thanks!
great video!
Thank u so much
Thank You! :-)
You are explaining things like bettle juice
Sir help me how to prepare gate exam
suman raj go for the videos of knowledge gate he do only read the lines from books and nothing else
good
thank you so much :)
Plzz sir hindi mein bola karo😥
rhanc dude
😂😂😂😂
bhai hindi bol le eng nh arhi to
so so
Hindi me he bol lo sir😥
Punk LorD chutiye bol ni pa raha bo
Thank you for this worst explanation
Hindi me bol lo maharaj
Thank you sir