Regular Expression to DFA directly | Nullable | Compiler Design | Satyam Raha
In this series of videos, I have explained the method of direct conversion of a Regular expression to DFA. We do not need to find the NFA first, the DFA can be derived directly using this method.
Concepts explained:
Augmented Regular expression
Nullable(node)
Firstpos(node)
Lastpos(node)
Followpos(position)
Cat node
Or node
Star node
Syntax tree
On this page of the site you can watch the video online Regular Expression to DFA directly | Nullable | Compiler Design | Satyam Raha with a duration of hours minute second in good quality, which was uploaded by the user Satyam Raha 04 December 2022, share the link with friends and acquaintances, this video has already been watched 232 times on youtube and it was liked by 1 viewers. Enjoy your viewing!
