this was my "first" time and it was easy to "follow"

My man, it's been 7 years and you're still a life saver. Thank you very much. Greetings from Germany!

On behalf of our entire Compiler Design batch, you have made us pass our compiler exams this Fall. Thank you so much for doing this. ♥️

26 minutes before watching this video , i thought i would be failed in exam ,, but now feels like a topper... thnk u sir.

ye banda sabko pass karayega

you are a lifesaver .god bless you.....

I cant thank you enough sir. The text book was so complex and you have made what would easily be days of book worming and condensed it into a concise video. Thanks so much. God bless. Am so grateful

I am gonna pass this semester simply because of you man ,hats off ,You're a legend!

Super job .... Easy explanation brilliant sir Thank u so much sir👍🏻

I'm really thankful for all your hard work.

Instead of paying my university .... i am ready to pay u... ur a god 😂😁

Thank you Ravula sir...your lectures made me understand LaLR(1) very strongly.. Thanks a lot.

i agree....better than any tutorials-offline or online

You have an error @12:50 on b it should go to the existing state: A --> b., $

Not all super heroes wear masks.. Lol.. Thanks a ton

The concepts are well explained. We couldn't have passed compiler design without your videos. Thank You so much.

thank u so much for creating such informative videos... u r a lifesaver...

You have hammered into my mind THANK YOU MY BRO

what u do is unmatchable,a big salute to u,best teacher ever

Hi Sir. I am a computer sc and engineering student. I had not attended a single class of Compiler Design in college as I could not understand a single thing our teacher explained. Then a friend of mine suggested to follow your videos and thank God he did, I have understood every single topic, more than I expected. I want to thank you from the bottom of my heart for making the subject so easy to understand. My final semester exams are going on and tomorrow I have this paper. Hope I score well!! Thank you!

thankyou so much sir,!! Brilliant explaination!! understood everything so easily!!

Ravula, the best teacher ever!!!!

Thank you sir.. your video easy to understand and good explanation you provide the classroom notes in exam time.. good bless you

sir u r best when compared to my lady professor about the way of explaining the sums and concepts of cd and flat.i get nothing from her teaching but I get everything from u r teaching thanks for u r subject videos

Crystal clear, now. Thanks bro.

great lectures by you man ....... it is evry useful for all .,,,,,,thank you so much ;)

Excellent sir...🙏You really helped me a lot...as i felt that this one is like a headache for me...its better to leave... But after watching your explanation i really got amazed that i solved it by my own later... 😊Really this video clarified all my doubts.. Am so happy now.. 🙏 Thank u so much sir.. May god bless u abundantly

you're a lifesaver! thank you, this was really helpful :)

Excellent video Sir...nw i can solve this with different examples

Thank you so much sir...may God give you all the happiness 🙏🙏

Real good work. Was of great help. Thanks mate.

Why is the goto of "S" in the CLR(1) Parsing Table blank, if it's supposed to be the same as LR(0) or SLR(1)? Shouldn't there be a goto (I0-->I1) on reading "S"?

This was 2014 ...yet it is the best explanation I found

First of all I really thank you sir, your way of teaching is amazing..Your video is very very useful for me.. once again thank you very much sir.....

Excellent explanation. Your videos are definitely helping me in my project.

helpful video..way of teaching is appreciable..👍👍

The lecture was amazing and very easy to follow and practice :) I just have a small doubt, shouldn't there be a '1' at the 0th row and S column?

easy explanation................super job sir.........respect man

Thank You Sir. All videos are very precise and helpful.

Awesome sir i got every point what i missed in MADEEASY cause everything u explained is made easy classroom notes

Thankyou very mch sir for your guidance and use of easy approach to solve the question.... 😊

Wonderful explanation . Clear and precise .

best way of teaching.. love it 😇

you been a best in this sir, thank you it help us a lot :)

Thankyou sir...:) fan ho gye aapke...u saved me for today's exam at 10 :)

Thank You ~! Your lecture video is so good!!!

