LL ( 1 ) Parser | Predictive Parser 🔥🔥

Рет қаралды 103,506

Күн бұрын

This video is about ll 1 Parser in compiler design in hindi also called as Predictive Parser. This video tutorial explains to Check Whether a Grammar is LL(1) or Not. Two exam examples are solved in this video. This topic is from the subject System Programming and Compiler Construction.
Purchase notes right now,
more details below:
perfectcomputerengineer.teach...
System Programming & Compiler Construction Playlist:
• Playlist to System Pro...
*Mobile Computing Playlist:
• Playlist to Mobile Com...
*Digital Signal & Image Processing Playlist:
• Digital Signal & Image...
* Artificial Intelligence:
• Playlist to Artificial...
Topics covered:
1) ll 1 parser in compiler design
2) ll 1 parser example
3) ll 1 parser table
4) Check Whether a Grammar is LL(1) or Not
Timestamps:
0:00 Introduction
1:10 What is left recursion
2:00 Step 1: Removing Left Recursion
5:30 Step 2: First & Follow
10:55 Step 3: Constructing a parse table
17:40 Step 4: Stack Implementation
25:25 Step 5: Generate a Parse Tree
27:10 Problem two starts
35:10 Homework Problem
*Gears used for this KZfaq Channel:
linktr.ee/perfectcomputerengi...
*Let's connect:
Instagram: / planetojas

Пікірлер: 85

@nileshsuthar3894 Жыл бұрын

Man not gonna lie but your teaching is off the charts and your videos are very underrated they need more attention 🥺

@radheshyamvishwakarma9315 2 ай бұрын

actually in Q.3 the string should be String = mcbcgfh$ then are answer is correct implementation :-- S --->mBDh B -->cC C -->bc D -->EF E -->g F -->f

@gauravsingh8173 Ай бұрын

right

@shaziazshaikh1177 Жыл бұрын

WE NEED TEACHERS LIKE YOU. THANKS, A LOT!

@vijapuresalehavijapuresa-uu2ge 3 ай бұрын

Pehla aisa banda dekha hai jo keh raha hai aapko meri pahele ki video dekhne ki need nahi hai Hatts of you man🎉 6:12

@cypher.hiphop 2 жыл бұрын

Bro You Are Legend

@clashtm8210 4 ай бұрын

Legendary teaching style bhai aapka. Hats off to you.

@SidraZulfiquar-oy3wt 7 ай бұрын

Thank you sir..... I'm happy ..... And confusion free

@aniketprasad8201 2 жыл бұрын

Best video for understanding LL(1)

@technicalknownledge1121 Жыл бұрын

You are a legend sir, what a Explanation......

@vasulibhai5202 Жыл бұрын

Thankyou for the best explanation ❤️

@chjibrann Жыл бұрын

Sir gggg ❤‍🔥🔥🔥 iss dafa meray exam m b kuch na kuch honay wala hai 😉😄😄❤‍🔥🔥🔥

@manalibhoje1574 Жыл бұрын

Best Explanation and with step by step

@usamasaleem6538 Жыл бұрын

Thankyou Sir for you effort, Extermly helpful. ❤

@markevans4622 2 жыл бұрын

Thank you for nicely explaining 😇

@trishitajana5830 3 ай бұрын

Very easy explanation ❤ thank you so much ❤

@zaker4900 8 ай бұрын

best Explanation, love your videos

@smosamakamil6879 Жыл бұрын

thankyou so much for saving me in university exam

@aniketkumar967 Жыл бұрын

kya hi padhate ho bhaiya awesome

@somnathrakshit4503 7 ай бұрын

Sir you are the monster 🙇‍♂️

@prathamsharma7478 10 ай бұрын

Explanation was too good.

@_sarthakmisal 3 ай бұрын

Congrats for १००k

@bhagyashripatwardhan6210 2 жыл бұрын

Perfect explanation

@bhavanshipatel2091 Жыл бұрын

cant thank you enoughhh!

@Abhishekjaiswal00008 9 ай бұрын

ojas bhai ke aage koi bol skta hai kya oju bhai yeeeeee.........jai ho oju bhai ki

@PranshuSony 2 ай бұрын

Shandaarrr bhai, mjaa agya ❤

@user-mg2lh5ii2m 4 ай бұрын

Thank you so much bhaiya

@Nikam_Jayesh 10 ай бұрын

Amezing sir!🙇

@nomanjunejo7426 Жыл бұрын

You are very great teacher. God bless you!

@sambitkumarmahal2421 21 күн бұрын

Thank you so much bhai❤

@RaghavMundra6901 Жыл бұрын

youre too good brother

@udaysai1433 9 ай бұрын

Super.....broooooo.........❤❤

@daniyalarif5262 Жыл бұрын

🤩🤩🤩Awesome

@sreyakurup9204 3 ай бұрын

THANKYOUUUU G

@sameerafzalkhan6071 2 жыл бұрын

Invalid string , no production D, c in parse table Implementation: S->mBDh B->cC C->bc no further, Last stack part Dh$ Last Input part : cgfh$

