This section will explain the processin steps for matching the string
- d2-1
and the regular expression is
- cat|dog|[a-z][0-9]-[0-9]
The basic processing steps are as follows:
Start at the begining of the graph with one process point pos1
at pos1 we find a control node that leads to three possible paths. We add all the paths to a process list:
| list | Target |
|---|---|
| pos1 | '[a-z]' |
| pos2 | 'd' |
| pos3 | 'c' |
we follow all these paths