Outline for November 1, 2021

Reading: §14
Due: Homework 3, due November 8, 2021

1. ReviewTower of Hanoi problem for recursion [hanoi.py]

2. Pattern matching
   1. Regular expressions
   2. Atoms: letters, digits
   3. Match any character except newline: .
   4. Match any of a set of characters: [0123456789], [^0123456789], [0-9]
   5. Repetition: *, +, {m,n}; greedy matching; put ? after and they match as few characters as possible
   6. Match start, end of string: ^, $; $ matches end of line, also
   7. Grouping: (, )
   8. Escape metacharacters: \

Matt Bishop Office: 2209 Watershed Sciences Phone: +1 (530) 752-8060 Email: mabishop@ucdavis.edu

ECS 235A, Computer and Information Security Version of October 31, 2021 at 11:47PM

You can also obtain a PDF version of this.