cormacmchale / GraphTheory

A Regular expression type job
0 stars 0 forks source link

GraphTheory

A Regular expression Matching Program - Decription of the Program in terms of UI

1.Run the program from the command line - "python regExMatching.py"

2.The user will then be asked for a string in infix notation.

3.After which the user will be entered into a for loop and asked for a string to check if it will be accepted by the NFA built from the infix string.

4.As long at the user does not enter 'stop' they can continue to check any string they wish.

5.The Program will Display TRUE for an accepted string and FALSE for a string that is not accepted.

**THE FULL DOCUMENTATION OF HOW THE PROGRAM ACHEIVES THIS IS IN THE WIKI**