LR(1) & LALR(1) Parsing Automaton

Please like & subscribe for more CS based tutorials! :)

[VictorAyswal]

You just saved my life for my test tomorrow. Thank you very much for this video.

[tareqnasif]

after watching more than 10 videos, i just understand them from u . goood job,

[sundeeprayidi]

And now I will bunk my CD classes with swag. Thanks for the awesome explanation. Live long and prosper 🖖🏻.

[Madalinos]

very very nice video, great work, keep going

[jorge-tutor]

great explanation, I finally understood both automaton in just 10 minutes! thank you

[Bigdasahjada]

Why don't we use transition of 'a' and 'b' on state I6 and I3 ? Because in lr(0) automata we make all the transitions for every item ! Please clear my doubt.

[cristhiandavid]

I think i love you right now <3 Thank you very much for your videos :)

[ebichan_tw]

Thank you a lot, you saved my midterm!

[pt]

Thanks for explanation. While transitioning the look ahead doesn’t change, but after transitioning while doing the closure the look ahead become the follow of the element having . In front. Why in I3 the look ahead of X -> .ax and X->.b is a/b while this is the closure of X-> a.X, a/b ? here is a /b as look ahead for X -> a.X is normal cause coming from the precedent state, but for the two others here follow of X should be $?

[tahiraslam]

Thank you sooo much :D finally i understand the concept behind Look

[wasikhan]

Are you agreed with the concept that all LR(1) grammars are also LALR(1) grammars? Write your answer with the help of solid reasons.???

[PanamaRobinZ]

Se que no me vas a entender pero...TE AMO HERMANO ERES EL PUTO AMO<3

[kamyexol]

Thank you so much this helped me a lot ~~

[zia]

Why on I3 and I6 you don't move to next state on " a " and "b"?

[primitzisgate]

if it is LL(2) we take the FIRST of the 2 first symbols after the one with the dot ????

[hasansakib]

black background use korechen kon software diye apu?

[swapnilmishra]

between LR(0) AND LR(1) which is more powerful