Hi Gabbar... hope you are doing good. I had written to you about the changes you brought in my life, I hope you remember and now I am back again preparing for GATE 2015. In 2013 I had attended your SILK CN class but we couldn't complete as you hadn't come back, but this time I am sure these videos will suffice all the needs.. Thanks a lot. You are doing a real great job...
Your statement is true for the students of Dhaka, Bangladesh as well. Such a huge voluntary self less job done by Sir Ravindra jee. Upar waley unhe hamesha iss dunya mein kamiyaab karein.
I don't have any words in my mind to say thank you .... This video lecture is awesome. I didn't understand Programming language translator in Six months but Now i understood in One day , Thanks A lot sir :)
u r wy of teaching is excellent sir, thank u so much sir i am also a faculty bt in only one thing i am giving respect to u , that is u r teaching sir excellent sir
you are amazing sir ..one day . this subject was very complicated for me but now this becomes easier for me...after watching your video....i thought that i will surely clear this paper...u r a life saver sir......
A simply amazing explaination with great examples. The examples clear all doubts. One thing I would suggest to the viewers is to try to figure out the associativity of subtraction. Great Work!
Thank you very much for making this video .... it is really worhful for us and a great understanding about compiler design . definitely ,it made me to learn compiler design in easy and convenient way .....
neatly explained..... thank u so much instead of writing compiler design lecture 01 on it write topic name as structure of compiler for second lecture lexical analyser it is easy for us to select topic..
22:24 try to focus on production of 'E' those who didn't understand precedence of + equals precedence of * . 'E' is having 3 productions and hence at the same level .
I watched it once, just knew operator farther from start has highest precedence.... Watched it again, knew identification of ambiguous grammer, conversion to unambiguous grammer, identification of precedence order of operators, left and right associativity, why the method works through parse tree....
How about parenthesis?? If I want to add a parenthesis rule, which has the highest priority, without ambiguity into the very first example in this vid, should i write something like: A -> A + B | B B -> B * C | C C -> ( A ) | T T -> id Or, for the third rule, A -> A + B | A + (A) | B B -> B * T | T T -> id But I'm not sure whether this is UNAMBIGUOUS or not. Please someone help me out!
only for plus(+) associativity does not matter. but still (+) is left associative. + < * if we take care of two things viz. associativity & precedence . then grammar can be made unambiguous associativity - recursion precedence - level
Sir ur lectures are very nice and very informative , kindly tell ur video recorder person to not move the focus that much , as it is disturbing , kindly fix it to one place .
I think you missed something in the boolean grammar example - In the portion for the logical NOT you forgot to include the possibility of !(bool) in it.
how do i deal with problems where arithmetic operators aren't there? How do you come up with a string that is used to design parse trees to check the grammar's ambiguity?
sir your content is awesome but there is a problem in recording the vedio because the camera man is not focusing accordingly so sometimes i was unable to recognise what you are talking about thats it
How to make the following grammar unambiguous? I am new to this concept and I don't know how to fix this ambiguity with the way you are trying to explain since there are no mathematical operator on here. Please help. Thank you. -> | -> := -> if then | if then else
Sir, please give me the answer for this: L -> E|L ',' L E -> E'+'|E'|^'E|'x' a. show that the above grammars L and E are both ambiguous. b. Rewrite the grammars for L and E so that they parse the same language (set of strings) but are unambiguous. The operator '+' must be left associative and of lower precedence than '|^' , which must be right associative. The choice of associativity for ',' does not matter.
(examples of Boolean expression and after that )How can you say it is left associative, because when I draw it's parse tree I found it being right associative since right operations evaluate first
I watched many lectures but not as incredible as this. I admire your work. Our country needs more teachers like you. Respect...
Life saver.I had no idea what was going on in the class at all.
His explanation is simple and beautiful 🌸💐
Thank you!
Not all heroes wear capes. (you're a true life saver sir (; _ ;) )
Hi Gabbar... hope you are doing good. I had written to you about the changes you brought in my life, I hope you remember and now I am back again preparing for GATE 2015. In 2013 I had attended your SILK CN class but we couldn't complete as you hadn't come back, but this time I am sure these videos will suffice all the needs.. Thanks a lot. You are doing a real great job...
i passed in compiler design (WBUT) after watching u r video ............ before watching u r video i don't know abc of compiler design
+Naveen Kumar I have my exam tomorrow and watching them now :D
And even I don't know abc of compiler design
Your statement is true for the students of Dhaka, Bangladesh as well. Such a huge voluntary self less job done by Sir Ravindra jee. Upar waley unhe hamesha iss dunya mein kamiyaab karein.
There are a good amount of viewers who watch these videos just a day before exam... 😉
Same here my exam is on 15 nov. And only sir can save me.☺️☺️
I don't have any words in my mind to say thank you .... This video lecture is awesome. I didn't understand Programming language translator in Six months but Now i understood in One day , Thanks A lot sir :)
u r wy of teaching is excellent sir, thank u so much sir i am also a faculty bt in only one thing i am giving respect to u , that is u r teaching sir excellent sir
I learnt more from this channel than my college lectures. Thank you sir.
Well done. Your explanation is concise and easy to understand. Thank you.
Great Work and i really admire your Hard Work on these Tutorials. Thank You
Mr Ravula. Please keep up this work. Its really helpful to all your online students. God Bless u
Sir your teaching style is awesome. Because of your level of explanation, students get interest in subject.
you are amazing sir ..one day . this subject was very complicated for me but now this becomes easier for me...after watching your video....i thought that i will surely clear this paper...u r a life saver sir......
sir,you are really mind blowing, i used to really hate this subject,but you lit a candle in my mind, that now i can master this subject. thanku sir.
u r work is much APPRECIATED..................... thank u so much sir
My teacher told me removing ambiguity is hit and trial method...I suggest my teacher to watch this video.
Compiler taught as never before by RBR sir.
Bro can you tell me mvbt meaning❓
@@entertainmentmedia9573 dm
Sir, your lectures are excellent. Keep up the good work.
i got highest marks in subject which is learned by your lecture great sir thank you
glad I found your channel two months before the exam. I'll be a pro at this by that time :D
Even today it's useful, and always be in the future!
A simply amazing explaination with great examples. The examples clear all doubts. One thing I would suggest to the viewers is to try to figure out the associativity of subtraction. Great Work!
128 DISLIKES MUST BE FROM FACULTIES WHO ARE JEALOUS OF HIM :p
🤣👌
On 17th May,2021 it is 161..Lol
and now dislike button is removed
I am non cs background and i understand a lot from these videos.. great work>>> appreciable
You're a legend.Period.
Excellent sir!!! Very Helpful...Thanks😊
I really appreciate your videos. I am watching lecture and have no idea what is going on and immediately refer back to your videos
Your way of teaching is too good...Your lectures helped me alot in preparing my exam
Deserves Appreciation!
this reminds me of inception somehow
wonderful !!
I have compiler exam tmr , this help me a lot thx :)
Watched many videos for nielit exam. Purchase a course. But cant understand the actual topic.thank u so much for such a wonderful lesson
thanks for all your upload. I was lucky finally finding it
Thank you very much for making this video ....
it is really worhful for us and a great understanding about compiler design .
definitely ,it made me to learn compiler design in easy and convenient way .....
Thank you Sir, your videos are incredible!
Thanks! Real good work. Much appreciated
Thank you for this. Big big help
What a beast! Thank you
lots and loads of appreciations to u sir.. Go ahead... pakka lectures...
This is the only indian lecture I upvoted...
What a teaching with no hesitation..
Sir u are great nd genius too.. Thanks for this video
Thank u sur....nice explanation, best understanding!!!!
Thanks for the videos, very helpful
Youre a fantastic teacher
a great explnation that is precise and to the point !
Respect!
neatly explained.....
thank u so much
instead of writing compiler design lecture 01 on it write topic name as structure of compiler
for second lecture lexical analyser
it is easy for us to select topic..
The best video on this topic! 💙💥
Nicely explained. Thank you very much.
His English is a little hard to understand, but once you do, he's wonderful.
God bless you sir
Mirza Hammad Fareed semester*
it is clear and will be very helpful if u provide with some notes of what ur teaching
very Helpful sir
22:24 try to focus on production of 'E' those who didn't understand precedence of + equals precedence of * . 'E' is having 3 productions and hence at the same level .
Perfect teacher!!!
Thanks a lot sir
Lear some thing new today
you are legen wait for it.. dary
u r legendary.
really great! I have started learning compiler If u don't mind add details regarding absolute code and relocatable code in lec 1 thank u söoo much
Superb expalnation...👍👍
Thank you from C.E. Batch 2014, Kathmandu University , Nepal
Wow mate.. Hello from Kathmandu University :D
Thank you from Kathmandu University C.E 14 :D
Thanks from CE 14 from me too mate :)
I'll surely need the full course soon.
Excellent lectures sir
Change speed to 1.25 and thank me later! Great tuts!
hhhhh Thanks for the tip
lol thanks
X2 if you want to be smarter !
I watched it once, just knew operator farther from start has highest precedence.... Watched it again, knew identification of ambiguous grammer, conversion to unambiguous grammer, identification of precedence order of operators, left and right associativity, why the method works through parse tree....
And for revision change it to 2x 😂
Thank You so much sir. you are the great. Your videos are very very much helpful to much thanks😊. God blessed you.
Excellent one!!
Great lecture and lecturer
Sir thanks for putting the advertisement at the end
This video will always remain even after I die
How about parenthesis??
If I want to add a parenthesis rule, which has the highest priority, without ambiguity into the very first example in this vid, should i write something like:
A -> A + B | B
B -> B * C | C
C -> ( A ) | T
T -> id
Or, for the third rule,
A -> A + B | A + (A) | B
B -> B * T | T
T -> id
But I'm not sure whether this is UNAMBIGUOUS or not.
Please someone help me out!
Gods first video 🎉🎉🎉
only for plus(+) associativity does not matter. but still (+) is left associative.
+ < *
if we take care of two things viz. associativity & precedence . then grammar can be made unambiguous
associativity - recursion
precedence - level
very good lectures
Sir ur lectures are very nice and very informative , kindly tell ur video recorder person to not move the focus that much , as it is disturbing , kindly fix it to one place .
your teaching is perfect and I can easily understood
thank you very much for your effort is it possible to know if a context-free grammar ambiguous
or not without going to check any string belongs to
Awesome!
I think you missed something in the boolean grammar example - In the portion for the logical NOT
you forgot to include the possibility of !(bool) in it.
In these videos sir looks like sunil Shetty (younger sunil Shetty) U looks somewhat like models when you are in shape 😁
Too nice explanation
how do i deal with problems where arithmetic operators aren't there? How do you come up with a string that is used to design parse trees to check the grammar's ambiguity?
Not every ambiguous grammar can be converted into unambiguous.
God of TOC
GOD OF CD
You are great sir 😊
no comparison of Ur hard work sir.thank u sir.
Thank you..
thank you very clear
sir plz upload dbms video
Sir if i can watch your videos only then it is sufficient for gate or i need some watch another video please reply
really great video
Sir, from where I can practice gate questions related to this topic?
sir your content is awesome but there is a problem in recording the vedio because the camera man is not focusing accordingly so sometimes i was unable to recognise what you are talking about thats it
What do we need to do to see all your videos, sir, to be fully prepared for the gate?
How to make the following grammar unambiguous? I am new to this concept and I don't know how to fix this ambiguity with the way you are trying to explain since there are no mathematical operator on here. Please help. Thank you.
-> |
-> :=
-> if then | if then else
Very nice
very good explanation.
You are amazing !!
Sir, please give me the answer for this:
L -> E|L ',' L
E -> E'+'|E'|^'E|'x'
a. show that the above grammars L and E are both ambiguous.
b. Rewrite the grammars for L and E so that they parse the same language (set of strings) but are unambiguous. The operator '+' must be left associative and of lower precedence than '|^' , which must be right associative. The choice of associativity for ',' does not matter.
Superb Sir.
(examples of Boolean expression and after that )How can you say it is left associative, because when I draw it's parse tree I found it being right associative since right operations evaluate first
But even in the case of subtraction ambiguity should not matter right....even if there is + and -