Get 7 Days free trial offer on Plus subscription:- unacademy.onelink.me/k7y7/f3r7fmbs
@kanubhaiparmar1592 Жыл бұрын
9
@kanubhaiparmar1592 Жыл бұрын
Pool
@kanubhaiparmar1592 Жыл бұрын
O00mll0l
@kanubhaiparmar1592 Жыл бұрын
M
@kanubhaiparmar1592 Жыл бұрын
Loops0ppppl0l to
@congluong4633 жыл бұрын
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 !
@snehar11112 жыл бұрын
👍👍👍👍 super
@alokesh9854 жыл бұрын
This is literally the first time I am understanding a concept of compiler design... Thank you sir.
@u2bevdos9 жыл бұрын
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..
@tylerhoyer17506 жыл бұрын
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!
@gauravgoyal12345 жыл бұрын
Thanks!
@yusufsahin684925 күн бұрын
The best video that I've ever watched which explains this subject very well. THANK YOU
@malharjajoo73938 жыл бұрын
Really like how you have presented things in a clear,concise manner and most importantly , correct content ! Thank you very much ....
@vinayak186f33 жыл бұрын
The one who figured this out first was absolute genius 🔥
@anubhavpandey84074 жыл бұрын
who is here a day before the exam? xD
@mini22q114 жыл бұрын
do u people have exams ?? ol or offline
@anubhavpandey84074 жыл бұрын
@@mini22q11 online obvio
@mini22q114 жыл бұрын
@@anubhavpandey8407 :all d best
@hamdis74494 жыл бұрын
Me rn😩🤣
@somiazulfiqar20174 жыл бұрын
Offline😪
@RikunjSuthar10 жыл бұрын
best lecture ever...!! i had never seen this best technique before this. thank u :-)
@prithamhegde335310 жыл бұрын
You are too good. Explain things very easily and clearly.. It really helps a lot. Thank you :-)
@OUMAYOUBBENDJERIOU6 жыл бұрын
Pritham Hegde
@nigamsingha10288 жыл бұрын
i have became your fan now sir, u saved me from getting supplys, ist in dbms ,networking and then compiler
@cadenzah936 жыл бұрын
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.
@DebasishDas-bi4bo5 жыл бұрын
11:30: "...Therefore now I'm going to construct the parsing table for this...." *But let me change my T-shirt first* 😂
@3in1405 жыл бұрын
ha hah
@namankhanooja53725 жыл бұрын
even he had to take a break from this shit xD
@soumyapawar81254 жыл бұрын
came here for this
@tiaraaja82683 жыл бұрын
@@3in140 appplla0pp\pawaslqqqppqppesaappqppp
@tiaraaja82683 жыл бұрын
😊😊🐱🐱🏡
@ajayunni79278 жыл бұрын
The way of explanation is just amazing... You made such a boring subject interesting 😂
@simranvaidya12975 жыл бұрын
i wished my professors would teach like you
@MixatAAA2 жыл бұрын
The best instructor ever on the web and in the world! Thank you so much!
@VPadu04 жыл бұрын
I wish I could give you more than one like! Thanks for the explanation mate
@storyrkit78133 жыл бұрын
Best lecture i have ever seen... Thank you bestie😘😘💕
@Bond00.72 жыл бұрын
Great explaination 👌 And yes nice physique man 🔥
@simpleepic2 жыл бұрын
A beautiful explanation. Regards from Sri Lanka. 🇱🇰
@anthatikalyan499510 жыл бұрын
Wow, Great work Mr. Ravindra, I should really appreciate you for your efforts. keep going... :-)
@NeerajKumar-pt2zs3 жыл бұрын
Same question solution wrong on geeks for geeks . You are clear my doubts. Thank you sir.
@Samin75755 жыл бұрын
u r better than my whole university teachers
@anumohan6398 жыл бұрын
You have done a wonderful job.. Thank You.. You desrves a really great future..
@AlMOUED Жыл бұрын
You explained the topic so clearly....thank you so much
@sirgemahender61485 жыл бұрын
You are really Superb Sir.💕💕😍
@chetnatripathi93469 жыл бұрын
Sir u r sooo cute n ur way of explaining is so different
@DoDo-qi1vo7 жыл бұрын
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
@roshanm49555 жыл бұрын
Long Live sir..Thanks a lot!
@musicforever81 Жыл бұрын
video is 9 years ago.😮 Excellent Explanation 🎉🎉
@somiazulfiqar20174 жыл бұрын
Best teacher & teaching method✨
@AshishSasi19958 жыл бұрын
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**
@BrajeshKumar-ez8zs8 жыл бұрын
BE YEE SAB LIKHNE SE ACHA ...PADH JA KE..
@shashishekhar17298 жыл бұрын
ha re tu padh
@AnandKumar-vf5by7 жыл бұрын
Hahaha
@saxena37187 жыл бұрын
padh le bhai
@kittu59547 жыл бұрын
That's so true!!!!!!!
@kobbsy10 жыл бұрын
you saved my life!
@sonalialwani88726 жыл бұрын
Shift reduce parser E->E-E E->E*E E->id
@jahangiralikhan24108 жыл бұрын
Made it so clear , Thank you !!!
@justlikethat242110 жыл бұрын
sir,you explain awesome..great sir......
@Nhawy9310 жыл бұрын
thank you, I got A+ on compiler because of u
@kaustubh_ramteke_073 жыл бұрын
@pritam patel convention meaning
@pravinalugade29595 жыл бұрын
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
@vergil14447 жыл бұрын
Great. I'm going to make a good score for compiler by your vids. Thank you
@aishwaryakasthala976 жыл бұрын
Niku dandam saami!!!! Sir mee valle compiler design pass avtam ani confidence vstondi!!!
@bigtuna14758 жыл бұрын
Thank You Sir. Your lectures are very helpful and easy to understand!
@Nikhil78577 жыл бұрын
thank you sir, your explanation has removed our ambiguity
@pratheekhebbar26772 жыл бұрын
sir thanks a lot for helping me to understand this concept.your explanation is simple and superb
@0503Mit8 жыл бұрын
Precise teaching with simplified examples. Thank you
@mathemtb119 жыл бұрын
thank you sir!!! you saved my exam
@bhavyatammina80179 жыл бұрын
thank you a lot for making this so easy for me... thank you..
@harinipechetti56366 жыл бұрын
I like your way of explanation keep going like this sirrr
@billydongmo17324 жыл бұрын
thank you a lot for these instructive and simple way to deal with these SLR parser
@peepforlearning60586 жыл бұрын
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.
@sanjayKumar-sl6ho9 жыл бұрын
goddamnnnn... thanks brodaaa... that was too confusing but you made it toooo easy..... I'm moving onto further lectures of you.... thanks...
@informationtech14016 жыл бұрын
this type parser ,we understand from your lecture..so very nice sir👍
@billypak46059 жыл бұрын
THANK YOU for the series of you've been creating. They are really amazing and very helpful
@allmarvelcontent2 жыл бұрын
HOWS LIFE GOIN MAN?
@PetBuddies2 жыл бұрын
@@allmarvelcontent same question
@aminayasmeen88958 жыл бұрын
thanku sir..this all vedios from lect 1 are very usefull..very well explained hats off
@somyagupta13278 жыл бұрын
Your all videos are so helpful for my exams. Thank you!!
@jayajaya48624 жыл бұрын
Thanks alot sir.Your's explanation is very easy to understand the concepts.
@cgcg53232 жыл бұрын
thank you for your teaching! from Seoul
@tankado7079 жыл бұрын
Thank you so much my friend, you are the one!
@alinegary4 жыл бұрын
Thanks Mr.Ravula! It was really helpful.
@rutujapatil266610 жыл бұрын
hats off to u!!amazing compiler videos ever:) can plz upload code generation and optimization videos if possible
@srinivasp18587 жыл бұрын
easily we can understand by his lecture
@NagaMani-rb9yq5 жыл бұрын
Good looking and way of explanation is also too good like you
@yamchirobe10 жыл бұрын
Life saver!
@benchmarkking64385 жыл бұрын
@@hannanbaig7888 if X->AA then augmented grammar will be x'->x
@somiazulfiqar20174 жыл бұрын
😂😂😂
@CodeWithArjun3 жыл бұрын
Thanks for this video. Best explanation.
@bestofme10282 жыл бұрын
CRYSTAL CLEAR EXPLANATION 💯
@sanjaysunkad97127 жыл бұрын
sir ur best! no words.... nice explained.... thank you ton ✌🙏
@Urururopa4 жыл бұрын
So much love ❤️
@benjaminmusasizi37776 жыл бұрын
Thank you Ravula. This was super helpful.
@parsaimon6 жыл бұрын
You are a life saver, I like your videos
@solidgallium2191 Жыл бұрын
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) = {$}
@laibalaiba39784 жыл бұрын
Very well explained 👌👌👌
@Nightingale19899 жыл бұрын
Thanks a lot. You're much better at explaining these than my Compiler Design professor at CSU Fullerton :)
@utkarshsharma70619 жыл бұрын
Best explanation!
@sudhabiradar8816 жыл бұрын
so nice teaching sir i love your teaching .....
@thameralotaibi4802 Жыл бұрын
Great job I totally understood, Thanks
@deepshah279967 жыл бұрын
R is not to be put everywhere , follow sets of S,A -- there its r must be placed @Raindrababu
@mrtabom7 жыл бұрын
Canonical collections of LR(0) items, is it same as DFA?
@ramyayenugula80266 жыл бұрын
good explanation tq so much and please explain dangling else ambiguity problem
@camygiuliani87582 жыл бұрын
This video is so clear ! Thanks
@30benasabu65 Жыл бұрын
Sir when a left recursive grammar occur is it necessary to resolve the left recursion before finding the lr(0) canonical form. i also have a doubt what to do with epsilon productions
@mriduldas95315 жыл бұрын
Your vedios are life saver thank you so much sir
@tris0078 жыл бұрын
Thank you very much for giving nice explanations.
@anup_narvekar4 жыл бұрын
Perfectly explained
@casualyoutuber31602 жыл бұрын
Thanks man, you're a life saver. x
@ShahidAhmed_mait156 жыл бұрын
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.
@256dooda5 жыл бұрын
You make this all very easy, thank you so much
@omprakashsharma89949 жыл бұрын
Best explanation sir, this video is very helpful for me
@mounir19793 жыл бұрын
you just saved my compilers exam
@ancyrose61338 жыл бұрын
thanq so much ....it helped me for my semester exam
@mayankkataria78299 жыл бұрын
Sir i have a doubt at 17:30 in video we have a final item in i1 also so why didnt we write r1 r1 r1 under a b $ in the i1 row.
@shariqkhan14559 жыл бұрын
+mayank kataria Buddy, the first expression is augmented (given by us). Therefore we'll accept it instead of righting r1.
@mayankkataria78299 жыл бұрын
+shariq Khan thanks brother but I already got it earlier when I further studied but thanks for your concern.
@lokeshgupta40119 жыл бұрын
you are the best..... Amazing videos
@wasikhan66694 жыл бұрын
Why we reduce number of states in LALR(1) parsing algorithm? Please answer
@haripriya939855 жыл бұрын
Great explanation sir
@radbrawler77577 жыл бұрын
Does he just changed in between of lecture?
@akshitadoad7656 жыл бұрын
hahhah i also notices thAT
@Arijitpandareet5 жыл бұрын
me too noticed
@arpitmishra83994 жыл бұрын
Was jst practicing tiktok cloth transition, dnt mind
@emremuhammetengin20852 жыл бұрын
Great explanation Thanks for helping bro
@0TheImaginary08 жыл бұрын
many thanks .. keep posting these amazing videos
@sasikirankakara27507 жыл бұрын
Awesome Sir😍😘😘😘👌🙏
@swapnilbageshwar606610 жыл бұрын
dis is what i wating for..
@deepakdeva29856 жыл бұрын
Tq u sooooo much sir..... It is very clear. Hope for more new viedos