I have my Compiler design exam tomorrow morning, and I am watching this video in the midnight. You really saved my exam. Thank you so much for the video.
madam, the production E->E.+T is presented at goto(I0, E), so when we create the parse table, there are 2 shifts from 4 to E, is it conflict? Please check the table again because it may not correct.
It's so ironic that books about parsing grammars (language) are hard to understand. Those authors should learn how to write better that people can easily understand them. Thanks for this video.
lr(0) is without lookahead so the reduce action is entered in the entire row not only in the follow of the nonterminal. so there are grammars that can't be parsed with lr(0) but can be done with slr(1). but not all context free grammars can be parsed with slr(1). only lr(1) is able to do so, but lr(1) is much more complicated and the table is quickly getting quiet big so in most cases you don't want to do lr(1) by hand:)
I have my Compiler design exam tomorrow morning, and I am watching this video in the midnight. You really saved my exam. Thank you so much for the video.
omg you're amazing! you saved my final compiler exam! god bless you ❤❤
You cleared all of my doubts in SLR parsar. You explained very well. Thank you soo much mam
Yes mam
Thank you for such a very good demonstration.
Obrigado Anita!!!!!
We have a simp in the comments
Thank you sooo much u saved me from putting arear in compiler design❤️❤️❤️
all your videos are helpful to me to understand and complete university exam successfully , Thank u
Thanks a lot madam....really fantastic explaination....🙏🙏
Hello Anita R, thanks for this well explained video !!!!!!!!
your videos are very helpful for us to crack university exams.....at anna university . Thank you mam
Yes
So well explained 🤗👍
Thank you ma’am I finally understood it now
This video was very helpful! Thank you!
Awesome tq for the explanation 😎🔥🔥
Super mam Thank you so much mam
This top I see lot day but can't understand the topic but this video I understand the topi🎉
Really helpful and excellent explanation
Thank you for ur brief explanation I wanna ask u is epsilon included in the parsing table of SLR(0) and LALR(1)
madam, the production E->E.+T is presented at goto(I0, E), so when we create the parse table, there are 2 shifts from 4 to E, is it conflict? Please check the table again because it may not correct.
Great video
TQ so much for your efforts madam
Thanks for this explanations
Helpful !
Thank uh
Thanks alot ma’am
Ma'am one doubt...
I2 me T->T.*F phle se h to use I6 me likhne ki kya zarurat??
THANKS A LOT MADAM
excellent thank you mam
In this, can we does not need to remove left recursion ?
Mam...we can't see end of the table ..we can only see the table untill state row number 8..so consider this problm in upcoming vidoes mam ✨
Itna dimaag toh ,laga hih sakte ho🙃
ONE QUESTION HOW CAN U FIND FIRST AN FOLLOW OF A GRAMMAR WHICH IS HAVING LEFT RECURSION ,IT IS IMPOSSIBLE SO THE TABLE IS WRONG I GUESS
Thank you so much mam 🙏
mam...should'nt we eliminate left recursion for finding first and follow???
Thankyou so much❣
Paaaaraaansthiisiiiiss 🎉
❤❤❤❤from algeria 🇩🇿
It's so ironic that books about parsing grammars (language) are hard to understand. Those authors should learn how to write better that people can easily understand them. Thanks for this video.
mam according to grammer it is left recursive shouldn"t we need to eliminate left recursion grammer
Thanks 👍
For the goto state 6, isnt T reduced in two states 9, and 2?? yet you ignored the T that was reduced in 2, why?
Thank you
yeeeeeeeeee s =)
Tq mam for teaching
Thanku so much mam
Why left recursion not removed
Solid 50 Marks question
True that
thanks for real
thanks mam
Are you saying S or yes? because in 5:45 you said S
Any book to refer?
Maam whats different lr(0) and slr table both are same
lr(0) is without lookahead so the reduce action is entered in the entire row not only in the follow of the nonterminal. so there are grammars that can't be parsed with lr(0) but can be done with slr(1). but not all context free grammars can be parsed with slr(1). only lr(1) is able to do so, but lr(1) is much more complicated and the table is quickly getting quiet big so in most cases you don't want to do lr(1) by hand:)
in short you get less shift/reduce overlap errors in slr(1) than in lr(0)
DFA construction cheppaledu mam
Any #svecw students here?
oper sy hath to hata dia kro page k
08:04 why not the answer as 1 instead 8!?
Because it got shifted in state 8
🏴☠️🎃
y wasn't id added for follow(f)
1.10 u speak Tamil
Hello Ma'am, the grammar is not a context free so to find out follow we must make grammar as a CFG
Please correct me, if I am wrong
Yes mam
Kya ajjaab questions hai ye 😢😢😢
i couldn't view the table properly. kindly keep the camera fit
In hindi
Great video
Thanks a lot madam