Finally completed the assignment that was due, and handed it in on time! Having read the instructions and listened to Dr. Heap, I was very scared approaching this assignment as I had no idea what the topic it was covering was about and how to approach it in the slightest way. Looking back on it however, I am very pleased with how it went and after learning thoroughly about recursion, it helped significantly.
At the beginning, I compiled a list of cases from my own examples as well as compiled some from piazza that were contributed by Dr. Heap and some from Chance. After I had these I proceeded to write test cases for the program beginning with the RegexTree construction. After approaching the problem, it lead to itself just being typed out, seemed fairly straightforward and I was actually surprised by the speed in which I was able to code it up.
Then came the match section. That proved to be the challenging portion of the assignment, but I approached it the same way. Thinking about cases and typing them up so I could track my progress from easy to expert examples. I approached the problem from solving very simple RegexTrees a.k.a single RegexTreeNodes. Then approached the intermediate areas such as single BarNodes, StarNodes and DotNodes. Lastly I made sure that all the No
No comments:
Post a Comment