grammer is like R-->R+R/RR/R*/a/b/c obtain the string w=a+b*c mam does this question is same as you solved in video pls check that there is RR and R* and not [ R*R ] pls reply
Its just an example which can be taken as, if any string that can be derived from above given production rules can be taken as an a sample string to check whther there is ambiguity or not
you said in lec 56 that parse trees follows operator precedence so no operator in parent node will have more precedence than the operator in the child node, so how the first parse tree you constructed is possible?? please help out.
@@shrutibiswas2400 as it's grammer here we define the precedence of each operator that is its upto me if I want to give more priority to + than *. So as we define the precedences as we like. So its correct that no operator in parent node has more precedence than that of child node. As its the way we defined our grammer. Hope this solves your doubt :)
This video is too helpful for me and I cleared all my doubts related to the ambiguity by this video Thanks
Thank you so much ma'am for these videos🥺🙏🏻😇
beautiful video thanks alot
Wow! Firstly done basic clear then advance that is good process 😊👌... thanks Apu from Bangladesh....
This video is too helpful me and I cleared my doubts related to the ambiguity by this video thank you ma'am😊
grammer is like R-->R+R/RR/R*/a/b/c obtain the string w=a+b*c mam does this question is same as you solved in video pls check that there is RR and R* and not [ R*R ] pls reply
*MAM SABHI PRODUCTION RULES KO INCLUDE KARNA ZAROORI HAI KYA,KYONKI AAPNE ABOVE QUESTION ME 4th PRODUCTION RULE KO INCLUDE NHI KIYA*
I have a doubt how we r taking the 3*2+5 plss tell me mam
Its just an example which can be taken as, if any string that can be derived from above given production rules
can be taken as an a sample string to check whther there is ambiguity or not
@@rakeshbammidi8856 so what you mean is that the input string will be given in the question. Is that so?
@@saqlainzarger No actually what I mean is even though they won't give us any input string we can frame a sample one from given production rules
Madam we know solve the problem plz tell us who to take string
thank you so much mam, it was great helpfull to me . iwas cleared all my subs by watching your videos.
How do you already know that the above grammar can generate 2 parse trees by LMD???
we have two simple production rules e -> e*e and e-> e+e , choosing any1 leaves behind the 2nd option
Good
3*2+5 the value how came ?!
you said in lec 56 that parse trees follows operator precedence so no operator in parent node will have more precedence than the operator in the child node, so how the first parse tree you constructed is possible?? please help out.
I have the same question
@@shrutibiswas2400 as it's grammer here we define the precedence of each operator that is its upto me if I want to give more priority to + than *. So as we define the precedences as we like.
So its correct that no operator in parent node has more precedence than that of child node. As its the way we defined our grammer.
Hope this solves your doubt :)
Great one
mam if it were e + e + e would it still be ambiguous ?
😂😂😂
@@venkygandrothu3476 why are you laughing
Thank you so much mam. you save me today.
It was helpfull to me , thankyou ma'am
wrong spelling of "grammar" in heading (X grammer X)
Who to get the string that's imp one
thanks so much madam
no problem
Thank You
Tq so much mam ur videos full helping me
very helpful video...thanks
But ❎ Bat ✅
Pdf file ahaa irunthaa send panuka mam
thank you so much kip it up!!!
Thank you ma'am
Good teaching 👍
But what is (E) ??
E is the start symbol.
@@ishaparab7804 Thank you.😂
E is non terminal
Elephant 🐘
tq so much mam🥰
N1
u r tutoring is super but the produce pronounciation is wrong i think i heard projuce but actualy its prod-uce
1hour exam
kono bal o buji nai..hudai time loss