. a. Explain why some programming languages require automatic memory management (“garbage collection”) for program execution? b. At a given point in the execution of a program, what can be considered as garbage? How can garbage be located in memory?
I believe this is also correct. For the first problem: S -> ASB|aa A -> a|b|lambda B -> a|b|lambda For the second problem: S -> ASB|1 A -> 0|lambda B -> 0|1|lambda
India might not have defeat Hitler, it may not have sent the first man to the Moon, but its great people did save millions of suffering Computer Science students :D
Q2. Consider the following Context Free Grammar (CFG) 𝑆 → 𝐴𝑎 | 𝐵𝐴𝑏 𝐴 → 𝐵𝐵 | 𝑐 𝐵 → 𝑆𝑑 | 𝑒 where {a, b, c, d, e} is the set of terminal symbols. a. Give a right-most derivation of ecadeb. b. Give a left-most derivation of ecadeb. c. Compute FIRST and FOLLOW for this grammar? d. Discuss whether CFG is ambiguous or not and draw the parsing tree?
Kyuki ham ye sochke video banate hai ki jinko ye topic nahi aata, vo video dekhke ye topic seekh jaaye. And for that purpose, direct complicated example nahi le sakte as we have to think about a wider audience 🙃
A heads up, in the first example in your language L you marked "bbbaa" as a part of the language while it isn't This is because the (a+b)* group requires at least one letter "a" and exactly one "b" per repetition if the group exists; the CFG you have used would also recognize "baab" as a part of its language That being said, the CFG that I would use here is S -> AS | aaS | eps A -> aA | ab | eps This grammar should now NOT recognize "bbbaa" nor "baab" as a part of the language If I'm wrong feel free to correct me; I'm still trying to learn how to properly translate regex into CFG which basically brought me to watch this video! EDIT: Similar mistake happens in the second example Because of B -> 1B grammar will accept 11111 as a part of its language
(a+b)* means 0 or more occurences of combination of a and b (a+b)+ means 1 or more occurences of combination of a and b so, the video is correct, you got confused, got it?
@@ChocoFeather nope... I even gave explanations why they don't work (a+b)* indicates that if there's a "b" there MUST also be at least one "a" beforehand => "bbbaa" does not belong to the language L in the first example because it does NOT have at least one "a" before each "b", similar logic also applies to the example "baab" and the mistake repeats itself with (0+1)* once again
Somya you sound brainless.. Free help given by someone who you don't even know.. Likely wants to help everyone succeed, how about you upload a video so we can laugh at you incompetence? Or sit down and learn your place.
Dear mam you gave me confidence that i can clear my toc exam.the way you teach is more understandable than my proffessor tech us in lecture.❤
I'm really happy to know that 😊
Keep learning, keep sharing ✌
THANK YOU! Studying night before. best explanation on yt for CGF! Commenting for algorithm! thank you!!!!!!
Thank you for acknowledging 😊
Keep learning, keep sharing ✌️
thank youuuuuuuuuuuuuuuuuuuuu💗💗💗💗💗💗💗
Glad it was helpful! Keep learning, keep supporting 🙂
God bless you, you explained way better than my professor, who I paid $10k
Happy to help😊
It is really one of the best explanations available online
Thanks for such a compliment 😊
You're such a good teacher. Thank you!
Thank you for acknowledging ✨
Keep learning, keep supporting ⭐
Clear and detailed explanation.
After reading the theory part, I am able to understand the working after seeing this video.
Happy to hear that! Keep learning, keep supporting ✨
Mam, you are a great teacher, understood the whole concept clearly and tomorrow is my exam!!!
Glad to know that. Wish you all the best for your exam :)
@@CSEconceptswithParinita Thank you mam, it was great :)
THANK YOU SO MUCH! THANKS TO YOUR VIDEO I WAS ABLE TO DO AN EXERCISE I'VE BEEN TRYING SINCE YESTERDAY
I'm glad to hear this😊 keep learning, keep supporting 🤝
thank you very much. crystal clear concept. thanks once again. my online graded assignment is going on. thanks
Happy to help😊
Keep learning, keep sharing ✌
Thank uuuuuuuuuuuuuu ❤
Keep learning, keep supporting ✨
Very helpful .Thank you man
Keep learning, keep sharing ✌️🙂
best explaination in youtube, thankyou so much mam :-)
I'm glad to hear that! Keep learning, keep supporting 🙂
what a thorough and lovely explanation! thanks.
My pleasure 😊 Keep learning ,keep sharing ✌
Very nice explanationn thanxxx alot
You're welcome. Keep learning, keep sharing ✌😊
Easy Explanation...Thank You.
You're welcome 😊
you made it so easy keep growing
Keep learning, keep sharing 😊
Thanks. this is really a great tutorial. very easy and clear explanation
My pleasure😊 Keep learning, keep sharing ✌
Excellent !
Keep learning, keep sharing ✌ 😊
ooof you saved my ass this sem. 😀😂
best explanation!
Keep learning, keep sharing ✌ 😊
@@CSEconceptswithParinita thank you so much for your help! you are a great teacher!
I'm glad to hear that🙂
nice explanation mam,Thank you
Keep learning, keep sharing 🙂
Awesome explanation
Thanks for the acknowledgement 😊
Teacher you teach in a fabolous way
Thanks for acknowledging! Keep learning, keep sharing 😊
Thank you mam 😊 nice explanation 👍
Thanks dear for the acknowledgement 😊
Thanks a lot mam😘
Amazing! You made my day ^_^
Keep learning, keep sharing ✌😊
Thanks ma'am. Very clear
Glad it helped! Keep learning, keep supporting 🙂
nice teaching mam 😯
Thanks for your feedback 😊
You save my life
.
Keep learning, keep supporting 🤝
Very clear explanation!
Thanks for your feedback 😊
Thank you!
Keep learning, keep sharing 😊
Thank you a lot for the overall idea !!
My pleasure 😊
Nicely explained 👏👏
Thanks for the acknowledgement :)
Great thank you
My pleasure 😊Keep learning, keep sharing ✌
Thank you so much mam🙏
Completely my pleasure 😊
5:43 rip insect you will be missed
Good observation 😂😂
Thankyou 🥺❤️
My pleasure 😊
Keep learning, keep sharing ✌
Thank you :D
Keep learning, keep sharing ✌ 😊
Thank you mam❤
Most welcome 😊 keep learning, keep supporting ✨
. a. Explain why some programming languages require automatic memory management (“garbage collection”) for program execution?
b. At a given point in the execution of a program, what can be considered as garbage? How can garbage be located in memory?
Nice🙂
Thank you 😊
I believe this is also correct.
For the first problem:
S -> ASB|aa
A -> a|b|lambda
B -> a|b|lambda
For the second problem:
S -> ASB|1
A -> 0|lambda
B -> 0|1|lambda
Thanks mam
My pleasure 😊
Thnku mam ☺
You're welcome. Keep learning, keep sharing ✌😊
India might not have defeat Hitler, it may not have sent the first man to the Moon, but its great people did save millions of suffering Computer Science students :D
Hahaha
We have other achievements but it's ok
thank you
Welcome! Keep learning, keep supporting ✨
Q2. Consider the following Context Free Grammar (CFG)
𝑆 → 𝐴𝑎 | 𝐵𝐴𝑏
𝐴 → 𝐵𝐵 | 𝑐
𝐵 → 𝑆𝑑 | 𝑒
where {a, b, c, d, e} is the set of terminal symbols.
a. Give a right-most derivation of ecadeb.
b. Give a left-most derivation of ecadeb.
c. Compute FIRST and FOLLOW for this grammar?
d. Discuss whether CFG is ambiguous or not and draw the parsing tree?
But telegram we can't share our problem beczause its mute.
Share in whatsapp group / LinkedIn/ Facebook
what is cfg for ab^naa^n?
Agar hame kuch poochna can we contact theough telegram or some where?
Through any of my social media handles
RE is this (a+b)* generate two CFGs ??
Kindly solve this
hello mam
0(0+1)*01(0+1)*1
how can we solve this one
confused little bit
How about R = (b*ab*ab*)*b*
in case of 2nd example if we use B instead of A ..........
S=B1B
B=0B/1B/^
is this correct?
Yeh log sirf easy question hi solve karte hai , who agree with me hit a like🙃
Kyuki ham ye sochke video banate hai ki jinko ye topic nahi aata, vo video dekhke ye topic seekh jaaye. And for that purpose, direct complicated example nahi le sakte as we have to think about a wider audience 🙃
Mam how to find CFG for (0)*(1(0+1)*
A heads up, in the first example in your language L you marked "bbbaa" as a part of the language while it isn't
This is because the (a+b)* group requires at least one letter "a" and exactly one "b" per repetition if the group exists; the CFG you have used would also recognize "baab" as a part of its language
That being said, the CFG that I would use here is
S -> AS | aaS | eps
A -> aA | ab | eps
This grammar should now NOT recognize "bbbaa" nor "baab" as a part of the language
If I'm wrong feel free to correct me; I'm still trying to learn how to properly translate regex into CFG which basically brought me to watch this video!
EDIT: Similar mistake happens in the second example
Because of B -> 1B grammar will accept 11111 as a part of its language
(a+b)* means 0 or more occurences of combination of a and b
(a+b)+ means 1 or more occurences of combination of a and b
so, the video is correct, you got confused, got it?
@@ChocoFeather nope... I even gave explanations why they don't work
(a+b)* indicates that if there's a "b" there MUST also be at least one "a" beforehand => "bbbaa" does not belong to the language L in the first example because it does NOT have at least one "a" before each "b", similar logic also applies to the example "baab" and the mistake repeats itself with (0+1)* once again
@@vekyyy so, 'bb' doesn't belong to the language of this regex: (a+b) ?
Or in (a+b)* ?
@@ChocoFeather indeed
(a+b)* => L = {ab, aab, aaab, abab, abaab ...}
However:
(a*b)* => L = {b, bb, ab, aab, bbaabbaaaabbbb, ...}
The ant on the book distracted me a lot.. :p
Apologies for that😂😂
@@CSEconceptswithParinita its fine i was just kidding.. and thank you for teaching the concepts.. tomorrow i have exam.. whis me luck. 😁.
Wish you all the best dear✌💯
@@CSEconceptswithParinita thank u thank u..
Who
U r explaining too much which is disgusting... Otherwise its a praiseworthy explanation..
Thank you Somya for your opinion. Can you please elaborate what actually you didn't like?
Somya you sound brainless..
Free help given by someone who you don't even know..
Likely wants to help everyone succeed, how about you upload a video
so we can laugh at you incompetence? Or sit down and learn your place.
@@CSEconceptswithParinita The video is outstanding, really helped me after hours of searching.
Some people just aren't happy..lol
@@litlabproductions2043 thank you so much! The support of people like you keeps me going 😊
great lecture👍
Keep learning, keep sharing 😊