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
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
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.
Man not gonna lie but your teaching is off the charts and your videos are very underrated they need more attention 🥺
WE NEED TEACHERS LIKE YOU. THANKS, A LOT!
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
Best then the other channel ..👍👌👌loved the way you taught ....thank you 🎈
Bro You Are Legend
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
right
Bro f is epsilon.
but in video given string is mcbccgfh$
Still h$ is left how to remove h
We need a teacher like you in Pakistan,thank you brother
Such a saviour one night before exam ❤
Sir gggg ❤🔥🔥🔥 iss dafa meray exam m b kuch na kuch honay wala hai 😉😄😄❤🔥🔥🔥
Legendary teaching style bhai aapka. Hats off to you.
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$
Ooh thank you ojas ! ✌🏻
same here
Same here
@@sameerafzalkhan6071 Can you write the whole solution 🥲🥲
@@ImFaiyyazz its ez bro just try it hope u got the answer
Thank you sir..... I'm happy ..... And confusion free
ojas bhai ke aage koi bol skta hai kya oju bhai yeeeeee.........jai ho oju bhai ki
Shandaarrr bhai, mjaa agya ❤
Congrats for १००k
You're the only hope ❤ lots of respect
Stupendous Explanation Sir! Thank you For This.
bro,plz send the homework[35:19] questions answer sheet/make a solution video on that question ,bcz we can't solve it
Sir you are the monster 🙇♂️
In LL 1 PARSER 3:10 there is also left factoring removal
You are a legend sir, what a Explanation......
Best video for understanding LL(1)
bro u should be teaching in a college specially in my college...
Implementation:
S = mBDh
B = cC
C = bc
Last Stack : Dh$
Last input: cgfh$ .
I got the same. What to do after this step, should I construct the parse tree??
$ should come if it's ll1 imo
But my answer is also same
next process uhh know?
i think itz not a answer
Best Explanation and with step by step
Thankyou for the best explanation ❤️
best Explanation, love your videos
Very easy explanation ❤ thank you so much ❤
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
Damn , crt
And the parsh tree also match with string mcbcgfh$
Yes bro u r right.
There is extra c given by him
Yah I have also find answer with one c
correct, i was stuck there too and realized there should be only one c in the string "bc" not "bcc"
very well explained. thankyou
thankyou so much for saving me in university exam
Thankyou Sir for you effort, Extermly helpful. ❤
Thank you for nicely explaining 😇
Super.....broooooo.........❤❤
Explanation was too good.
bro i want long videos like this
kya hi padhate ho bhaiya awesome
🤩🤩🤩Awesome
You are very great teacher. God bless you!
Amezing sir!🙇
Thank you so much bhai❤
Ak side pay uni Sir or ak side pay AP. Huge difference
cant thank you enoughhh!
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
Yes you can
Perfect explanation
Thank you so much bhaiya
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
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.
Sir agr string hi ni diya toh kya karenga ( plz jldi replay kar dijiye)
Toh kuch nahi hoga table ke baad question over h aur waise aap shayad canonical items ka puch rhe toh woh ll me nahi lr me hota h 😅😅
youre too good brother
exam mein strings nahi dete hey toh kya kare??
thanks a lot
Please make video o CLR and LALR parser too
Thankyou Sir.
Hey OJAS can you share the solution for the HW question?
Please refer notes, this and more such examples are solved there
I had ans it in the comments
can you share it to me
@@sameerafzalkhan6071
amazing
Full sapot
THANKYOUUUU G
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 ???
Bcoz id is no8 production
stack implementation is way too difficult man :(
please provide the solution of h.w question please...
Ye starting me $ likhan hamesha likhna hota h
❤👊👌👌👌👍
21:08
Me toh solve example dekhne aaya tha
kuch hone wala hai
Hone wala hai exam bhai tomorrow 😂and thanks ❤