There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
I was asked to write a Python program to execute regular expressions on strings using an algorithm known as Thompson's construction. In this, I have to build a non-deterministic finite automaton (NFA) from a regular expression, and can use this to check if the regular expression matches any given string text
