Full text search
Finite state machines
Prerequisite Concepts		Related Syntax

find rules can be combined with group declarations to build finite state machines:

• Each group implements a state.
• The 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      Groups

Related Syntax    find    group    next group is

----

[CONTENTS] [CONCEPTS] [SYNTAX] [LIBRARIES] [SAMPLES] [ERRORS] [INDEX]