Ambiguous to Unambiguous Grammar | Compiler Design

[@dippatel1847]

Sir you are teaching so nice ❤️ that we can understand even in 1.75x speed and in first try itself. Really helpful for college students during exams. God bless you sir . Keep teaching keep growing sir

[@aryanb6686]

Gujju khem cho

[@ayushjaiswal6317]

I never comment but ......Gate Smasher is overrated .The Gatehub is underrated. You deserve a million subscriber sir .

[@sinanmohammadnahian4768]

Lol. If you praise then praise. But don't put others down

[@kamleshsinghbisht130]

@@sinanmohammadnahian4768 but it's truth in terms of Compiler Design at least.

[@DaljeetSingh-vv2tk]

true, deserves more subscribers

[@RupeshMishra-r7h]

It is up to us , Viewers ,we should like , share and Comment so much that Algorithm will push this video as much possible.

[@sajalchhetri2476]

So why belittling others?​@@kamleshsinghbisht130

[@TheonlyKT1225]

I have never seen a Sir cover so muvh and so precisely. You are God for us Sir!!

[@doeydever7124]

You are truly an amazing teacher. Take ❤️ 🙂

[@neha_singh25]

Hats off to you sir ....🛐

[@vinaygurjar9771]

best explanation so far...Thank you very much bhaiya..

[@aaishaakram5]

Very simple and easy explanation I can't explain in words

[@PointofUncertainty]

THE G.O.A.T 🐐🛐

[@Googlinghelpers]

So insightful man ,next level

[@kumaravelrajan]

Great explanation. Thanks! 😀

[@sahilbhujbal8373]

good example

[@bharatlondhe9995]

❤❤❤

[@amanmaurya7646]

sir skkiped what is unambiguous tree

[@lakshyadalal8296]

9:13 left n right recursion

[@13manveersingh]

Bhaiya koi baat ni sb theek ho jayega

[@lastbenchers019]

Underrated!!!

[@Hindi_movieExplanations]

Thank u sir🙏

[@manojkumarbehera4479]

Nice Explanation ❤️❤️

[@damnengineering26]

How to include - and / ?

[@ahmadtashfeen94]

Shera love you hogaya

[@muhammadfahad6610]

great

[@noornawaz7147]

Sir Please Make a video on some another grammar / production and convert them into unambiguous like: S → AB | aaB A → a | Aa B → b and S → ABA A → aA | ε B → bB | ε

[@musicmysoul6060]

You got video for that?? I also have same questions this sem

[@noornawaz7147]

@@musicmysoul6060 no

[@musicmysoul6060]

@@noornawaz7147 shit

[@kumarabhishek3890]

from 14

[@SantoshKumar-lz2ti]

Doubt :- I think for a string we can one left parse tree and one right parse tree, if more than one tree for left or right..then it is ambiguous..am I correct?

[@atulshende6631]

okay i will clear ur doubt -> if a grammar is unambiguous then the structure of right most derivation parse tree and left most derivation parse tree will always same, so in unambiguous grammar we will not get more than on parse tree for a string because structure of Lmd parse tree and rmd parse tree will be always same If a grammar is ambiguous then the structure of lmd parse tree and rmd parse tree will be always be different for a string. and it is also possible that more than one lmd parse trees or rmd parse trees have different structure in ambigous grammar.

[@SluciferKm]

If we generate more than one parse tree for a particular string with given grammar then there is ambiguity in the grammar 👍🏼

[@KHURRAMSHAHZAD-jl5qi]

areee bhai koi aur bhi krlo ezample same sbhi krte ho

[@reeshavacharya]

7:30 LMAOOO

[@UNKNOWN-yi7jn]

Ok

[@FahadiAleem]

bllkul smjh ni ai

[@revived_aura9185]

Sorry but it was not helpful

[@rishabhsrivastava1843]

jhatiya ni smjh aaya

[@itachi_terabapp]

Ok

[@ibtsachid9814]

ok

[@pavanvarma2860]

​@@ibtsachid9814ok