RE to DFA by direct method(Compiler Design) Example 1

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 2: • RE to DFA by direct me...

[@surajkumar-cv3xb]

really very well explained. Better than IIT Kharagpur's professors.

[@rajashri86]

Thank you for your comment

[@ayushchhabra5745]

abe iit ki building me ghusne nahi milega.....

[@debashishtiu2919]

IIT kgp cs me ladkiya kaisi hai 😅😅

[@memes1719]

@@debashishtiu2919 bsdk ladkiyon ke peeche pade ga to hogayee teri engineering

[@rupaktiwari5195]

This is gold. Best video on RE to DFA direct conversion.

[@rajashri86]

Thank you so much 🙏

[@shristisisodiya553]

you explained better than most of the youtubers but hesitating so much as a first timer knowing rules I had to repeat, if possible please retake this video explaining rules, btw thanks for the explanation.

[@rajashri86]

Thank you 😊

[@salmansamikhan4854]

very calm easy and clear explanation. Best video I found on this topic so far. Thank you so much mam

[@abhijeetbatra8451]

Thanks mam ,understood better than our class lecture

[@turtlepedia5149]

At last good video on this topic

[@rajashri86]

Thank you 😊

[@srivenkatanathann1630]

Slow, easy and understandable!! Thank u mam👌

[@anaskhan4176]

In second example {1,2,3,5} is not showing transition for c, then how can we call it a dfa? Is there something that i dont know ?

[@turtlepedia5149]

there would be a reject transition at c from {1,2,3,5}

[@malikkhan6003]

In * node 3 and 4 we are adding the last pos in 1 pos But you add 3 in 4 its wrong.

[@padmalochanmaiti9695]

How's the second example a dfa when there are no transitions on c input from so many states??

[@RubelTube2020]

it's really understandable! thank you mam

[@AndersonVish]

Thank you! Very helpful.

[@sharanpreetkaur8662]

mam you saved me,,, video was so guddd, thankyou!!!

[@hkiscrazy]

Well Explained 👍

[@rajashri86]

Thank you so much..🙏

[@adhayajain616]

Very good explanation. Thank you mam.

[@rakshitp9124]

Thank you so much!!

[@dipenpatel2029]

Dil khush ho gaya

[@dimitrios67]

very good job!!

[@amancoder1]

wonderfull video

[@rajashri86]

Thank you so much 😊

[@aksharkottuvada]

thank you mam it helped me understand this concept

[@Ak20231]

Thanks alot!!

[@nirmalpatel6543]

Thanks a lot for a admirable help...

[@vishwaknama7608]

really well explained, thanks a lot But for the last example shouldn't we be considering a dead state? As some of the states doesn't have transitions to some inputs so the answer is not a complete DFA

[@rajashri86]

Thank you so much.

[@bobfreecode8106]

thanks goodly explained

[@kalgikansara7369]

How you created diagram please explain

[@rajashri86]

Watch complete video you will understand how to create diagram. Or watch below video for better understanding kzbin.info/www/bejne/hqS6d6inmZeCbsU

[@dhanush6670]

Clear Cut Explanation.

[@rajashri86]

Thank you so much 😊

[@nagendra1282]

Thank you mam. You helped me a lot ❤

[@rajashri86]

Thank you so much 😊

[@shreyashachoudhary480]

Really amazing

[@rajashri86]

Thank you so much 😊

[@zahidhassan3099]

thanks mam.

[@ajayprakash1167]

Super mam

[@bahraebrahimkhalid3408]

Please answer the questions Convert regular expressions to dfa directly (a|ab) ^*bb(a|b) ^*

[@rajashri86]

Please find answer in below link. drive.google.com/file/d/1fL6LqbR8NeK8RZ8aCa67lsDJkqRrxgv9/view?usp=drivesdk

[@bahraebrahimkhalid3408]

@@rajashri86 owwww thank you my dear ❤️😘😘 love all

[@amatuluzma3828]

Thanks a lot

[@PREETHAM-mp25]

Ma'am how to draw Tree for (a/b)*ab*

[@rahulmacwan4494]

Thank you

[@me-klaus]

