FLAT - A finite automata base class River stage zero No dependents

This module is a base finite automata used by NFA and DFA to encompass common functions. It is probably of no use other than to organize the DFA and NFA modules....

ESTRABD/FLAT-Legacy-FA.1 - 22 Mar 2006 03:41:17 GMT

FLAT::Legacy::FA - A finite automata base class River stage zero No dependents

This module is a base finite automata used by NFA and DFA to encompass common functions. It is probably of no use other than to organize the DFA and NFA modules....

ESTRABD/FLAT-Legacy-FA.1 - 22 Mar 2006 03:41:17 GMT

FLAT::Legacy::FA::NFA - A non deterministic finite automata base class River stage zero No dependents

This module implements a non deterministic finite automata, including support for epsilon transitions and conversion to a deterministic finite automata....

ESTRABD/FLAT-Legacy-FA.1 - 22 Mar 2006 03:41:17 GMT

FLAT::Legacy::FA::DFA - A determinisitic finite automata base class River stage zero No dependents

This module is implements a deterministic finite automata, including the testing of strings accepted by the DFA....

ESTRABD/FLAT-Legacy-FA.1 - 22 Mar 2006 03:41:17 GMT

FLAT::Legacy::FA::PFA - A parallel finite automata base class River stage zero No dependents

This module is implements a paralle finite automata, and the conversion of such to a non deterministic finite automata; One key between PFA implementation an PFA & DFA is that the PFA may contain more than one start node since it may depict threads o...

ESTRABD/FLAT-Legacy-FA.1 - 22 Mar 2006 03:41:17 GMT

FLAT::Legacy::FA::RE - A regular expression base class River stage zero No dependents

This module implements a regular expression parser, and supports the conversion of a RE to a deterministic finite automata. A homegrown recursive descent parser is used to build the parse tree, and the method used to conver the regular expression to ...

ESTRABD/FLAT-Legacy-FA.1 - 22 Mar 2006 03:41:17 GMT

FLAT::Legacy::FA::PRE - A regular expression base class River stage zero No dependents

This module implements a parallel regular expression parser, and supports the conversion of a PRE to a parallel finite automata. A homegrown recursive descent parser is used to build the parse tree, and the method used to convert the parallel regular...

ESTRABD/FLAT-Legacy-FA.1 - 22 Mar 2006 03:41:17 GMT

7 results (0.047 seconds)