1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/*
* 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, see <http://www.gnu.org/licenses/>.
*/
#ifndef _MATCHSTATE_
#define _MATCHSTATE_
#include <map>
#include <set>
#include <string>
#include <vector>
#include <lttoolbox/match_node.h>
using namespace std;
/**
* Class to represent the current state of transducer processing
*/
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, set<int> const &banned_rules) const;
int classifyFinals(map<MatchNode *, int> const &final_class) const;
void debug();
void clear();
};
#endif
|