CS374: Programming Language Principles - Regular Expressions
Activity Goals
The goals of this activity are:- To define regular expressions
- To relate regular expressions to lexemes
Supplemental Reading
Feel free to visit these resources for supplemental background reading material.The Activity
Directions
Consider the activity models and answer the questions provided. First reflect on these questions on your own briefly, before discussing and comparing your thoughts with your group. Appoint one member of your group to discuss your findings with the class, and the rest of the group should help that member prepare their response. Answer each question individually from the activity, and compare with your group to prepare for our whole-class discussion. After class, think about the questions in the reflective prompt and respond to those individually in your notebook. Report out on areas of disagreement or items for which you and your group identified alternative approaches. Write down and report out questions you encountered along the way for group discussion.Model 1: Regular Expressions
1 2 3 4 5 | I think you are right!!! What does this mean? WHY DOES IT WORK THIS WAY What else can we do ? (610)555-1212 |
1 2 3 4 5 | .*!{3}.* What.*does What.*does* [A-Z ]+ \(?\d{3}\)?\d{3}-\d{4} |
Questions
- What lines do you think are matched by each of the regular expressions?
- How would you modify the phone number matching regular expression to allow an optional space in-between the area code and phone number?
Model 2: Languages for a Finite State Machine

Questions
- What pattern of A and B would take one from Shipwreck Bay to Treasure Island?
- What regular expression automatically checks that a series of navigational guesses would lead from Shipwreck Bay to Treasure Island? Note that
[AB]
means to match either character A or B once. - Suppose one of the islands is a "trap"e;, such that once you enter, you can never leave. How might you change the the flowchart to enforce this?