Haven't made a post in quite a while, so I'll reminisce about the past assignment: regex trees. Parsing regex trees was quite straight forward however matching proved to be a challenge of trials and errors due to edge cases. It came down to correct ranges in the end for the troublesome star nodes. Edge cases like (e*|1)* were troublesome, creating infinite loops. Results show all the auto-marker test cases worked however I assume TAs will try to break the code and go over the documentation.
In preparation for the test I have done what Danny said to do in class, gone over the past labs, examples in class, assignment, and past exercises. I still feel somewhat unprepared, it is probably from the pressure of the new CS subject post requirements.