@sameerafzalkhan6071 2 жыл бұрын

Ooh thank you ojas ! ✌🏻

@BariqWani-dr4oh 2 жыл бұрын

same here

@SharvilMoreOfficial 2 жыл бұрын

Same here

@ImFaiyyazz Жыл бұрын

@@sameerafzalkhan6071 Can you write the whole solution 🥲🥲

@RYZENKINGGAMING Жыл бұрын

@@ImFaiyyazz its ez bro just try it hope u got the answer

@bruh_5555 7 ай бұрын

amazing

@rockybalboa6969 Жыл бұрын

Full sapot

@prithbirajmahanta Жыл бұрын

Thank You So Much Sir 💎

@rockybalboa6969 Жыл бұрын

In LL 1 PARSER 3:10 there is also left factoring removal

@manishnayak930 6 ай бұрын

bro,plz send the homework[35:19] questions answer sheet/make a solution video on that question ,bcz we can't solve it

@ameyaraj9473 Жыл бұрын

Please make video o CLR and LALR parser too

@HritikGohil 5 ай бұрын

❤👊👌👌👌👍

@akshaysathe Жыл бұрын

exam mein strings nahi dete hey toh kya kare??

@aanchalraysharma5860 2 жыл бұрын

example no.2 me generate parse tree me first me S->aBh hai iska first to {a,b,e}hain 1 me to sirf a ke niche 1 kyu likha b,e ke niche 1 nahi hoga ?reply plz plz parse table koi samjhade

@cptjackdaw 2 жыл бұрын

Parse table jb bhi fill krte hai, usme jo production rule hota hai uska first nhi likhte, instead uske right hand side ka first likhte hai. Jaise apke doubt me ye production rule thi: S -> aBh Isme FirstOf(S) to {a, b, e} hi hai, ye to correct hai pr hme table me "S" ke right hand side ka first fill krna hoga, jo hai: FirstOf(aBh) = a Tabhi sirf "a" wale column me "1" fill kiya hai or "b" and "e" me nhi kiya. I hope it helps.

@ThrillTales 6 ай бұрын

can you share the notes as well its help us .

@perfectcomputerengineer 6 ай бұрын

Please checkout the description

@rockybalboa6969 Жыл бұрын

21:08

@Atreyaa Жыл бұрын

Implementation: S = mBDh B = cC C = bc Last Stack : Dh$ Last input: cgfh$ .

@nilayhangarge Жыл бұрын

I got the same. What to do after this step, should I construct the parse tree??

@ishaansharma1869 Жыл бұрын

$ should come if it's ll1 imo

@ishaansharma1869 Жыл бұрын

But my answer is also same

@hamnamazhar1122 7 ай бұрын

next process uhh know?

@hamnamazhar1122 7 ай бұрын

i think itz not a answer

@poojanshah981 2 жыл бұрын

Hey OJAS can you share the solution for the HW question?

@perfectcomputerengineer 2 жыл бұрын

Please refer notes, this and more such examples are solved there

@sameerafzalkhan6071 2 жыл бұрын

I had ans it in the comments

@abhishekkumarprasad1173 5 ай бұрын

can you share it to me @@sameerafzalkhan6071

@VivanshLande24 11 ай бұрын

From where I get ur notes

@perfectcomputerengineer 11 ай бұрын

Checkout the description

@umairrehman2703 2 жыл бұрын

is it necessary to follow the sequence of writing terminals in row ? at 12:40 or we just need to put all in rows , sequence does not matter

@rockybalboa6969 Жыл бұрын

Yes you can

@browseshyam100ster Жыл бұрын

Why you did not write 7 in id which is in first of F...You have written 7 in id, it is fine, but why not in id ???

@nimishdhumale8639 Жыл бұрын

Bcoz id is no8 production

@AzlanAamir 2 ай бұрын

stack implementation is way too difficult man :(

@sanketjain2310 Жыл бұрын

please provide the solution of h.w question please...

@perfectcomputerengineer Жыл бұрын

Please refer notes, all the solutions are available there

@_sarthakmisal 3 ай бұрын

Me toh solve example dekhne aaya tha

@sharadbhadouria1227 2 ай бұрын

Ye starting me $ likhan hamesha likhna hota h

@BariqWani-dr4oh 2 жыл бұрын

I think there should be only one "c" in string , second one is by mistake. i solved with the string "mcbcgfh"and got the implementation as: S -> mBDh B -> cC C -> bc D -> EF E -> g F -> f

@sameerafzalkhan6071 2 жыл бұрын

Damn , crt

@amangupta2206 2 жыл бұрын

And the parsh tree also match with string mcbcgfh$

@akshaykapse1459 Жыл бұрын

Yes bro u r right. There is extra c given by him

@Aman-tr4bb Жыл бұрын

Yah I have also find answer with one c

@aamirtalat Жыл бұрын

correct, i was stuck there too and realized there should be only one c in the string "bc" not "bcc"