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

Подписаться 4,2 тыс.

Просмотров 241 тыс.

50% 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...

Опубликовано:

17 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 97

@surajkumar-cv3xb 4 года назад

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

@rajashri86 4 года назад

Thank you for your comment

@ayushchhabra5745 3 года назад

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

@debashishtiu2919 11 месяцев назад

IIT kgp cs me ladkiya kaisi hai 😅😅

@memes1719 7 месяцев назад

@@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 2 года назад

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 2 года назад

Thank you 😊

@salmansamikhan4854 5 лет назад

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

@abhijeetbatra8451 5 лет назад

Thanks mam ,understood better than our class lecture

@turtlepedia5149 3 года назад

At last good video on this topic

@rajashri86 3 года назад

Thank you 😊

@srivenkatanathann1630 6 лет назад

Slow, easy and understandable!! Thank u mam👌

@sharanpreetkaur8662 5 лет назад

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

@RubelTube2020 5 лет назад

it's really understandable! thank you mam

@amancoder1 5 дней назад

wonderfull video

@rajashri86 4 дня назад

Thank you so much 😊

@AndersonVish 4 года назад

Thank you! Very helpful.

@anaskhan4176 3 года назад

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 3 года назад

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

@aksharkottuvada 6 лет назад

thank you mam it helped me understand this concept

@Ak20231 6 лет назад

Thanks alot!!

@rakshitp9124 3 года назад

Thank you so much!!

@hkiscrazy 3 года назад

Well Explained 👍

@rajashri86 3 года назад

Thank you so much..🙏

@malikkhan6003 4 года назад

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

@dipenpatel2029 3 года назад

Dil khush ho gaya

@adhayajain616 5 лет назад

Very good explanation. Thank you mam.

@dhanush6670 2 года назад

Clear Cut Explanation.

@rajashri86 2 года назад

Thank you so much 😊

@dimitrios67 4 года назад

very good job!!

@bobfreecode8106 6 лет назад

thanks goodly explained

@zahidhassan3099 5 лет назад

thanks mam.

@nirmalpatel6543 5 лет назад

Thanks a lot for a admirable help...

@padmalochanmaiti9695 7 месяцев назад

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

@kaushalniroula4129 3 года назад

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

@vishwaknama7608 2 года назад

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

@Armando_Lara 4 года назад

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 4 года назад

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

@KushChoudhary 4 года назад

I checked the code, 3/5 keep it up

@Armando_Lara 4 года назад

@@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 4 года назад

@@Armando_Lara haha thanks buddy

@nagendra1282 3 месяца назад

Thank you mam. You helped me a lot ❤

@rajashri86 3 месяца назад

Thank you so much 😊

@amatuluzma3828 5 лет назад

Thanks a lot

@shreyashachoudhary480 2 года назад

Really amazing

@rajashri86 2 года назад

Thank you so much 😊

@mahfouzamer9720 6 лет назад

Thank you

@bahraebrahimkhalid3408 4 года назад

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

@rajashri86 4 года назад

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

@bahraebrahimkhalid3408 4 года назад

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

@vishwaknama7608 2 года назад

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 2 года назад

Thank you so much.

@JayDee-b5u 5 месяцев назад

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 5 месяцев назад

Could you tell me?

@koushikk7076 5 месяцев назад

Could you tell me the algorithm

@ajayprakash1167 5 лет назад

Super mam

@me-klaus 3 года назад

👍👍👍👍👍👍👍

@gauravkapoor2580 3 года назад

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

@kalgikansara7369 3 года назад

How you created diagram please explain

@rajashri86 3 года назад

Watch complete video you will understand how to create diagram. Or watch below video for better understanding ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-PsWFuqd2O8c.html

@PREETHAM-mp25 3 года назад

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

@shlokgandhi2054 4 года назад

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

@rajashri86 4 года назад

ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-PsWFuqd2O8c.html Watch above video u will understand how to solve examples.

@shlokgandhi2054 4 года назад

nd also not getting the followpos of 2nd example

@shlokgandhi2054 4 года назад

Great, I've got it. Best explanation.

@rajashri86 4 года назад

Thank you 🙏🙏🙏

@shlokgandhi2054 4 года назад

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

@bimalagautam934 Год назад

Thank you ma

@rajashri86 Год назад

Thank you 😊

@kumaranr463 4 года назад

Exact anser

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

@thiruprabhume 2 года назад

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

@gyanvidhilekhan1265 4 года назад

Wrong confused !!!

@rajashri86 4 года назад

Example is correct. Watch carefully u will understand

@gyanvidhilekhan1265 4 года назад

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

@rajashri86 4 года назад

Hello dear why I will match the answer, watch below video ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-PsWFuqd2O8c.html Still u have problem then I can't help you.

@gyanvidhilekhan1265 3 года назад

@@misc1217 yes !!