mirror of
git://git.savannah.nongnu.org/eliot.git
synced 2025-01-18 10:26:15 +01:00
e7a8d01a8d
There are too many change to list properly, here is an overview of the main changes: - the dictionary is now in C++ - the dictionary has a new format, where it is possible to specify the letters, their points, their frequency, ... It is backwards compatible. - Eliot now supports non-ASCII characters everywhere - i18n of the compdic, listdic, regexpmain binaries - i18n of the wxWidgets interface (now in english by default)
94 lines
2.6 KiB
C++
94 lines
2.6 KiB
C++
/*****************************************************************************
|
|
* Eliot
|
|
* Copyright (C) 2005-2007 Antoine Fraboulet
|
|
* Authors: Antoine Fraboulet <antoine.fraboulet @@ free.fr>
|
|
*
|
|
* 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*****************************************************************************/
|
|
|
|
/**
|
|
* \file automaton.h
|
|
* \brief (Non)Deterministic Finite Automaton for Regexp
|
|
* \author Antoine Fraboulet
|
|
* \date 2005
|
|
*/
|
|
|
|
#ifndef _DIC_AUTOMATON_H_
|
|
#define _DIC_AUTOMATON_H_
|
|
|
|
class AutomatonHelper;
|
|
|
|
class Automaton
|
|
{
|
|
public:
|
|
/// Constructor
|
|
/**
|
|
* Build a static deterministic finite automaton from
|
|
* "init_state", "ptl" and "PS" given by the parser
|
|
*/
|
|
Automaton(int init_state, int *ptl, int *PS, struct search_RegE_list_t *iList);
|
|
|
|
/// Destructor
|
|
~Automaton();
|
|
|
|
/**
|
|
* Get the number of states in the automaton.
|
|
* @returns number of states
|
|
*/
|
|
int getNbStates() const { return m_nbStates; }
|
|
|
|
/**
|
|
* Query the id of the init state.
|
|
* @returns init state id
|
|
*/
|
|
int getInitId() const { return m_init; }
|
|
|
|
/**
|
|
* Query the acceptor flag for the given state
|
|
* @return true/false
|
|
*/
|
|
bool accept(int state) const { return m_acceptors[state]; }
|
|
|
|
/**
|
|
* Return the next state when the transition is taken
|
|
* @returns next state id (1 <= id <= nstate, 0 = invalid id)
|
|
*/
|
|
int getNextState(int start, char l) const
|
|
{
|
|
return m_transitions[start][(int)l];
|
|
}
|
|
|
|
/**
|
|
* Dump the automaton into a file (for debugging purposes)
|
|
*/
|
|
void dump(const string &iFileName) const;
|
|
|
|
private:
|
|
/// Number of states
|
|
int m_nbStates;
|
|
|
|
/// ID of the init state
|
|
int m_init;
|
|
|
|
/// Array of booleans, one for each state
|
|
bool *m_acceptors;
|
|
|
|
/// Matrix of transitions
|
|
int **m_transitions;
|
|
|
|
void finalize(const AutomatonHelper &a);
|
|
};
|
|
|
|
#endif /* _DIC_AUTOMATON_H_ */
|