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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef ADC_CPP_CALLF_HXX
#define ADC_CPP_CALLF_HXX
// USED SERVICES
/** This represents a function to be called, if a specific kind of token
arrives in the semantic parser.
@descr This class is only to be used as member of PeStatus<PE>.
@template PE
The owning ParseEnvironment.
@see PeStatus, ParseEnvironment
*/
template <class PE>
class CallFunction
{
public:
typedef void (PE::*F_Tok)(const char *);
CallFunction(
F_Tok i_f2Call,
INT16 i_nTokType );
F_Tok GetF() const;
INT16 TokType() const;
private:
// DATA
F_Tok f2Call;
INT16 nTokType;
};
/** One state within a ParseEnvironment.
@template PE
The owning ParseEnvironment.
*/
template <class PE>
class PeStatus
{
public:
typedef typename CallFunction<PE>::F_Tok F_Tok;
PeStatus(
PE & i_rMyPE,
uintt i_nSize,
F_Tok * i_pFuncArray,
INT16 * i_pTokTypeArray,
F_Tok i_pDefault );
virtual ~PeStatus();
virtual void Call_Handler(
INT16 i_nTokTypeId,
const char * i_sTokenText ) const;
private:
bool CheckForCall(
uintt i_nPos,
INT16 i_nTokTypeId,
const char * i_sTokenText ) const;
PE * pMyPE;
std::vector< CallFunction<PE> >
aBranches;
F_Tok fDefault;
};
template <class PE>
class PeStatusArray
{
public:
typedef typename PE::E_State State;
PeStatusArray();
void InsertState(
State i_ePosition,
DYN PeStatus<PE> & let_drState );
~PeStatusArray();
const PeStatus<PE> &
operator[](
State i_ePosition ) const;
void SetCur(
State i_eCurState );
const PeStatus<PE> &
Cur() const;
private:
DYN PeStatus<PE> * aStati[PE::size_of_states];
State eState;
};
// IMPLEMENTATION
// CallFunction
template <class PE>
CallFunction<PE>::CallFunction( F_Tok i_f2Call,
INT16 i_nTokType )
: f2Call(i_f2Call),
nTokType(i_nTokType)
{
}
template <class PE>
inline typename CallFunction<PE>::F_Tok
CallFunction<PE>::GetF() const
{
return f2Call;
}
template <class PE>
inline INT16
CallFunction<PE>::TokType() const
{
return nTokType;
}
// PeStatus
template <class PE>
PeStatus<PE>::PeStatus( PE & i_rMyPE,
uintt i_nSize,
F_Tok * i_pFuncArray,
INT16 * i_pTokTypeArray,
F_Tok i_fDefault )
: pMyPE(&i_rMyPE),
fDefault(i_fDefault)
{
aBranches.reserve(i_nSize);
for ( uintt i = 0; i < i_nSize; ++i )
{
// csv_assert(i > 0 ? i_pTokTypeArray[i] > i_pTokTypeArray[i-1] : true);
aBranches.push_back( CallFunction<PE>( i_pFuncArray[i], i_pTokTypeArray[i]) );
} // end for
}
template <class PE>
PeStatus<PE>::~PeStatus()
{
}
template <class PE>
void
PeStatus<PE>::Call_Handler( INT16 i_nTokTypeId,
const char * i_sTokenText ) const
{
uintt nSize = aBranches.size();
uintt nPos = nSize / 2;
if ( i_nTokTypeId < aBranches[nPos].TokType() )
{
for ( --nPos; intt(nPos) >= 0; --nPos )
{
if (CheckForCall(nPos, i_nTokTypeId, i_sTokenText))
return;
}
}
else
{
for ( ; nPos < nSize; ++nPos )
{
if (CheckForCall(nPos, i_nTokTypeId, i_sTokenText))
return;
}
}
(pMyPE->*fDefault)(i_sTokenText);
}
template <class PE>
bool
PeStatus<PE>::CheckForCall( uintt i_nPos,
INT16 i_nTokTypeId,
const char * i_sTokenText ) const
{
if ( aBranches[i_nPos].TokType() == i_nTokTypeId )
{
(pMyPE->*aBranches[i_nPos].GetF())(i_sTokenText);
return true;
}
return false;
}
// PeStatusArray
template <class PE>
PeStatusArray<PE>::PeStatusArray()
: eState(PE::size_of_states)
{
memset(aStati, 0, sizeof aStati);
}
template <class PE>
void
PeStatusArray<PE>::InsertState( State i_ePosition,
DYN PeStatus<PE> & let_drState )
{
csv_assert(aStati[i_ePosition] == 0);
aStati[i_ePosition] = &let_drState;
}
template <class PE>
PeStatusArray<PE>::~PeStatusArray()
{
int i_max = PE::size_of_states;
for (int i = 0; i < i_max; i++)
{
delete aStati[i];
} // end for
}
template <class PE>
inline const PeStatus<PE> &
PeStatusArray<PE>::operator[]( State i_ePosition ) const
{
csv_assert( uintt(i_ePosition) < PE::size_of_states );
csv_assert( aStati[i_ePosition] != 0 );
return *aStati[i_ePosition];
}
template <class PE>
inline void
PeStatusArray<PE>::SetCur( State i_eCurState )
{
eState = i_eCurState;
}
template <class PE>
const PeStatus<PE> &
PeStatusArray<PE>::Cur() const
{
return (*this)[eState];
}
#define SEMPARSE_CREATE_STATUS(penv, state, default_function) \
pStati->InsertState( state, \
*new PeStatus<penv>( \
*this, \
sizeof( stateT_##state ) / sizeof (INT16), \
stateF_##state, \
stateT_##state, \
&penv::default_function ) )
#endif
|
