This week is all about regular expression, teaching this right after we completed our 207 assignment is perfect timing. I find regular expression to be a very useful tool for string operations. It can be used to restrict strings very precisely. Since we've learned the application of it in 207, now we have to know how to prove its correctness. The example in the slides showed us a general format of proving a regular expression. I think the structure can be very different depending on where the Kleene Star is located.
-Test 2-
The test wasn't too challenging. It was based on proving correctness of programs with loops and proving recursive funciton (need to use unwinding to come up with a closed form).
No comments:
Post a Comment