Lecture 13 How to remove Left Recursion in Compiler Design

[@rkbansal8848]

Great brother , true teaching
This is conceptual knowledge
Even Big professors don't have this knowledge 👍🏻👍🏻👍🏻

[@meenudhamija4455]

Explained in Amazing way... All videos are beneficial from Competitive exams as well..

[@ankitabiswal6747]

Thank u sooo soooo much ......I was confused and stressed as helll😢😢😢 after seeing this ...u make this sooo easy and understandable ......❤❤❤❤ May God bless you🎉🎉

[@sdansari7541]

Great Work!❤

[@samtasharmarollno.-1522]

Your explanation way is very simple...it help me a lot to remove L.R

[@Zenox8512]

best video of leftt recursion

[@codelikeapro9724]

thank you brother i actually love to learn concept in deep... i was amazed that everyone use A' in their video but no one was explanning what is it nd how it comes! but thanks to you now i know from where we get this formula and meaning of A'!

[@fabforever1319]

thanks for the video its helping me alot to prepare for exams.

[@saptarshichattopadhyay8234]

Thank you so much 💓 💗... 💗 💛

[@nitishchoudhary9049]

Thanks for the videos on Compiler Design.

[@_glock_69_]

You should post your notes in description that would be very helpful

[@shuvamsahoo1130]

Superv❤✨

[@devmahad]

Done thanks :)

[@saimrudula2140]

Very nice explanation.

[@andromedagalaxy1266]

Awesome sir

[@mounikasettigari9741]

Thank you 😄

[@muhammadmuneebiftikhar]

shukria bhaiya, mjy achy sa s nr

[@farha5595]

buhat badiya bro

[@khalakyaraa1025]

thanks

[@akshitmangotra5370]

OP bhai..

[@the-iter8]

Bro you just tell that this is the answer but you don't tell us the way to get to that answer, What exactly is the thinking process behind getting Epsilon out of nowhere in an equation? How one can truly know that?

[@namanagarwal7521]

What how? The solution to the last question does not result in the same solutions. Also, parse tree ka yield bhi pura alag are!!!
Kuch bhi!?!?

[@Osthir_Gaming]

But to make ambiguous grammar to unambiguous grammar, for left associative you make left recursion. If top down parser doesn't take left recursion then why you make left recursion to transform ambiguous to unambiguous, if it is not possible to accept by parser?

[@prashantpandey9051]

jbr10st sir ji

[@anilterapalli3894]

Aur ek bar dekhna padega is video ko

[@gugugaagaga]

mid sem tak heen tha :)

[@rehanakhatoon1369]

Can u please provide pdf of your notes?

[@shyamgupta5519]

B->Bb/eipsoln
Can anybody tell how to eliminate left recursion from above equation

[@nirajjain8099]

Bhaiya y waala kese solve hoga explain ker k bta do
A → AcB | cC |C
B → bB| id
C→CaB |BbB |B.

[@brightbuddies1722]

Please provide notes also

[@shivarajpatil8699]

7:00

[@PriyanshuNagar-z4r]

Bro quality change ni hori

[@nirajjain8099]

And this one also
S → Aalb
A → Ac | Sd | E

[@uwu-57]

🐱

[@gayatribarnwal597]

add some music to your video....low volume little music is good

[@Pkeen]

too fast!

[@grandit5085]

Kam ki baat nehi karte ho app

[@nizamfarooqui5950]

Baato k liye toh aap ho baaki sir toh bht bdiya padhate hai ✨❤️

[@suchitathakur5913]

Thank you 😁

[@ishajangid1083]

plzz provide the notes also