Lec-9: How to Check a Grammar is LL(1) or Not | Short Trick

  Рет қаралды 599,077

Gate Smashers

Gate Smashers

Күн бұрын

Пікірлер: 127
@keshavbansal5148
@keshavbansal5148 3 жыл бұрын
Sir, for my 6th semester, I am following your AI, CD, CN and OS series. Don't think i need to look for any other lecture series. You are really doing a great service to Engineering students and GATE aspirants.
@ianku
@ianku 2 жыл бұрын
bruh !!!!❤️
@asianguy86
@asianguy86 9 ай бұрын
Bhai ab tere kitne bachche ho gye hai
@SteveRogers-k6f
@SteveRogers-k6f 7 ай бұрын
7 - thala for a reason , bole Jo koyel
@anjali35
@anjali35 7 ай бұрын
Thank you sir, , apne to meri fear par maat kardi.. job ki wajah se me external clg karti hu, your all videos helps me a lot❤ really thanks again
@kanakyadav2498
@kanakyadav2498 3 жыл бұрын
So, finally i got a one stop solution of my compiler design examination. Firstly, due to this pandemic, neither we could avail the books nor there were proper video lectures available on youtube to help me out in this subject. One of my friend suggested me this channel and surprisingly, watching the first video of this video series, made me realize that its going to be enough for my complete subject. The way this teacher has explained the concepts, his clear understanding as well as the clear vocalization of the subject had a huge impact. No doubt, this is the best of the series, i have ever watched in terms of Engineering subjects. No words to express my gratitude. Students like me who love to reach in depth of a subject, you have given a one stop solution. I cannot stop ravishing and thanking you "SIR"🤩. God bless😇
@thaloothkhalid5631
@thaloothkhalid5631 3 жыл бұрын
Thank you sir for taking time dedicating yourself to teach needy strangers like us. Hope you will achieve all your dreams some day.
@sravanthisampara
@sravanthisampara 3 жыл бұрын
Your doing and amazing social services sir! Huge respect to the whole team of gate smashers! Your respected by many engg students!
@takwirultayasur1944
@takwirultayasur1944 3 жыл бұрын
😂😂😂1:53 Then leave u can't do it.In simple words....U are too Good May Allah bless u.
@1511kanika
@1511kanika 4 жыл бұрын
'Compilers Made Easy''... thankyou Sir
@shashidharnagaral103
@shashidharnagaral103 3 жыл бұрын
3:00 We can't say whether a production A->B is empty or not directly, for that we should find the FIRST(B), if it's empty then we will check FOLLOW(A) else we will consider FIRST(B) only.
@ashishhiwale6482
@ashishhiwale6482 4 жыл бұрын
short cut technique is pretty good I solved with it only....sir please bring videos of compiler design in a continuous manner it's helping a lot.
@shibezoid12
@shibezoid12 5 ай бұрын
This man is the messiah for engineering students love your way of teaching
@meenakumar8779
@meenakumar8779 2 жыл бұрын
1M karwa do sir ke jaldi se bcs he provides us qualitive content.
@PRIYAR-pi8ll
@PRIYAR-pi8ll Жыл бұрын
Consider the following S->iEtS/iEtSeS/a E->b Is LL(1) or not
@dikshakumari1627
@dikshakumari1627 4 жыл бұрын
sir your explanation is perfect
@iramsaleem8557
@iramsaleem8557 9 ай бұрын
Sir g tussi great o 👌👌your teaching method is so good Allah bless you and gives you many more success (Ameen)🤲
@muneebahmed5579
@muneebahmed5579 2 жыл бұрын
we even were taught this as a single lecture in university and now I got to know that this is a short trick we were told there is another method to solve and it is important
@shariulekab
@shariulekab 4 жыл бұрын
You are my best teacher.
@Swaroop_Rath
@Swaroop_Rath 4 жыл бұрын
First viewer. Thank u so much bringing the most informative video. We are forever grateful to you sir 😇
@Patitapaban_sahoo
@Patitapaban_sahoo 2 жыл бұрын
Today I was 6th sem compile design exam and in 16 mark there was ll(1) Pershing table question with given check a input string . And I have done that properly . Thank you 👍
@subhrasmitagouda4275
@subhrasmitagouda4275 4 жыл бұрын
Sir ur explanation are asm ..sir plz upload rest videos also total syllabus of gate 😊#god bless u ,u r really helping a lot of people
@alnoidshankar4742
@alnoidshankar4742 4 жыл бұрын
Nice trick, thank you sir.
@mohitzen
@mohitzen Жыл бұрын
Best video for LL(1) 🎉
@bhagwatdhavale6091
@bhagwatdhavale6091 4 жыл бұрын
Ek number Fadu tricks 😍😍😍😍😎
@GoogleUser-nx3wp
@GoogleUser-nx3wp Жыл бұрын
Kya bat hai Smasher bhai
@my_brain_trembles
@my_brain_trembles 3 жыл бұрын
Its more like common sense than short trick if you have watched sir's previous video.
@crazenxankush
@crazenxankush 4 жыл бұрын
You are Great sir....🙏
@mohanmanju7671
@mohanmanju7671 3 жыл бұрын
Great Explanation Sir.
@rashmikanaik1933
@rashmikanaik1933 3 жыл бұрын
Thank you sir ur teaching is helping us alot💯✔️
@ratnakantahanse2661
@ratnakantahanse2661 3 жыл бұрын
Thank you sir ❤️❤️❤️ may GOD BLESS YOU SIR ❤️❤️❤️...
@sahilgupta5546
@sahilgupta5546 10 ай бұрын
Sir textbook se ghanto ke baad bhi nahi samajh aya tha. Thank you very much!
@SureGATESuccess
@SureGATESuccess 4 жыл бұрын
Brilliant explanation ❤️
@Aditya95111
@Aditya95111 4 жыл бұрын
Awesome video ❤️💕🙏 Sir please upload video on Left recursive, right recursive, LMD, RMD ambiguous , Unambiguous grammar Please please sir .
@ishitvaverma7381
@ishitvaverma7381 3 жыл бұрын
Check Ravindra Babu ravula's lecture you'll find these topics clearly explained
@jesusholyworshipofficial6224
@jesusholyworshipofficial6224 4 жыл бұрын
Sir your explanation super Please explain the CLR(1) parser
@laibakhan6415
@laibakhan6415 3 жыл бұрын
Superb 👏👏👏👏👏 world best teacher😍
@anjaliratanpara3339
@anjaliratanpara3339 4 жыл бұрын
Thank you so much sir for ur all videos... Just amazing Technics sir👍
@bhujasri8639
@bhujasri8639 4 жыл бұрын
Thank you so much🙏🙏🙏
@mahpara8171
@mahpara8171 4 жыл бұрын
Thnkuuuuuu souch sirrr apky lectures bht helpful hoty ha😍😍😍😍😍😍😍
@darkuswrath1350
@darkuswrath1350 3 жыл бұрын
Sir Gate 2003 Question on parsing techniques, the grammars have both c and d as intersection still it LL(1) grammar. S ---> C C C ---> cD | d
@akabrajaved4698
@akabrajaved4698 3 жыл бұрын
sir plz short trick to check whether grammar is SLR(1) CLR(1) or LALR(1) Please sir
@amjadshaheen9262
@amjadshaheen9262 Жыл бұрын
Convert the following grammar into an equivalent LL(1) grammar and derive the LL(1) parse table: S ::= a | (b L L) L ::= L , a | b
@demonte.1205
@demonte.1205 Жыл бұрын
follow S in second example should be $ right
@chinmaynangia4482
@chinmaynangia4482 4 жыл бұрын
also to be ll1 it should not be left recursive and should not be ambiguous but we can see it is left recursive
@snehalbadole9614
@snehalbadole9614 3 жыл бұрын
Sir plz make the video for data warehousing and mobile computing
@fahadraza7152
@fahadraza7152 4 жыл бұрын
thank you so much sir for your great and easy videos
@ayushgupta8545
@ayushgupta8545 3 жыл бұрын
Fabulous Explanation👍👍
@animationcrust1993
@animationcrust1993 4 жыл бұрын
You are great sir ☺️
@krutikatrivedi9900
@krutikatrivedi9900 Жыл бұрын
sir follow of "S" ka ans hoga first of S1 right? and first of S1 me (e, epsilon) aayega na (first me to ham epsilon likh skte h apne vaha $ sign kyu use kiya h???)
@bhavyawadhwa2885
@bhavyawadhwa2885 4 ай бұрын
YES, please explain sir
@DeepaktGuptab
@DeepaktGuptab 4 жыл бұрын
Sir, plzzz make video on newly added topics of gate in compiler........its humble request🙏🙏🙏🙏??
@a-87shreyashajaychoudhary28
@a-87shreyashajaychoudhary28 2 жыл бұрын
Great explanation, thanks!
@noexcuse.i
@noexcuse.i 2 жыл бұрын
All doubt are clearly in minor thing thanks 😊 you sir
@Hemant-sv5ug
@Hemant-sv5ug 6 ай бұрын
If operators are also considered for finding first() in any given set of production rules , then at 6:06 why the operator "(" isn't picked as for the same rather than that of the "a" as a whole ?
@take_it_all_so_good
@take_it_all_so_good 4 жыл бұрын
Liked before watching.... Thank u🙏
@GateSmashers
@GateSmashers 4 жыл бұрын
Thank you so much 😀
@take_it_all_so_good
@take_it_all_so_good 4 жыл бұрын
@@GateSmashers 😇
@tamanna354
@tamanna354 Жыл бұрын
thank you so much sir🤗
@_atom_gaming_
@_atom_gaming_ 3 жыл бұрын
wow. nice trick
@lokeshyanamandra7775
@lokeshyanamandra7775 3 жыл бұрын
U r my savior sir
@meenakumar8779
@meenakumar8779 2 жыл бұрын
Cs department ko ase hi teacher lagne cahiye india me
@m.asadmemon7387
@m.asadmemon7387 3 жыл бұрын
what if there left recursion and factorization .first we have to remove it or not?
@STTPwithRajani
@STTPwithRajani 4 жыл бұрын
Thanks🙏
@srimanjunathatransport1348
@srimanjunathatransport1348 3 жыл бұрын
Thanks you Sir !!! Ur videos are very helpful...
@Rikvi22
@Rikvi22 3 жыл бұрын
Please put your title tag also in hindi... coz some people's may think it is a English lecture.
@mahpara8171
@mahpara8171 4 жыл бұрын
Sir ap webdesign k courses kab bnay gy
@sai_durga-n4h
@sai_durga-n4h 4 жыл бұрын
sir , heartly love you a lot ... dil se sallam
@MastersGaming8
@MastersGaming8 3 жыл бұрын
sir aik question hai..................aapne kaha k saari grammar k first() nikaal k dekhna hai k koi same na ho tou wo LL(1) se acceptable hai..................aapky iss se peechy waly lecture mai jo grammar thi usky first() same thay phir b wo LL(1) ne accept karli............ye kaisy hua ??
@rajeevverma1064
@rajeevverma1064 3 жыл бұрын
Thanks from AIMT college Greater Noida ♥️♥️
@vishalmahire241
@vishalmahire241 2 жыл бұрын
Sir in a grammer the first elements are the first of the garmmer
@maliksamiullah8425
@maliksamiullah8425 2 жыл бұрын
sir iss second production ka agr ham follow nikalain generally too Follow of c={t} hoga kia?
@ankitpaudel8901
@ankitpaudel8901 4 жыл бұрын
sir with due respect at 7:45 when we are finding follow of S1 so nothing is there after S1 in RHS so we will go to LHS and write its First but you have find Follow of S. Why can you explain
@khalnayakg4737
@khalnayakg4737 3 жыл бұрын
Rule is that if after s1 there is null then follow os LHS will be added to follow of s1😊
@SHAHIDRAZA-do9xe
@SHAHIDRAZA-do9xe 4 жыл бұрын
Thanks sir
@zareena60
@zareena60 4 жыл бұрын
sir plz upload toc and cc important topics with explanation video before 7th for ugc net exam.
@Kai-Ming05
@Kai-Ming05 4 күн бұрын
Is this shortcut applicable for SLR(1)?
@sonuarya9106
@sonuarya9106 4 жыл бұрын
thanks sir jii
@sameer23377
@sameer23377 3 жыл бұрын
Awesome Sir💝
@malaramakrishna1710
@malaramakrishna1710 Жыл бұрын
Sir pls provide captions for all video's
@Tensor_Demand
@Tensor_Demand Жыл бұрын
in the second example isn't the first of second production is '(' ?
@purpleocean1689
@purpleocean1689 4 жыл бұрын
Ohk... Ab samjha ki first aur follow ka kya kaam hai... I was wondering when I saw those videos ki ye hum kyu padh rhe
@fahimjani1999
@fahimjani1999 2 жыл бұрын
Es playlist my total 36 videos hn ye full course hn ? Ya our videos b Ap bana k upload keraingy sir ? CC k bary my
@tajamulhassan7361
@tajamulhassan7361 3 жыл бұрын
consider the following grammar over the alphabet {b,g,h,i} : A→BCD b→bB| ε C→ Cg| g | Ch | i D→ AB| ε find followc) Answer kya aayah ga sir help plx
@shitalkarhale9490
@shitalkarhale9490 4 жыл бұрын
Sir,please makes videos on Pl/sql
@waseemss-n3u
@waseemss-n3u Жыл бұрын
LL stand for
@ganeshdawda4765
@ganeshdawda4765 4 жыл бұрын
Sir OS me IPC pe video banaiye na
@yashkhatwani3198
@yashkhatwani3198 2 жыл бұрын
Thank you
@muskansawa2802
@muskansawa2802 4 жыл бұрын
Tq guruji
@jamalahmad3378
@jamalahmad3378 4 жыл бұрын
Sir please ek video nielit scientist B ki iss sal ki expected cutoff pe laiye..
@akashatkari544
@akashatkari544 3 жыл бұрын
If grammer will be recursive then how to identify whether the grammer is LL(1) or not..?
@DharmendraKumar-zy5mz
@DharmendraKumar-zy5mz 4 жыл бұрын
sir complete videos upload karne me kitna samay lagega sir please upload as soon as possible because university exam is coming so i request to you sir please fast sir please reply i waiting to your reply thanks sir ..
@shahinparween3496
@shahinparween3496 3 жыл бұрын
Thank you sir
@henafatma5101
@henafatma5101 4 жыл бұрын
thank u sir
@asifmahmood182
@asifmahmood182 Жыл бұрын
thanks sir
@SHASHANKRUSTAGII
@SHASHANKRUSTAGII 4 жыл бұрын
SIR WHAT YOU ARE DOING IS GREAT I WANT TO BE YOUR STUDENT PLEASE ALLOW ME THANKS
@GateSmashers
@GateSmashers 4 жыл бұрын
All the best
@pragyamukherjee8243
@pragyamukherjee8243 2 жыл бұрын
Thank you so much....
@adkr3147
@adkr3147 4 жыл бұрын
Super
@minhazrabbi531
@minhazrabbi531 5 ай бұрын
S -> aSbS | bSaS | Є {a}∩{b}∩{$,b,a}=∅ // LL(1) but the grammar is not LL(1) if I do it with the parser table, what's wrong here?
@amjadshaheen9262
@amjadshaheen9262 Жыл бұрын
Given the following grammar, convert it to LL(1) form, find the necessary FIRST and FOLLOW set and create an LL(1) parse table: A ::= AB | B B ::= Bd | e
@adityavaidya6251
@adityavaidya6251 Жыл бұрын
At 1.25 speed the intro bgm feels good😅
@Raj-sz9pg
@Raj-sz9pg 3 жыл бұрын
Maja agya 🔥
@Shokeenshab007
@Shokeenshab007 4 жыл бұрын
Join kesa kra or bad m kesa classes hogi join Ka kya fayda h
@aakankshakashyap7647
@aakankshakashyap7647 4 жыл бұрын
❤❤❤👌
@youknowmyname9606
@youknowmyname9606 2 жыл бұрын
Thank you❤
@Sangeetagautam793
@Sangeetagautam793 4 жыл бұрын
Sir c++ ki class kb se hogi
@tempest7074
@tempest7074 Жыл бұрын
can someone tell me what will be the follow of S- aSa | bS | c
@devbhoomi3051
@devbhoomi3051 Жыл бұрын
Please tell me FOLLOW(S) in first question
Lec-10: What is LL(1) Parser | How it Works | Full Concept
9:27
Gate Smashers
Рет қаралды 603 М.
Long Nails 💅🏻 #shorts
00:50
Mr DegrEE
Рет қаралды 18 МЛН
Lec-7: What is Parsing & Types of Parsers | Syntax Analysis
9:38
Gate Smashers
Рет қаралды 1,1 МЛН
LL(1) Parsing - Solved Problems (Set 1)
19:47
Neso Academy
Рет қаралды 82 М.
Lec-8: LL(1) Parsing Table | Check Whether a Grammar is LL(1) or Not
10:57
LL ( 1 ) Parser | Predictive Parser 🔥🔥
36:04
Perfect Computer Engineer
Рет қаралды 127 М.