RE to DFA by direct method (Compile Design) Example 2

RE to DFA by direct method(Compiler Design), Regular Expression to DFA by computing Nullable, Firstpos, Lastpos and Followpos functions. Here we are converting Regular Expression to DFA by direct method. We generate syntax tree for Firstpos, Lastpos, then we compute followpos using algorithm. Using followpos we design DFA, for this you can refer book "Compilers" by Aho, Lam, Ullman, Sethi.
Also watch the Video RE to DFA by direct method example 1: • RE to DFA by direct me...

[@chandanam4296]

Mam really awesome.... It very useful to me.. 👍👍..

[@rajashri86]

Thanks a lot..

[@anushav2669]

Ma'am, thank you so much. Today my teacher in college explained, I couldn't understand properly. Now I'm cleared. THANKs a lot. Subscribing your channel 🖤👍...!!!

[@rajashri86]

Thank you Anusha🙏🙏

[@tingletimu22]

Follow pos to DFA generation is explained very easily. Thank you.

[@rajashri86]

Thank you so much..🙏

[@059_riyaraj4]

The way you explained is fabulous 👌

[@rajashri86]

Thank you so much ❤️

[@mdkamruzzamanleion9950]

Great tutorial, lots of love from Bangladesh

[@rajashri86]

Thanks a lot😊🙏

[@CrazyMonkeytututu]

Thank you ma'am!❤

[@rajashri86]

Thank you so much 🙏

[@metin2dare]

Actually its not dfa , because its have undefined states. Like if starting with 'a' on initial state its need to gonna be to halt state. So we need to convert nfa to dfa in last part. But i think its best video for creating syntax tree. Ty for sharing.

[@rajashri86]

Thank you.. It's algorithm from Compiler Design book, Author Names . Ahi,Ulman Sethi. For more information check this book.

[@kalgikansara7369]

Node 2,3,4 has same followpos so 2=3=4 then how to draw dfa

[@mdrajibhasnat2321]

Wow.Excellent.Thank you very much.❤️

[@rajashri86]

Thank you so much

[@adityashukla5102]

thank u so much for this video

[@rajashri86]

Thank you 🙏

[@bharathp4436]

Teaching level is vv good

[@rajashri86]

Thank you so much 😊

[@sivahari6748]

Mam, i have a doubt, What about the b transition on a...if that is not defined we cant say that it is a DFA...can you please explain??

[@rajashri86]

If there are more transition on same symbol it's called NFA. Here not necessary on each symbol ther e will be transition its depend on RE. If any transition is missing then we can show that transition to dead state. But here I have not shown dead state, you can take dead state and show remaining all transition but after completing DFA.

[@sivahari6748]

@@rajashri86 okay.. mam...thanks a lot...nice video

[@rajashri86]

Thank you so much.
Also watch example1 for more understanding.
You will get in playlist.

[@dhruvmaniya7149]

Honestly, I went through many solutions but it's best.

[@rajashri86]

Thank you so much 😊

[@arisz1065]

Convert the Regular Expression (a+b)*a(a+b) to DFA directly. What is syntax tree for this? Do we have to discard a coming in middle or not??

[@naveedshams6636]

very good explanation

[@rajashri86]

Thank you so much 😊

[@aashishsapkota8058]

Best concept

[@rajashri86]

Thank you ☺️🙏

[@chaithrar983]

Mam in the beginning b.a you taken as from one concatenation (.) b and a
But at the end again a is concatenated with b. Why you not taken from one concatenation for a and b.
Can you please explain this mam.

[@Hecker_bro]

because in beginning we can't leave b lone s there is nothing to concatenate with it. I f we will do as you are telling it will become "b . . a . (a+b)^* . a . b" there will come two cocatenation symbol after b.

[@mirzasakib2747]

thanks a lot ma'am

[@rajashri86]

Thank you so much 😊

[@fajworld]

Convert the following regular expression over
Σ= {a, b, c} to DFA using Direct method
(a|b|ԑ)* | (a*.b*).c
maam kindly help me to solve this kindly make a video plz

[@mirzababarhussain2336]

Thanks mam 😊

[@rajashri86]

Thank you 😊

[@jinugeorge4913]

the result is not dfa since from A no transitions on a and from B no transition on b.
Is there any problem in converting first to nfa and then to dfa

[@rajashri86]

This is Direct method algorithm, this is the compiler method. For NFA,DFA pls watch Theory of Computation playlist on this channel.

[@k.shwetharajuk.shwetharaju9555]

(a+b)*abb I need this conversation
RE to DFA

[@rajashri86]

th-cam.com/video/G8i_2CUHP_Y/w-d-xo.html
Above example is solved in this video please do watch

[@rajashri86]

th-cam.com/video/G8i_2CUHP_Y/w-d-xo.html
Please chk above video for your example

[@AbhishekKumar-cv1dh]

At 18:20, wouldn't we get b transition as 3,4,5,7? Hence it will be a self loop on b transition from state {3,4,5,7}. Is this correct?

[@saniyachaudhary2350]

yah i too noticed

[@rajashri86]

No, out of {3,4,5,7} only 4 node is having b transition so we will consider followpos of 4 only that is {3,4,5} not self loop {3,4,5,7}.

[@rajashri86]

@@saniyachaudhary2350 No, out of {3,4,5,7} only 4 node is having b transition so we will consider followpos of 4 only that is {3,4,5} not self loop {3,4,5,7}.

[@saniyachaudhary2350]

@@rajashri86 oh yes.Thanks I got it.