I'm a vietnamese engineering student, I struggled at this part and went on youtube for help, your 19 mins video is far easier to understand than my professor's 1 hour lesson, it's so much more productive. Thank you so much !
Great explanation! When I watched this video the second time, the concepts finally started to click. However, I implemented a SLR parser table generator based off of your explanation and ran into a problem. Throughout this example there are a couple times when multiple transitions go to the same state. For example, the "A->.aA" is contained and multiple states and all transition to the state with "A->a.A" in its kernel, instead of creating a new state. I kept running into shift-shift conflicts (which shouldn't happen) because two items from the same state would try to transition to different states because the items they became were already contained in another state's kernel (the original set of items before the closure is applied). This method would have worked on your example because there isn't multiple items in a state which transition on the same symbol. The correct method to handle transitions is to check if all of the items which transition from a state on a symbol is equivalent to all the items in the kernel of another state. If they are, then the original state transitions to the other on the symbol. I was finally able to figure this out when I studied LALR parsers which merge LR states with the same kernel. Hopefully this helps someone else avoid the same pitfall that costed me a couple hours of head scratching!
I should admit myself that It was abit hard to listen to your accent, but I also have to admit that your lecture is very much helpful to me to understand about how to construct LR(0) parcer. Thank you for the great lecture.
I have a doubt, do we put all the reduce 'r' in entire row, or by visualizing the follow to the left of production in SRL or LR(0). I referred "compiler principle and technique" by Alfred, Monica, Ravi, Jeffrey. page-254 4.6.4. Other all terms and explanation was very clear and understandable, thank you sir.
S->A|B A->aA|b B->dB|b construction SLR (LR 0) parsing table.. Sir please make a video for this example because getting some difficulty to solve this problem
I believe that God exists, not as an omnipresent entity who fulfills every silly wish, to correct me when I stray, but as a presence that manifests when i need him the most. I pray for grades and he shows me how to get them, not by pouring them endlessly, but making me work for them by showing me the path, which makes it deserving rather than gifted, converting days of gibberish from countless so called teachers and making sense with words lasting a few minutes. If thats not a miracle, I dont know what is. For an engineer, whose life depends on decoding this gibberish, this entity offers us a better, endlessly feasible solution. All this without asking us for anything in demand but our time. God exists, I know him as Sir Ravindrababu Ravula. **respect**
thank you for the explanation, everything was very clear! i noticed that at 17:45 you put R1 on every column. shouldn't we put Rn on the symbols contained in the FOLLOW of S in this case? which unless i'm mistaken, the FOLLOW(S) = {$}
Get 7 Days free trial offer on Plus subscription:- unacademy.onelink.me/k7y7/f3r7fmbs
9
Pool
O00mll0l
M
Loops0ppppl0l to
I'm a vietnamese engineering student, I struggled at this part and went on youtube for help, your 19 mins video is far easier to understand than my professor's 1 hour lesson, it's so much more productive. Thank you so much !
👍👍👍👍 super
no words..you are a genius.. found your videos on networking helpful..Now you are offering the same kinda help with compiler too..big thanks sir..
Great explanation! When I watched this video the second time, the concepts finally started to click. However, I implemented a SLR parser table generator based off of your explanation and ran into a problem. Throughout this example there are a couple times when multiple transitions go to the same state. For example, the "A->.aA" is contained and multiple states and all transition to the state with "A->a.A" in its kernel, instead of creating a new state. I kept running into shift-shift conflicts (which shouldn't happen) because two items from the same state would try to transition to different states because the items they became were already contained in another state's kernel (the original set of items before the closure is applied). This method would have worked on your example because there isn't multiple items in a state which transition on the same symbol. The correct method to handle transitions is to check if all of the items which transition from a state on a symbol is equivalent to all the items in the kernel of another state. If they are, then the original state transitions to the other on the symbol. I was finally able to figure this out when I studied LALR parsers which merge LR states with the same kernel. Hopefully this helps someone else avoid the same pitfall that costed me a couple hours of head scratching!
Thanks!
This is literally the first time I am understanding a concept of compiler design... Thank you sir.
Really like how you have presented things in a clear,concise manner and most importantly , correct content ! Thank you very much ....
The one who figured this out first was absolute genius 🔥
11:30: "...Therefore now I'm going to construct the parsing table for this...."
*But let me change my T-shirt first* 😂
ha hah
even he had to take a break from this shit xD
came here for this
@@3in140 appplla0pp\pawaslqqqppqppesaappqppp
😊😊🐱🐱🏡
i have became your fan now sir, u saved me from getting supplys, ist in dbms ,networking and then compiler
You are too good. Explain things very easily and clearly.. It really helps a lot. Thank you :-)
Pritham Hegde
I should admit myself that It was abit hard to listen to your accent, but I also have to admit that your lecture is very much helpful to me to understand about how to construct LR(0) parcer. Thank you for the great lecture.
best lecture ever...!! i had never seen this best technique before this. thank u :-)
The best instructor ever on the web and in the world! Thank you so much!
The way of explanation is just amazing... You made such a boring subject interesting 😂
i wished my professors would teach like you
A beautiful explanation. Regards from Sri Lanka. 🇱🇰
who is here a day before the exam? xD
do u people have exams ?? ol or offline
@@mini22q11 online obvio
@@anubhavpandey8407 :all d best
Me rn😩🤣
Offline😪
Same question solution wrong on geeks for geeks . You are clear my doubts. Thank you sir.
video is 9 years ago.😮 Excellent Explanation 🎉🎉
You explained the topic so clearly....thank you so much
u r better than my whole university teachers
Best lecture i have ever seen... Thank you bestie😘😘💕
Long Live sir..Thanks a lot!
Wow, Great work Mr. Ravindra, I should really appreciate you for your efforts. keep going... :-)
I wish I could give you more than one like!
Thanks for the explanation mate
Niku dandam saami!!!! Sir mee valle compiler design pass avtam ani confidence vstondi!!!
Sir u r sooo cute n ur way of explaining is so different
You have done a wonderful job.. Thank You.. You desrves a really great future..
You are really Superb Sir.💕💕😍
Great explaination 👌
And yes nice physique man 🔥
Shift reduce parser
E->E-E
E->E*E
E->id
Best teacher & teaching method✨
big thanks to you....I actually depend on your explanation to understand the course and get ready for exam...God help you as you help others
I have a doubt, do we put all the reduce 'r' in entire row, or by visualizing the follow to the left of production in SRL or LR(0). I referred "compiler principle and technique" by Alfred, Monica, Ravi, Jeffrey. page-254 4.6.4. Other all terms and explanation was very clear and understandable, thank you sir.
you saved my life!
Thanks for this video. Best explanation.
Great. I'm going to make a good score for compiler by your vids. Thank you
sir thanks a lot for helping me to understand this concept.your explanation is simple and superb
thank you, I got A+ on compiler because of u
@pritam patel convention meaning
thank you sir, your explanation has removed our ambiguity
thank you a lot for these instructive and simple way to deal with these SLR parser
CRYSTAL CLEAR EXPLANATION 💯
thank you a lot for making this so easy for me... thank you..
Made it so clear , Thank you !!!
S->A|B
A->aA|b
B->dB|b construction SLR (LR 0) parsing table..
Sir please make a video for this example because getting some difficulty to solve this problem
Thank You Sir. Your lectures are very helpful and easy to understand!
Thank you so much my friend, you are the one!
this type parser ,we understand from your lecture..so very nice sir👍
Perfectly explained
Great explanation sir
Thanks Mr.Ravula! It was really helpful.
Thanks alot sir.Your's explanation is very easy to understand the concepts.
Precise teaching with simplified examples. Thank you
I like your way of explanation keep going like this sirrr
thank you for your teaching! from Seoul
Does he just changed in between of lecture?
hahhah i also notices thAT
me too noticed
Was jst practicing tiktok cloth transition, dnt mind
sir,you explain awesome..great sir......
easily we can understand by his lecture
Best explanation!
So much love ❤️
hats off to u!!amazing compiler videos ever:)
can plz upload code generation and optimization videos if possible
Good looking and way of explanation is also too good like you
thanku sir..this all vedios from lect 1 are very usefull..very well explained hats off
THANK YOU for the series of you've been creating. They are really amazing and very helpful
HOWS LIFE GOIN MAN?
@@allmarvelcontent same question
Thank you Ravula. This was super helpful.
thank you sir!!! you saved my exam
Your all videos are so helpful for my exams. Thank you!!
Great job I totally understood, Thanks
You are a life saver, I like your videos
This dude is the goat
so nice teaching sir i love your teaching .....
thank you soooo much ! very good explained .
Thanks a lot. You're much better at explaining these than my Compiler Design professor at CSU Fullerton :)
Life saver!
@@hannanbaig7888 if X->AA then augmented grammar will be x'->x
😂😂😂
you just saved my compilers exam
dis is what i wating for..
clear and crisp explanation !
This video is so clear ! Thanks
goddamnnnn... thanks brodaaa... that was too confusing but you made it toooo easy..... I'm moving onto further lectures of you.... thanks...
Easy Explanation with Good Examples....Great sir.
Thanks man, you're a life saver. x
good explanation tq so much and please explain dangling else ambiguity problem
Thank you very much for giving nice explanations.
Clear explanation sir thank you sooo much
Your vedios are life saver thank you so much sir
Superb sir
SIR YOU ARE BEST.
Very well explained 👌👌👌
I believe that God exists, not as an omnipresent entity who fulfills every silly wish, to correct me when I stray, but as a presence that manifests when i need him the most.
I pray for grades and he shows me how to get them, not by pouring them endlessly, but making me work for them by showing me the path, which makes it deserving rather than gifted, converting days of gibberish from countless so called teachers and making sense with words lasting a few minutes. If thats not a miracle, I dont know what is. For an engineer, whose life depends on decoding this gibberish, this entity offers us a better, endlessly feasible solution. All this without asking us for anything in demand but our time.
God exists, I know him as Sir Ravindrababu Ravula. **respect**
BE YEE SAB LIKHNE SE ACHA ...PADH JA KE..
ha re tu padh
Hahaha
padh le bhai
That's so true!!!!!!!
Sir you are Looking too handsome.. 😅
Amazing explanation!
@Ravindrababu Ravula thax a lot for such a useful tutorials. Keep it up Sir
- via YtPak(.com)
10xs your explanation is good
thanq so much ....it helped me for my semester exam
Great explanation Thanks for helping bro
sir
if we get a production in which left recursion is present then we need to remove it or not?
I think we should remove, but please clear the doubt.
thank you for the explanation, everything was very clear!
i noticed that at 17:45 you put R1 on every column. shouldn't we put Rn on the symbols contained in the FOLLOW of S in this case? which unless i'm mistaken, the FOLLOW(S) = {$}
You make this all very easy, thank you so much
you are god my friend!!!
in 3 days i have my SPCC exam and your videos are KT saving :D
sir ur best! no words....
nice explained.... thank you ton ✌🙏