Trick | Left Most Derivation | Right Most Derivation | Parse Tree | Ambiguous Grammar| Example.

[@MDMERAJ-j5g3h]

wow what is teaching technique. Amazing thank you so much sir jii

[@king_sir924]

Thank u so much sir aap bhat simple way me smjha deye ❤😊

[@Songsz34]

Bhai bhai bhai can't thank you huge respect and gratitude towards you bro love you ❤

[@anunawaz7158]

Nice way to teach maza agya sun kar kal paper hai

[@vinit-d7q]

no one can beat this man for this content hugeeeeeee respect .....🙇🙇🙇🙇

[@talhaahmad8854]

what a way of teaching 🥰

[@Arnav-f4i]

hell nice crystal clear

[@Rajeev_Sanatani]

Sir there is no word to thanks u ..... I have searched full utube but u are the best explainer ❤❤❤

[@HridayKumarGupta]

Thanks and welcome

[@Rajeev_Sanatani]

@@HridayKumarGupta sir I make parse tree in my exam paper thanks u sir ❤️❤️❤️

[@samyakjain9668]

Well explained sir 👍

[@Fronthub7]

👍Sir ek video parser (TOC) par bhi banao

[@zbeast7872]

you cleared my rmd doubt, thank you sir

[@enjoyable.day1M]

Huge Respect ❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤

[@janmejayrao6998]

Thanks sir you have easily make me understand 👍🙏

[@bhilvijayvijay327]

Wow I am so surprise you kill the topic in one shot

[@gauravpandeybca5747]

Thanks sir

[@honeymavi5587]

Sir ab iska right most derivation tree kaise banaye ?

[@HridayKumarGupta]

There is no RMD tree. RMD and Tree ko mix mat kariye . As you can see in parse tree is like a k-ary tree and in k-ary tree has no left and right child. For ambiguity, just show either (RMD and LMD) or ( two different parse tree ) for same string. If not understood , kindly acknowledge.