FSM::Simple - Flexible Perl implementation of Finite State Machine.

This module contains a class with simple Finite State Machine (FSM) implementation. This is tiny layer for better control of flow in your code. You can create your own subs and add these to the FSM object. Next you can define transitions between thos...

KOSCIELNY/FSM-Simple-0.02 - 03 Feb 2013 19:14:44 GMT - Search in distribution

Set::FA - A Set of Discrete Finite Automata

Set::FA provides a mechanism to define and run a set of DFAs....

RSAVAGE/Set-FA-2.01 - 20 Sep 2016 02:48:16 GMT - Search in distribution

Auto::Mata - A simple, reliable finite state machine

Finite state machines (or automata) are a technique for modeling the workflow of a program as a series of dependent, programmable steps. State machines are useful tools for building software whose behavior can be predicted with a high degree of confi...

JEFFOBER/Auto-Mata-0.08 - 20 Mar 2017 19:02:10 GMT - Search in distribution

Web::MREST - Minimalistic REST server

MREST stands for "minimalistic" or "mechanical" REST server. (Mechanical because it relies on Web::Machine.) Web::MREST provides a fully functional REST server that can be started with a simple command. Without modification, the server provides a set...

SMITHFARM/Web-MREST-0.287 - 25 Feb 2017 08:38:52 GMT - Search in distribution

Document::TocFile - Manage a Table of contents file.

This Class manages a table of contents file. The file is always named .toc and contains formatted records of the following syntax (TocFile Format Version 0.02): 0.02 <dates>-<document_title_section> <pageid> <pagetitle_section> <categorylist> where t...

DALEAMON/Document-0.03-3 - 01 Sep 2008 10:56:14 GMT - Search in distribution

DMA::FSM - A simple Finite State Machine.

There is a single subroutine named FSM in this module. It will run a FSM machine of your choosing. It must contain, and will be started, in state 'S0'. When called, lexical analyzer functions from the state table will be passed a user supplied 'black...

DALEAMON/DMAMisc-1.01-3 - 01 Sep 2008 10:57:40 GMT - Search in distribution

State::Machine - Simple State Machine Implementation

A finite-state machine (FSM) or finite-state automaton (plural: automata), or simply a state machine, is an abstract machine that can be in one of a finite number of states. The machine is in only one state at a time. It can change from one state to ...

AWNCORP/State-Machine-0.07 - 21 Aug 2014 19:04:40 GMT - Search in distribution

Web::Machine::Util - General Utility module

This is just a basic utility module used internally by Web::Machine. There are no real user serviceable parts in here....

DROLSKY/Web-Machine-0.17 - 23 Jun 2016 20:26:04 GMT - Search in distribution

MooseX::FSM - The great new MooseX::FSM!

GORAXE/MooseX-FSM-0.01 - 27 Apr 2009 11:50:14 GMT - Search in distribution

Parse::FSM::Driver - Run-time engine for Parse::FSM parser

This module implements a deterministic top-down parser based on a pre-computed Finite State Machine (FSM). The FSM is generated by Parse::FSM, by reading a BNF-type grammar file and generating a run-time module that includes the state tables. The mod...

PSCUST/Parse-FSM-1.13 - 16 May 2016 19:57:45 GMT - Search in distribution

10 results (0.118 seconds)