Collection of videos perfectly explained. I am an erasmus student in Italy where I don't understand the language and thanks to this video you are saving me. Thank you so much for sharing your wisdom and showing how it works.
Is the CLR and LALR parsing input string same method as this one ? (I know the differences in the parsing table about the reduce actions etc) but I mean the table with the stack for parsing the string? Same thing as this one ?
Number of terminals and non-terminals at R.H.S is length. So for F->id, number of terminals and non-terminals at R.H.S is 1, so length is 1. In E->E+T, number of terminals is 3 (E, +, T), so length is 3.
Constructive criticism please, very bad doesn't add jack shit to the quality of the videos. She explained the algorithm in a clear way and step by step.
this video saved my final compiler exam, thank you so much for spreading the knowledge. Cheers from Brazil.
❤
Collection of videos perfectly explained.
I am an erasmus student in Italy where I don't understand the language and thanks to this video you are saving me.
Thank you so much for sharing your wisdom and showing how it works.
I don't see High quality video, because the quality option is unavailable for this video
Hats off, the only video in yt which shows SLR-1 String Parsing ❤
the perfect tutorial ever keep up the good work!!
Thanks 🙏 for a good videos please keep making it’s really helping us a lot thanks 🤩
Incredible explanation, apreciate it!
Seriously...hats off mam. Explanation is so clear. Keep growing 👏
You described this topic very well, thanks for this ❤
aisi quality me samjh kaise aa rha tumhe 🥲🥲
omg you're amazing! you saved my final compiler exam! god bless you ❤❤
Ma Sha allah your teaching methods is outstanding ❤❤❤
Very clear and detailed explanation Maam.Thanks for the video Maam.
Perfect video for the topic 👍🏻
Thanks a lot for the video!
thank you so much, was having trouble understanding this but thanks to this series of videos my doubts are cleared
Thanku so much for your explanation it's saved me from many confusions
Is the CLR and LALR parsing input string same method as this one ? (I know the differences in the parsing table about the reduce actions etc) but I mean the table with the stack for parsing the string?
Same thing as this one ?
Great epxlaination!
Thanks from Ethiopia.
Like Crystal Clear Thank You soo much myam🇳🇵❤️
you are the goat
Thanks for video
mam in follow functions do we need to remove left recursion right?
Very nice explaination Aunty g
thank u for the video : )
Best explanation mam❤
mam can you explain this question : Show the movesmase by the parser 3*5+4n ? Please explain
Thank you madam, this video helped me...
thank you
Thank you so much
Thank you so much ❤️
Thank you so much mam. It is very useful.
😍❤
how can we take the string i.e,id*id+id
How taken the length
thank u
Thank you so so so much🤲👍
should'nt be the input id*(id+id)????? plz answer
Thank u very much
Is the video quality downgraded ???
Download the video then it get clear
thank you mam.
Thank u ma'am
Hi GL4. We meet again.
Mam plz quality unavailable ahe available kara na plz
@3.33 why it should multiple with 2? Can anyone explain
Same doubt ,did you get it?
Because while pushing to the stack, we push 2 elements at a time. One from the input string and the other from the action/goto table.
6 & T is 9 therefore 6T9
Mam ye length kaise pta chl rhi h
Same question
Number of terminals and non-terminals at R.H.S is length. So for F->id, number of terminals and non-terminals at R.H.S is 1, so length is 1. In E->E+T, number of terminals is 3 (E, +, T), so length is 3.
nhbk!
The video is blurry
Teacher can't see 😢
Mam Hindi me define karo
🏌️like if u have tomorrow cd exam 😂
Day after tomorrow 😅
very bad explanation
Constructive criticism please, very bad doesn't add jack shit to the quality of the videos. She explained the algorithm in a clear way and step by step.
Why quality of the video is bad?🫥
Thank you so much
Thanks mam