I didn't see anything in the referenced code to indicate that it parsed anything. All it does to decide the next state is run a bunch of your test functions to see which one returns true. What your test functions do is up to them.
Re^3: Are state machines just for parsing?
Replies are listed 'Best First'.
One thing I'll note is that use strict isn't used in DFA::Simple. You may want to give it a treatment of that before actually using it. You'd want to rescind it when it calls your functions so that you can pass in function names instead of hard references.