NDFST interpreter
(Nondeterministic Finite State Transducer)
Dafydd Gibbon, 2008-08-12
Input:
Switches:
Trace:
off
on
Direction:
forward
reverse
Relation:
off
on
FSA:
# METADATA # Filename: tones.fst # Author: D. Gibbon, 2008-08-11 # The automaton models the following rules for a two-tone terracing language: # H -> h-constant / # _ # L -> l-constant / # _ # H -> h-upsweep / h _ # L -> l-upstep / h _ # H -> h-downstep / l _ # L -> l-downdrift / l _ # Equivalent regular expression: # H:c ( H:upsw | L:upstp L:dwndr* H:dwnst )* ( L:upst L:dwndr* )? | # L:c ( L:dwnd | H:dwnst H:upswp* L:upstp )* ( H:downst H:upswp* )? initial=q0 terminal=q1,q2 fst= q0,H,h-constant,q1; q0,L,l-constant,q2; q1,H,h-upsweep,q1; q1,L,l-upstep,q2; q2,H,h-downstep,q1; q2,L,l-downdrift,q2
Go:
Other examples...