Thank you so much! Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
Love from Pakistan. Made my software engineering journey so much easier. You have the ability to simply explain the most complex logics. More power to you
The ANSWER of the HOMEWORK QUESTION is YES as C-L-R (1) PARSER can work on AMBIGUOUS GRAMMER but still it suffers from collision due to SHIFT-SHIFT & SHIFT-REDUCE.
Glad you enjoyed it😍Keep learning & stay connected, we are working on completing the syllabus here itself.👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
follow () toh I-2 pe same hi hai I-6 k taarha sab k sab $ , due to the first occurrance of "C", toh phir nhi CLOSURE lene ka kyu jorrut tha , please explain.
In I6, First production is , C -> c.C, $. Then shouldn't the follow for the next two productions in I6 be c/d instead of $. Hence, I6: C -> c.C, $ C -> .cC, c/d C -> .d, c/d HELP!!!!
No it doesn't work like that. Here the follow of every production is equal to the follow of the symbol because of which it was considered in the state( follow of the symbol after . ).
For complete Compiler Design, check out this video: ua-cam.com/video/OQCjakjCJu4/v-deo.html
best playlist for compiler design on YT....
Thank you so much! Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
Legendary in playback speed at 2x and even understood.....
Tysm Sir for that's playlist 💫
Best teachers students ko online hi milte h but offline nhi😂
Thank you so much dear @Shivani❤ Keep learning & supporting! Stay connected for more amazing contents & videos 👍
Love from Pakistan. Made my software engineering journey so much easier. You have the ability to simply explain the most complex logics. More power to you
Thanks a lot dear @Kinza for your valuable feedback & kind words❤Keep learning & supporting! Stay connected for more amazing contents & videos 👍
More POWER to INDIA & SANCHIT sir. PAKISTAN murdabad.
@@soumyadeepbarik5711sudharjaa padha likhaa gawar
Amazing explanation sir. Thank you for teaching all of us in this beautiful way ❤
You're most welcome, Abhishek. Keep learning, supporting & stay connected for more upcoming content👍
sir LR and Aap bhut powerful ho :) all the best for ur channel sir i subscribed from 2 accounts
Thanks a lot dear @suku ❤ Keep supporting & stay tuned for more amazing contents & upcoming videos 👍😊
The ANSWER of the HOMEWORK QUESTION is YES as C-L-R (1) PARSER can work on AMBIGUOUS GRAMMER but still it suffers from collision due to SHIFT-SHIFT & SHIFT-REDUCE.
Love the videos sir!! You are amazing!! Thank you so much for this content. Please complete the syllabus soon.
Glad you enjoyed it😍Keep learning & stay connected, we are working on completing the syllabus here itself.👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
aanand aagya sir
Thanks a lot dear @Ratnesh❤ Keep learning & supporting! Stay connected for more amazing videos & contents 👍
thank you for the concept sir ...kept the hardwork is the
You're welcome Aditya, keep learning & stay connected for more amazing videos & contents👍😊
thank you sir for the amazing video . yes, clr (1) is the most powerful parser.
You are most welcome @Bishesh, keep learning & stay connected for more content.
Or sir item number 4 ke D m apne r4 likha hai waha r3 ayega na?
Ans : Yes CLR (1) is More Powerful
Love the videos sir!! You are amazing!! Thank you so much for this content
My pleasure!
Pehli waali EXAMPLE k aandaar dusre waale "C" k first() k SET mein "d" kaise include ho gya please explain.
thank you, sir.
You're welcome, Prashant. Keep learning, supporting & stay connected for more upcoming content👍
if a grammar having left recursion can we Parse the grammar under CLR.
Love you sir
Thanks dear❤ Keep supporting, stay blessed👍😊
19:50 Sir aapne koi glti nhi ki.. meine glti ki ki pehle apke channel se nhi dekha ye topics 🥲
Do follow all our content & keep learning👍😊
follow () toh I-2 pe same hi hai I-6 k taarha sab k sab $ , due to the first occurrance of "C", toh phir nhi CLOSURE lene ka kyu jorrut tha , please explain.
Sir table m entry galti fill ki hai kya item 9 ki ? Waha shayd R1 ayega na
BEST BEST BEST😇
Thank you @Gauri❤ Keep learning & supporting! Stay connected for more amazing contents & videos 👍
13:43 funny op!!!
In I6, First production is , C -> c.C, $. Then shouldn't the follow for the next two productions in I6 be c/d instead of $.
Hence, I6:
C -> c.C, $
C -> .cC, c/d
C -> .d, c/d
HELP!!!!
No it doesn't work like that. Here the follow of every production is equal to the follow of the symbol because of which it was considered in the state( follow of the symbol after . ).
Homework abs Yes
Yha tak phunch gye😅