#ifndef _WORM_H_INCLUDED_
#define _WORM_H_INCLUDED_
///////////////////////////////////////////////////////////////////////////////
//                                                         
// Worm.h
// ---------
// Dragon scanner generator interface defintion
//                                                         
// Design and Implementation by Bjoern Lemke               
//                       
// (C)opyright 2000-2007 Bjoern Lemke
//
// 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, 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; see the file COPYING.  If not, write to
// the Free Software Foundation, 59 Temple Place - Suite 330,
// Boston, MA 02111-1307, USA.
//
// INTERFACE MODULE
//
// Class: Worm
// 
// Description: regular expression analysis, optimization and generation of FSM
//
///////////////////////////////////////////////////////////////////////////////

// BASE INCLUDES
#include <lfc/Chain.h>
#include <lfc/TreeT.h>

// DRAGON INCLUDES
#include "FSMState.h"
#include "FSMTransition.h"

class Worm {

 public:
    
  Worm(const Chain& regExp, const Chain& token);
  ~Worm();
  
  void makeOptimalDEA(); 

  void printTables();

 
  TreeT<FSMState> &getStateTable();
  TreeT<FSMTransition> &getTransitionTable();
  
 private:    
    
  TreeT<FSMState> _stateTable;
  TreeT<FSMTransition> _transTable;
  
  void parseRegElement(int startState, int endState);
  
  Chain _reg;
  int _i;
  int _nextState;
  
};



#endif




