Educational Objectives: After completing this assignment, the student should be able to accomplish the following:

• Define Regular Expression [RegEx]
• Define Non-deterministic Finite Automaton [NFA]
• State Kleene's Theorem
• Describe how to build an NFA that models a given RegEx.
• Describe how to use an NFA to find pattern-match a RegEx in a string.

Operational Objectives: Design and implement the class GREP.

You may have teams of 2 or 3 people. The team should compose a brief summary of work that explains the responsibilities and work products each member of the team accomplished. Also each team member should submit the project individually. Please make certain that the submissions for each member of a team are identical.

Deliverables: Files:

(TBA)
readme.txt     
makefile       # builds all executables in project, including tests

Procedural Requirements

1. The official development | testing | assessment environment is g++47 -std=c++11 -Wall -Wextra on the linprog machines. Code should compile without error or warning.

2. Each member of a team submits all team deliverables

3. Deliverables submitted should be identical across all team members.

4. The team makup is listed in the file header documentation of each submitted file (see C++ Style link for standards)

5. File readme.txt explains how the software was developed, what responsibilities each team member had, how it was tested, and how it is expected to be operated.

6. Copy the file LIB/proj5/proj5bsubmit.sh into your project directory, change its permissions to executable, and submit the project by executing the script.

   Warning: Submit scripts do not work on the program and linprog servers. Use shell.cs.fsu.edu to submit projects. If you do not receive the second confirmation with the contents of your project, there has been a malfunction.

Code Requirements and Specifications

1. (TBA)

Hints

• (TBA)