Logo Search packages:      
Sourcecode: lttoolbox version File versions  Download package

MatchState.H

/*
 * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
 *
 * 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 _MATCHSTATE_
#define _MATCHSTATE_

#include <map>
#include <set>
#include <string>
#include <vector>

#include <lttoolbox/MatchNode.H>

using namespace std;

/**
 * Class to represent the current state of transducer processing 
 */
00034 class MatchState
{
private:
  static int const BUF_LIMIT;
  MatchNode **state;
  int first;
  int last;

  /**
   * The current state of transducer processing
   */
//  slist<MatchNode *> state;

  /**
   * Copy function
   * @param s the state to be copied
   */
  void copy(MatchState const &s);

  /**
   * Destroy function
   */
  void destroy();

  
  void applySymbol(MatchNode *pnode, int const symbol);
public:
  /**
   * Constructor
   */
  MatchState();

  /**
   * Destructor
   */
  ~MatchState();

  /**
   * Copy constructor
   * @param s the state to be copied
   */
  MatchState(MatchState const &s);

  /**
   * Assignment operator
   * @param s the state to be assigned
   * @return the object that results from the assignation
   */
  MatchState & operator =(MatchState const &s);
  
  /**
   * Number of alive transductions
   * @return the size
   */
  int size() const;

  /**
   * step = apply + epsilonClosure
   * @param input the input symbol
   */
  void step(int const input);
  
  /**
   * step = apply + epsilonClosure
   * @param input the input symbol
   * @param alt the alternative input symbol
   */
  void step(int const input, int const alt);

  /**
   * Init the state with the initial node and empty output
   * @param initial the initial node of the transducer
   */
  void init(MatchNode *initial);

  int classifyFinals(map<MatchNode *, int> const &final_class) const;

  void debug();
  
  void clear();
  
};

#endif

Generated by  Doxygen 1.6.0   Back to index