17. LL(1), LR(0) and SLR(1) parsing in single example | Canonical collection of LR(0) items
ฝัง
- เผยแพร่เมื่อ 12 ต.ค. 2019
- LL1, LR0 and SLR1 parser are explained in this video clearly with the help of canonical collection of LR(0) items. In this video of CSE concepts with Parinita Hajra, we'll see LL(1), LR(0) and SLR(1) parsing table and canonical collection of LR(0) items with the help of a single full example. We'll see how to check if any grammar is LL(1) or not, SLR(1) or not, LR(0) or not, in the compiler design. #ll1 #slr1 #lr0 #parsing #canonical #items #compiler #design #cse #cseconceptwithparinita
For the people asking me for the equipments I use.... you can buy them from the below links:
MOBILE: amzn.to/3jdmquc
LAPTOP: amzn.to/31ontBy
TRIPOD: amzn.to/2T6V3aC
MIC: amzn.to/3jl0Jss
CAMERA: amzn.to/3jmOSdr
HEADPHONES: amzn.to/2ICLPkn
POWER BANK: amzn.to/2He3crm
EARPLUGS: amzn.to/37oK5FQ
WHITE BOARD: amzn.to/35cAIq0
If you like my video contents, please LIKE, COMMENT, SUBSCRIBE and SHARE with your friends.
You can always connect with me at:
Facebook: / cseconceptswithparinita
Instagram: / computer_science_concepts
Whatsapp: chat.whatsapp.com/KH5Kb0FLpia...
Mail: parinita1995@gmail.com
Compiler design tutorials:
• Compiler Design for GA...
Theory of computation (TOC) tutorials:
• Theory of computation ...
Cryptography techniques tutorials:
• Cryptography Tutorial
Artificial Intelligence tutorials:
• AI vs ML vs DL vs data...
GATE previous year important questions:
• GATE 2023 important co...
Data Compression tutorials:
• Data Compression Tutorial
Computer networks tutorials:
• Computer Networks Tuto...
Technical job updates:
• Technical job updates
Database management system tutorials: • DBMS: Database Managem...
Data structures and Algorithms tutorials:
• Data Structure and Alg...
Programming questions:
• Programming
Digital image processing:
• Digital Image Processi...
Digital electronics:
• Digital Logic
Motivational videos:
• Motivational Video
Keep learning, keep supporting 🤝✨💯
My exam of compiler is coming and your videos are so much helpful madam🙏🙏🙏
All the best for your exam✌
Thank you so much mam 😊
Most welcome 😊 Keep learning, keep supporting ✨
Excellent explaining
Keep learning, keep supporting ✌😊
Thank you for the discussion ...
You're welcome 😊
helpful topic
Thanks for your feedback
i think for ll1 its ll1 because i think we should eliminate lefl recursion of the grammer then solve for S L and L prime
Mam in I0 we need to include all the productions with a dot at the starting of the each production...but why you haven't written it
No dear, it's not a compulsion to add ALL the productions
👏👏👏👏
😊😊😊
Ok wo baad me theek kr Lia AP ne😊
😃😃
I attempted well in exam because of this videos
Glad to hear that 😊 Keep learning, keep supporting 💯
Ma'am i'm having the same question but my question is to draw the parsing table and check for LL(1) grammar in this question. So i also have to draw the canonical form for that also... and LL(1) table can also be made using FIRST and FOLLOW. Please reply ma'am, I've my exams form next week
For only LL(1), you don't need to draw the canonical collection.
You may refer my previous video where I have explained only to check if a grammar is LL(1) or not
@@CSEconceptswithParinita ma'am how we will find the First of L in this question, I'm stuck at that part only...
@@tanmaysinghal8370 same im also stuck that how we can get L's first and follow. If anyone know plzz help
Mam why you have not written reduce under x column
did you get why?