---

deterministic_finite_automaton.hh

/*
*  Name:      deterministic_finite_automaton.hh
*  Author:    Rafael Jesus Alcantara Perez
*  Summary:   Deterministic finite automaton
*  Date:      $Date: 2003/04/14 00:18:31 $
*  Revision:  $Revision: 1.1 $
*
*  Copyright (C) 1999-2002  Rafael Jesus Alcantara Perez <rafa@dedalo-ing.com>
*
*  This program is free software; you can redistribute it and/or modify
*  it under the terms of the GNU General Public License as published by
*  the Free Software Foundation; either version 2 of the License, or
*  (at your option) any later version.
*
*  This program is distributed in the hope that it will be useful,
*  but WITHOUT ANY WARRANTY; without even the implied warranty of
*  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
*  GNU General Public License for more details.
*
*  You should have received a copy of the GNU General Public License
*  along with this program; if not, write to the Free Software
*  Foundation, Inc., 59 Temple Place, Suite 330, Boston,
*  MA 02111-1307, USA.
*/

#ifndef _MPCL_AUTOMATON_DETERMINISTIC_FINITE_AUTOMATON__
#define _MPCL_AUTOMATON_DETERMINISTIC_FINITE_AUTOMATON__

#include <set>
#include "defs.hh"
#include "../util/collection/map.hh"


namespace mpcl
{

  namespace automaton
  {

    using mpcl::util::collection::TMap;
    using std::pair;
    using std::set;

    template <typename TState, typename TEvent>
    class TDeterministicFiniteAutomaton
    {

      protected:

        typedef pair<TState, TEvent>   TPair;

        typedef TMap<TPair, TState>   TTransitionMap;

        typedef set<TState>   TStateSet;

        TState   tCurrentState;

        TStateSet   tFinalStateSet;

        TState   tInitialState;

        TTransitionMap   tTransitionMap;


      public:

        //
        //  C O N S T R U C T O R S
        //

        TDeterministicFiniteAutomaton (void) :
          tCurrentState  ()                  ,
          tFinalStateSet ()                  ,
          tInitialState  ()                  ,
          tTransitionMap ()                  {}

        virtual ~TDeterministicFiniteAutomaton (void) {}

        virtual void move (const TState& rktSTATE)
        {
          tCurrentState = rktSTATE;
        }


      public:

        //
        //  S E L E C T O R S
        //

        TState current (void) const
        {
          return tCurrentState;
        }

        TState initial (void) const
        {
          return tInitialState;
        }

        virtual bool isFinal (const TState& rktSOURCE_STATE) const
        {
          return ( tFinalStateSet.find (rktSOURCE_STATE) != tFinalStateSet.end() );
        }

        const TState& next (const TEvent& rktSOURCE_EVENT) const
          throw (TNotFoundException)
        {
          typename TTransitionMap::const_iterator   I;

          I = tTransitionMap.find (std::make_pair (tCurrentState, rktSOURCE_EVENT));
          if ( I == tTransitionMap.end() )
          {
            throw TNotFoundException ("no next state", __FILE__, __LINE__);
          }
          return I->second;
        }

    };  // class TDeterministicFiniteAutomaton

  }  // namespace automaton

}  // namespace mpcl


#endif  // not _MPCL_AUTOMATON_DETERMINISTIC_FINITE_AUTOMATON__

---