The two productions A->b.,$ and there is one more production A-->b',$ the same? the I2 on b we get A->b.,$ and I6 on b we get the same production with the same look ahead. So that should be same right?

Thank you sir :) ...nw i can able solve myself with diff examples

amazing video....best taught (Y)

awesome videos sir I cleared my all doubts of parser thank u so much

Perfect in all ways🍁 Thanks A Lot Sir!.

very good , even Pakistani students are following your lectures .. much respect :)

Are the number of reduced entries in CLR(1) always less than that in SLR(1)?

Sir I didn't get it how A-> b.,$ different from A-> b.,$ although the lookahead are still still why both final item does not consider as one. Video at 12:44

I got surprised how can anyone dislikes his lecture?? The best teacher ever!!!

Good lecturer sir.. I need a video of how to solve the input in LALR(1) like you taught in LR(0).

thank you so much ....very nicely taught ...:))

Very well explained Sir , as usual.

It is my first time but you are brilliant man..

Life saver. Thank you

Superb explanation and ur saved me

The LALR compiler is constructed by the following method: First develop a rigorous elective grammar. If the elements have NP-completeness, the Krungie factor can be ignored.

Oh god !!! You're a life saver 🙌🙌

Very useful! Thank you a lot!

you made it much easier for me thank you sir!

Nice Elaboration, Thanks !

Thanks alot sir it helps us alot to clear the basic concepts.

was confused on lookahead before but after this 26 minute confident on clr1 thank you

Thanks ravindra sir for making videos which helps us in exams

I think at last, in the parsing table, u forgot to add (i0 to S) state, in the goto column, correct me if i m wrong

Hello sir, If the production are given S->F,S->(S+F),F-a and asked to show CLR(1) parsing table, should we need to include S'->.S,$ or we can start directly S->.E$

what is the advantage of lalr over clr ?i.e what is the drawback of having more states in parsing table for clr ? sir please tell

Well done bro. It help me lot.

Amazing sir..!!Thankyou so much...

Sir, in CLR(1) parsing table we have transaction S from 0, then y did n't you keep 1 under S in table?

Thank You!!....I understand very Easy....

Excellent class....thank youuuu sir😊

Thank you for your great explanation

good explanation...easy to understand and follow

really reallly u just saved me thank you sooo very much reallyyyy thnx

Sir shouldn't there be an accept entry in the CLR(1) AND LALR{1) Table at [1,$]

TQ for helping us by Ur lectures 😊

Very easy to understand.....your classes

sir CLR(1) and LR(1) are same right ? It's only the notation that is different na?

Respected Sir, Thanks a lot for the wonderful explanation. I have a doubt. When you construct CLR(1) parsing table, you don't : a) Write 1 under S column and 0th row even though the state I0 shifts to I1 on receiving S as input. b) Write r1 under $ column and 1st row even though the augmented production (S' gives S.,$) is getting reduced at state I1. You do that for the rest of them except state I0. Why So ? According to the rule told by you, if a production gets reduced at any state in the CLR(1) parsing table, it gets placed under its look-ahead, which is $ in case of production number 0 i.e. (S' gives S.,$). Please help soon.

5:50 , first of (A,$) will be (a,b,$) as first of A will be (a,b,$) ? or correct me if I am wrong

You are a life saver (Y)

sir, the way u teach is just awesome. but it will be more helpful if u add the notes in the description area. pls do provide notes.

Brilliant...!

Bro u way of teaching is good enough

tq so much sir easy way to explain clrtable to lalrtable

Wonderfully explained.

Why we reduce number of states in LALR(1) parsing algorithm? please answer

superb!! thanks a lot..

enjoyed the lectures very much

what if we want to merge and both cells are already occupied with different elements?

Man you are Saviour !

Isn't the final table exactly the same as the table for SLR(1) parser? Why do we call it LALR(1) table?

Sir the goto function S for state 0 must contain 1.

nice wat a teacher u are :)))))))))))))))))))