How to Check a Grammar is LL(1) or not | Compiler Design

[@sahilanand30]

Best playlist for compiler on internet

[@mukuls11]

highly beneficial video for academics as well as for competitive

[@THEGATEHUB]

Thanks Mukul

[@rohit-qx8jn]

best video series for compiler

[@THEGATEHUB]

Thanks a lot for your appreciation.. Please share my Vedios with your friends.. For further communication you can contact me at instagram..

[@somnathtiwari186]

We Getting the best in the lockdown great sir

[@vaibhavdixit5133]

Excellent explanation
Superb
Please aap issi tehreh best videos bante rahiye sir ji
Your explaination is best and unique no one in this universe can teach as best as you teach sir ji
In short you are god gifted teaching skills

[@THEGATEHUB]

Thanks and sure

[@debaduttanayak9185]

You are a amazing teacher you save us from failing in exam

[@softtecheducation]

Superb excellent 👌👌 way of presentation 👌👍

[@THEGATEHUB]

Thanks for your appreciation...

[@farazjawaid2982]

great one !!!!
💯

[@manojbhat1440]

Nice video. Please make playlist on other topic also

[@balkrishnabharti5020]

sir,suppose if we have given a grammer and there is ambiguity and left recursion ,and if we remove it then can we say it is LL(1) ??

[@chiranjitdey1430]

Great video and explanation sir. Just 1 question?
If the rules written are followed by the grammar, then it is not a LL(1) grammar, am I right?

[@THEGATEHUB]

Yes.. You are absolutely right..

[@Alics_Ali]

Best place to clear CS exam in University

[@swarajghadage2087]

Check following grammar is LL(1) grammar or not?
S->BC|AB, A->aAa| ε, B->bAa, c-> ε
Plese solve it

[@moulikjindal9869]

🫡🫡🫡