|  | 
 | ||||
|        | |||||
|  | |||||
| Prerequisite Concepts | Related Syntax | ||||
| Finite state machines | |||||
find rules can be combined with group declarations to build finite state machines:
find rules implement state transitions, as well as performing text transformation.
next group is actions are used to select a new state.
The experienced programmer will find that this is an extremely powerful technique for certain tasks.
| Prerequisite Concepts | Related Syntax | 
Copyright © Stilo International plc, 1988-2008.