👍👍👍👍👍👍👍

[@gauravkapoor2580]

Hey , i know you , u had started a startup with initial funding of 100 crore...congratulations brother

[@JayDee-b5u]

I have come up with an algorithm that is much much much faster than this. No graph creation necessary. Everything can be done with a binary tree.

[@koushikk7076]

Could you tell me?

[@koushikk7076]

Could you tell me the algorithm

[@shlokgandhi2054]

I'm getting confused after 16:50, please help.

[@rajashri86]

kzbin.info/www/bejne/hqS6d6inmZeCbsU Watch above video u will understand how to solve examples.

[@shlokgandhi2054]

nd also not getting the followpos of 2nd example

[@shlokgandhi2054]

Great, I've got it. Best explanation.

[@rajashri86]

Thank you 🙏🙏🙏

[@shlokgandhi2054]

@@rajashri86 If possible can I get syntax tree with follow pos. table of :- (a|b|c)*a(b|c)*# Please send me.

[@Armando_Lara]

Thank you very much, you really helped me to understand this concept madam. I needed to program it in Python, this is the finished product: in github armandolara24/REtoDFA

[@KushChoudhary]

but u made it 14 days before, even the last commit is 14 days before

[@KushChoudhary]

I checked the code, 3/5 keep it up

[@Armando_Lara]

@@KushChoudhary Your really are a keen observer. I forgot to say thank you, I came back. Also I'm writing my report so I revisited to check something. Greetings.

[@KushChoudhary]

@@Armando_Lara haha thanks buddy

[@Lakshmi_Krishna]

Mam is it good to do it as same as in formal language automata theory (flat) our lecturer said you can do it can anybody plz help with this question

[@rajashri86]

Yes, this question solved the compiler design perspective. You can solve it by normal automata questions. For that please watch the TOC playlist of this channel. You will get a number of examples of RE and on FA.

[@kaushalniroula4129]

In second example I think it should be {1, 2, 3 } not {1,2,3, 5}

[@vishwaknama7608]

here + symbol is nullable so we should take the union of both firstpos(+) and firstpos(#)

[@thiruprabhume]

Can you solve a.(a+b)*.a using direct method

[@balajinaik07]

Can i get ppt of this?

[@kumaranr463]

Exact anser

[@abhijeetboricha8722]

isse ghatiya explanation ho hi nahi sakta

[@YashashriShinde]

I think you don't have a level to understand this video. First this video comes under Compiler Design not TOC.

[@rajashri86]

Thank you so much 🙏

[@bimalagautam934]

Thank you ma

[@rajashri86]

Thank you 😊

[@gyanvidhilekhan1265]

Wrong confused !!!

[@rajashri86]

Example is correct. Watch carefully u will understand

[@gyanvidhilekhan1265]

@@rajashri86 first {1, 2} had written than you changed to {1,2,3} actually you are trying to match the answer

[@rajashri86]

Hello dear why I will match the answer, watch below video kzbin.info/www/bejne/hqS6d6inmZeCbsU Still u have problem then I can't help you.

[@gyanvidhilekhan1265]

@@misc1217 yes !!

[@onlyfostudypurpose1669]

Vague tutorial, not understandable. Practise before making videos

[@rajashri86]

First of all do you know this concept? For your understanding read Compiler design book by Ago,Ulman, Sethi. No need to watch my video.

[@Armando_Lara]

@@rajashri86 Don't listen to this person. Explanation is excelent, by the way, what did you use to make the figures and animations? Thanks!

[@rajashri86]

Thanks , Simple Power point presentation nothing special.😊

[@NaveenKumar-tn2tm]

@@rajashri86 at 12:33 followpos(i) = followpos(i) U firstpos(i) . I don't understand, and it doesn't make sense

[@rajashri86]

Its followpos(i) = followpos(i) U firstpos(c2) check it properly

[@vishakamohan5336]

Thank you so much!

[@rajashri86]

You're welcome!

[@rabisubedichettri7217]

Thank you so much

[@rajashri86]

Thank you..

[@yogitajain8003]

Thank u mam

[@mahfouzamer9720]

Thank you