On Wed, 15 Dec 2004, Orton, Yves wrote:
The term "DFA::StateMachine" is like say "Car::Car".
Right.
A DFA is by definition a state machine (it stands for "determinisitic finite state automata"). And after a review of the code IMO using the term DFA is a bad call. Normally "DFA" implies a specific type of implementation of a pattern matcher (as compared to say perls NFA [nondeterministic finite state automata] regex engine).
I disagree. A DFA can be used to implement a pattern matcher, but that's not all. A DFA is just a data structure.
Well that that would make it Data::DFA, but now that I think about it, somehow Algorithm::DFA sounds better to me.
David
