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

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

[@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]

Thank you so much, unable to find any clear video in compiler designer for this topic.
This one is one of the best!

[@ColleGPT]

bhai bahout easy way me samjaya hai aapne.......thank you so much bhai❤❤‍🔥❤‍🔥❤‍🔥

[@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]

Finally somebody explained thomson rule .

[@pratikshakumbhar2755]

this was a lifesaver

[@sreyavarmakalidindi6301]

Best explanation of all videos for nfa to DFA 💯

[@kabeer3176]

Thankyou so much sir all the concepts clearly covered in one video ❤❤

[@kaifmalek3608]

Thank You for making this video it is very helpful😊

[@sb-hwang]

Thank you so much. you are my savior! ❤💯

[@rimshachaudhry2553]

You made this easy to understand👌

[@akhilaakhila1973]

Nice explanation, thank you 🙂

[@arpansingh8712]

Best video thank you sir

[@md.sowmik7944]

very helpful... thank you

[@jishnuraj2278]

Wonderful explanation

[@korattirth1718]

thank u for making this very easy

[@BlackKneeGrow98]

Thank you for sharing

[@vishalshrivastav1710]

Yor are God Sir

[@ChallengeAll]

Thank you so much 🎉

[@nitigya]

PERFECT!

[@rachamallarahul6579]

Thanks... Nobody not posted this unit..

[@deekshith9028]

Thanks a lot ☺️

[@DevPatel-qj9qk]

great!!!!

[@Notmyrealnamet]

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]

13 states are produced according to thomsan method

[@deepikasharma2933]

Thankyou so much

[@krishafyme]

thank you so much

[@ronityt2253]

nice

[@divyanshu4675]

why is there a null in some of the expressions ?

[@rohailkhan2278]

Thanks sir

[@ahteshamshakeel5879]

question no 4 (a* | b* ) how to convert into NFA

[@riteshchauhan1413]

Just like a/b

[@riteshchauhan1413]

Instead of a and b draw nfa for a* and b*

[@dhruvrajvyas6682]

For (a | b)*a(a | b) does I have to draw ( a | b) two times or only one time while concetenation

[@riteshchauhan1413]

Have to draw 2 Times

[@bhumikabansal3503]

Sir please do share the PDF of exercise question

[@althaf8252]

please provide the exercise answers

[@shusantoboshu]

please, give me Exercise soluation

[@Priya-nu6eq]

When we draw nfa then # is included or not?

[@riteshchauhan1413]

No
It will used in syntax tree method

[@malaikaasif7047]

(a*|b*)*aa how to convert it in NFA

[@riteshchauhan1413]

Send me your email id I will send you the solution

[@be.silent7955]

book name plz

[@riteshchauhan1413]

Compilers Principles, Techniques, & Tools
By Alfred aho and Jeffrey ullman

[@SherazVerses061]

kfueit se prhne k bad yahn ana farz hai ap per ,, compiler itna mushkil nhi jinta hmy btaya gya tha ,,

[@_YuvrajChauhan]

Makkhan 🧈