CS374: Programming Language Principles - Regular Expressions

Activity Goals

The goals of this activity are:
  1. To define regular expressions
  2. 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 on the Class Activity Questions discussion board. 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


Questions

  1. What lines do you think are matched by each of the regular expressions?
  2. 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

CS Unplugged Finite State Machine Activity

Questions

  1. What pattern of A and B would take one from Shipwreck Bay to Treasure Island?
  2. 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.

Submission

Submit your answers to the questions using the Class Activity Questions discussion board. You may also respond to questions or comments made by others, or ask follow-up questions there. Answer any reflective prompt questions in the Reflective Journal section of your OneNote Classroom personal section.