Тёмный
No video :(

COMPILER DESIGN: UNIT-2 LEXICAL ANALYZER (PART-3) | Thomson method | RE TO NFA | NFA TO DFA 

Ritesh Chauhan
Подписаться 7 тыс.
Просмотров 101 тыс.
50% 1

Finite Automata From a Regular Expression, NFA using THOMPSON'S RULE, DFA using Subset Construction method, Optimization of DFA

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

 

4 сен 2024

Поделиться:

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 48   
@pradipkafle3644
@pradipkafle3644 Год назад
"aap insan nahi bhagwan ho", struggling to understand this since the start of my semenster.Thank you very much for this video.
@sourav_chhotray
@sourav_chhotray 4 месяца назад
Thank you so much, unable to find any clear video in compiler designer for this topic. This one is one of the best!
@ColleGPT
@ColleGPT 21 день назад
bhai bahout easy way me samjaya hai aapne.......thank you so much bhai❤❤‍🔥❤‍🔥❤‍🔥
@maulikpatel5493
@maulikpatel5493 Год назад
Bhai mai is subject me ek dum khtm insaan hu bt apki vjah se lgta hai pass ho jaunga . Don't have words to thank you man ✌️❤
@user-yv1jr5oo8h
@user-yv1jr5oo8h 2 месяца назад
Finally somebody explained thomson rule .
@pratikshakumbhar2755
@pratikshakumbhar2755 2 года назад
this was a lifesaver
@sreyavarmakalidindi6301
@sreyavarmakalidindi6301 Год назад
Best explanation of all videos for nfa to DFA 💯
@kabeer3176
@kabeer3176 Год назад
Thankyou so much sir all the concepts clearly covered in one video ❤❤
@kaifmalek3608
@kaifmalek3608 9 месяцев назад
Thank You for making this video it is very helpful😊
@sb-hwang
@sb-hwang 11 месяцев назад
Thank you so much. you are my savior! ❤💯
@rimshachaudhry2553
@rimshachaudhry2553 2 года назад
You made this easy to understand👌
@akhilaakhila1973
@akhilaakhila1973 2 года назад
Nice explanation, thank you 🙂
@arpansingh8712
@arpansingh8712 2 года назад
Best video thank you sir
@md.sowmik7944
@md.sowmik7944 8 месяцев назад
very helpful... thank you
@jishnuraj2278
@jishnuraj2278 Год назад
Wonderful explanation
@korattirth1718
@korattirth1718 2 года назад
thank u for making this very easy
@BlackKneeGrow98
@BlackKneeGrow98 Год назад
Thank you for sharing
@vishalshrivastav1710
@vishalshrivastav1710 Год назад
Yor are God Sir
@ChallengeAll
@ChallengeAll 4 месяца назад
Thank you so much 🎉
@nitigya
@nitigya 2 года назад
PERFECT!
@rachamallarahul6579
@rachamallarahul6579 4 месяца назад
Thanks... Nobody not posted this unit..
@DevPatel-qj9qk
@DevPatel-qj9qk 11 месяцев назад
great!!!!
@deekshith9028
@deekshith9028 2 года назад
Thanks a lot ☺️
@Notmyrealnamet
@Notmyrealnamet 15 дней назад
how many states will be there in total for a(b | c)*a*c following your method i got 15 states in total but chat gpt says it will be 16 because you have to add an epsilon transition from end state of a* to start state of c. but in your example (a|b)*abb you have not added any epsilon transition after (a|b)* to a please clarify
@riteshchauhan1413
@riteshchauhan1413 13 дней назад
13 states are produced according to thomsan method
@deepikasharma2933
@deepikasharma2933 2 года назад
Thankyou so much
@krishafyme
@krishafyme Год назад
thank you so much
@ronityt2253
@ronityt2253 Год назад
nice
@divyanshu4675
@divyanshu4675 3 месяца назад
why is there a null in some of the expressions ?
@rohailkhan2278
@rohailkhan2278 7 месяцев назад
Thanks sir
@ahteshamshakeel5879
@ahteshamshakeel5879 Год назад
question no 4 (a* | b* ) how to convert into NFA
@riteshchauhan1413
@riteshchauhan1413 Год назад
Just like a/b
@riteshchauhan1413
@riteshchauhan1413 Год назад
Instead of a and b draw nfa for a* and b*
@dhruvrajvyas6682
@dhruvrajvyas6682 4 месяца назад
For (a | b)*a(a | b) does I have to draw ( a | b) two times or only one time while concetenation
@riteshchauhan1413
@riteshchauhan1413 4 месяца назад
Have to draw 2 Times
@bhumikabansal3503
@bhumikabansal3503 Год назад
Sir please do share the PDF of exercise question
@althaf8252
@althaf8252 2 года назад
please provide the exercise answers
@shusantoboshu
@shusantoboshu 2 года назад
please, give me Exercise soluation
@Priya-nu6eq
@Priya-nu6eq Год назад
When we draw nfa then # is included or not?
@riteshchauhan1413
@riteshchauhan1413 Год назад
No It will used in syntax tree method
@malaikaasif7047
@malaikaasif7047 2 года назад
(a*|b*)*aa how to convert it in NFA
@riteshchauhan1413
@riteshchauhan1413 2 года назад
Send me your email id I will send you the solution
@be.silent7955
@be.silent7955 Год назад
book name plz
@riteshchauhan1413
@riteshchauhan1413 Год назад
Compilers Principles, Techniques, & Tools By Alfred aho and Jeffrey ullman
@SherazVerses061
@SherazVerses061 3 месяца назад
kfueit se prhne k bad yahn ana farz hai ap per ,, compiler itna mushkil nhi jinta hmy btaya gya tha ,,
@_YuvrajChauhan
@_YuvrajChauhan Год назад
Makkhan 🧈
Далее