Great sir .thank you soo much for this detailed explanation. This helps me more to increase the understandability of the subject. Sir with your wonderful lectures u have helped me out to solve my problems. Thank you so much sir💞
Hai Aishwarya, plz go through my videos once. Definitely you will like more videos. Thanks for your encouragement and support towards our channel. Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.
Pu t another way, an ambiguous grammar is one tha t produces more than one leftmost derivation or more than one rightmost derivation for the same sentence. I guess , sir we should get more than one lmd or rmd
02:05 Ambiguous grammar generates more than one parse tree for an input string. 04:10 Ambiguous grammar generates multiple parse trees. 06:15 Ambiguity in grammar can result in multiple parse trees for the same input string. 08:20 Explaining ambiguous grammar ambiguity 10:25 Demonstration of ambiguous grammar 12:30 Leftmost derivation expands leftmost non-terminal 16:36 Ambiguous grammar generates multiple parse trees for input string.
A grammar is said to be ambiguous if there exists more than 1 parse tree(2 left parse trees or 2 right parse trees or combination of both) for an input string.
We are checking whether grammar is ambiguous or not using lmd or rmd . Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
we can remove ambiguity using 2 approaches such as left recursion and left factoring. Refer this ruclips.net/video/dUZgxEVNOAo/видео.htmlsi=4xozd2NghM3A6cI2 ruclips.net/video/1uPW96bJByY/видео.htmlsi=hI9vNJb0CLWktO0V Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Hai Ajay,plz go through my playlists once. Definitely you will like more videos. Thanks for your encouragement and support towards our channel.Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.
Hai Vishnu Murali Thanks for your encouragement and support towards our channel.Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.
Hai Chaithanya Pagadala, plz go through my playlists once. Definitely you will like more videos. Thanks for your encouragement and support towards our channel. Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.
Sir kindly upload remaining topis of compiler design like back patch,type checking,switch,garbage collection,trace based collection,data flow analysis constant propogation,loops in flow graph,basic bloks
How many are watching one day before exam
All the best. Please like the video, subscribe to the channel, and share it with your friends. Thanks in advance.
Sir for consructing parse we should to take only left most derivation or right most but you take both it is possible sir
As per my knowledge we can take one lmd and one rmd also. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Great sir .thank you soo much for this detailed explanation. This helps me more to increase the understandability of the subject. Sir with your wonderful lectures u have helped me out to solve my problems. Thank you so much sir💞
Hai Aishwarya, plz go through my videos once. Definitely you will like more videos. Thanks
for your encouragement and support towards our channel. Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.
Pu t another way, an ambiguous grammar is
one tha t produces more than one leftmost derivation or more than one rightmost
derivation for the same sentence.
I guess , sir we should get more than one lmd or rmd
Both are correct only as per my knowledge. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
02:05 Ambiguous grammar generates more than one parse tree for an input string.
04:10 Ambiguous grammar generates multiple parse trees.
06:15 Ambiguity in grammar can result in multiple parse trees for the same input string.
08:20 Explaining ambiguous grammar ambiguity
10:25 Demonstration of ambiguous grammar
12:30 Leftmost derivation expands leftmost non-terminal
16:36 Ambiguous grammar generates multiple parse trees for input string.
Okay
Ur lectures are extraordinary😊
Glad to hear that. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
While (1)
Cout
cout
Sir how take a input string to language
some textbooks say grammar is ambiguous if more than 1 left parse tree or more than 1 right parse tree can be constructed.
A grammar is said to be ambiguous if there exists more than 1 parse tree(2 left parse trees or 2 right parse trees or combination of both) for an input string.
Plz subscribe to the channel and share with your friends.
Thank you so much sir for your contribution😊
It's my pleasure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir is this compiler design subject or. Flat??!
cd but in flat also we have this concept.
Thanks a lot sirr😢
All the best. Please like the video, subscribe to the channel, and share it with your friends. Thanks in advance.
I was so confused with the topic (even with tb), but this cleared it for me, thank you
Glad it helped. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
sir what is difference between ambiguous and LMD &RMF
We are checking whether grammar is ambiguous or not using lmd or rmd .
Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
lots of appreciation
so nice of you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Removal of ambiguous grammar videos can you upload sir
we can remove ambiguity using 2 approaches such as left recursion and left factoring. Refer this
ruclips.net/video/dUZgxEVNOAo/видео.htmlsi=4xozd2NghM3A6cI2
ruclips.net/video/1uPW96bJByY/видео.htmlsi=hI9vNJb0CLWktO0V
Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Construct YACC source program for ambiguous grammar,
E → E + E / E - E / E * E / E / E / ( E ) / - E / number
Sir Help Me Out From This Program
sir i have a dought sir in first example why we cant use (E) sir
You can
Why are the strings derived step by step ? Can't it be done in one step itself ?
no ,in a particular step we can replace only 1 symbol. we have to follow step by step procedure only.
Nice explation
Hai Ajay,plz go through my playlists once. Definitely you will like more videos. Thanks for your encouragement and support towards our channel.Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.
plz explain once
In which college u are professor sir
Lakireddy Bali reddy college of engineering. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Great exPlenation helPed me to know the concepts..... thnq u sir
Hai Vishnu Murali
Thanks for your encouragement and support towards our channel.Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.
We can derive aabb from right too
Okay. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Great explanation sir thank you and your videos are very helpful to me
Hai Chaithanya Pagadala, plz go through my playlists once. Definitely you will like more videos. Thanks
for your encouragement and support towards our channel. Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.
How string is know sir
generate from start symbol. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Tq for u r good teaching sir
You are most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Excellent sir
Really helped me a lot🙏
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Thanks for explaining
You're welcome divyasri. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Voice too low sir
Ok. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Ur amazing sir
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Good explanation thank u sir 💐
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@@SudhakarAtchala ok sir
Great explanation helped me alot
Plz subscribe to the channel and share with your friends.Thank you.
❤❤❤thanks sir
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@@SudhakarAtchala sir can you please share me the links of finite automata videos..
In Playlist there is only 15 videos...I can't find remaining videos of finite automata
uploaded 15 videos only. very soon i will start uploading remaining videos
Sir kindly upload remaining topis of compiler design like back patch,type checking,switch,garbage collection,trace based collection,data flow analysis constant propogation,loops in flow graph,basic bloks
When is your compiler design exam.
@@SudhakarAtchala 24-04-2019
But sir here both the parse trees are same, how can be the grammar said to be ambiguous
But derivations are different one is lmd and other one rmd. Plz subscribe to the channel and if possible share with your friends. Thank you so much.
@@SudhakarAtchala Thanks for replying sir