Generating CFG from regular expression | context free grammar | RE to CFG | CFG from RE | cfg to re

Generating Context free grammar from any given regular expression is very important. So we will see multiple solved examples here that will help you in theory of computation as well as compiler design. In this video, we'll see the examples of how to generate CFG (Context Free Grammar) from the given regular expression in TOC (Theory of computation) #cfg #regularExpression #toc #cse #cseconceptwithparinita

If you like my video contents, please LIKE, COMMENT, SUBSCRIBE and SHARE with your friends.
You can always connect with me at:

***********************************************************************************

Compiler design tutorials:

Theory of computation (TOC) tutorials:

Cryptography techniques tutorials:

Artificial Intelligence tutorials:

GATE previous year important questions:

Data Compression tutorials:

Computer networks tutorials:

Technical job updates:

Data structures and Algorithms tutorials:

Programming questions:

Digital image processing:

Digital electronics:

Motivational videos:

Keep learning, keep supporting 🤝✨💯

[charlottehuntington]

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.❤

[tamzidchowdhury]

God bless you, you explained way better than my professor, who I paid $10k

[ANGELS]

THANK YOU SO MUCH! THANKS TO YOUR VIDEO I WAS ABLE TO DO AN EXERCISE I'VE BEEN TRYING SINCE YESTERDAY

[ancientstories]

Mam, you are a great teacher, understood the whole concept clearly and tomorrow is my exam!!!

[jackalvarez]

THANK YOU! Studying night before. best explanation on yt for CGF! Commenting for algorithm! thank

[SanjaySingh-udju]

It is really one of the best explanations available online

[umeshpatil]

thank you very much. crystal clear concept. thanks once again. my online graded assignment is going on. thanks

[Arnankhan]

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

[diwang]

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

[devconteh]

Thanks. this is really a great tutorial. very easy and clear explanation

[furkanekici]

what a thorough and lovely explanation! thanks.

[TheGamingIndustry-YT]

best explaination in youtube, thankyou so much mam :-)

[usmantahir]

. 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?

[rrahulrroyr]

Thank you a lot for the overall idea !!

[usmantahir]

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?