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
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
|
namespace antlr3 {
template<class ImplTraits, class ElementType>
RewriteRuleElementStream<ImplTraits, ElementType>::RewriteRuleElementStream(TreeAdaptorType* adaptor,
const char* description)
{
this->init(adaptor, description);
}
template<class ImplTraits, class ElementType>
RewriteRuleElementStream<ImplTraits, ElementType>::RewriteRuleElementStream(TreeAdaptorType* adaptor,
const char* description,
const ElementType* oneElement)
{
this->init(adaptor, description);
if( oneElement != NULL )
this->add( oneElement );
}
template<class ImplTraits, class ElementType>
RewriteRuleElementStream<ImplTraits, ElementType>::RewriteRuleElementStream(TreeAdaptorType* adaptor,
const char* description,
const ElementsType& elements)
: m_elements(elements)
{
this->init(adaptor, description);
}
template<class ImplTraits, class ElementType>
void RewriteRuleElementStream<ImplTraits, ElementType>::init(TreeAdaptorType* adaptor,
const char* description)
{
m_adaptor = adaptor;
m_cursor = 0;
m_dirty = false;
}
template<class ImplTraits>
RewriteRuleTokenStream<ImplTraits>::RewriteRuleTokenStream(TreeAdaptorType* adaptor,
const char* description)
//: BaseType(adaptor, description)
{
}
template<class ImplTraits>
RewriteRuleTokenStream<ImplTraits>::RewriteRuleTokenStream(TreeAdaptorType* adaptor,
const char* description,
const TokenType* oneElement)
//: BaseType(adaptor, description, oneElement)
{
}
template<class ImplTraits>
RewriteRuleTokenStream<ImplTraits>::RewriteRuleTokenStream(TreeAdaptorType* adaptor,
const char* description,
const ElementsType& elements)
//: BaseType(adaptor, description, elements)
{
}
template<class ImplTraits>
RewriteRuleSubtreeStream<ImplTraits>::RewriteRuleSubtreeStream(TreeAdaptorType* adaptor,
const char* description)
//: BaseType(adaptor, description)
{
}
template<class ImplTraits>
RewriteRuleSubtreeStream<ImplTraits>::RewriteRuleSubtreeStream(TreeAdaptorType* adaptor,
const char* description,
TreeTypePtr& oneElement)
//: BaseType(adaptor, description, oneElement)
{
}
template<class ImplTraits>
RewriteRuleSubtreeStream<ImplTraits>::RewriteRuleSubtreeStream(TreeAdaptorType* adaptor,
const char* description,
const ElementsType& elements)
//: BaseType(adaptor, description, elements)
{
}
/*
template<class ImplTraits>
RewriteRuleNodeStream<ImplTraits>::RewriteRuleNodeStream(TreeAdaptorType* adaptor,
const char* description)
: BaseType(adaptor, description)
{
}
template<class ImplTraits>
RewriteRuleNodeStream<ImplTraits>::RewriteRuleNodeStream(TreeAdaptorType* adaptor,
const char* description,
TokenType* oneElement)
: BaseType(adaptor, description, oneElement)
{
}
template<class ImplTraits>
RewriteRuleNodeStream<ImplTraits>::RewriteRuleNodeStream(TreeAdaptorType* adaptor,
const char* description,
const ElementsType& elements)
: BaseType(adaptor, description, elements)
{
}
*/
template<class ImplTraits, class ElementType>
void RewriteRuleElementStream<ImplTraits, ElementType>::reset()
{
m_cursor = 0;
m_dirty = true;
}
template<class ImplTraits, class ElementType>
void RewriteRuleElementStream<ImplTraits, ElementType>::add(ElementType* el)
{
if ( el== NULL )
return;
m_elements.push_back(el);
}
template<class ImplTraits, class ElementType>
ElementType* RewriteRuleElementStream<ImplTraits, ElementType>::_next()
{
ANTLR_UINT32 n = this->size();
if (n == 0)
{
// This means that the stream is empty
return NULL; // Caller must cope with this (TODO throw RewriteEmptyStreamException)
}
// Traversed all the available elements already?
if ( m_cursor >= n) // out of elements?
{
if (n == 1)
{
// Special case when size is single element, it will just dup a lot
//return this->toTree(m_singleElement);
return this->toTree(m_elements.at(0));
}
// Out of elements and the size is not 1, so we cannot assume
// that we just duplicate the entry n times (such as ID ent+ -> ^(ID ent)+)
// This means we ran out of elements earlier than was expected.
//
return NULL; // Caller must cope with this (TODO throw RewriteEmptyStreamException)
}
// More than just a single element so we extract it from the
// vector.
ElementType* t = this->toTree(m_elements.at(m_cursor));
m_cursor++;
return t;
}
template<class ImplTraits, class ElementType>
ElementType
RewriteRuleElementStream<ImplTraits, ElementType>::nextTree()
{
ANTLR_UINT32 n = this->size();
if ( m_dirty || ( (m_cursor >=n) && (n==1)) )
{
// if out of elements and size is 1, dup
ElementType* el = this->_next();
return this->dup(el);
}
// test size above then fetch
ElementType* el = this->_next();
return el;
}
/*
template<class ImplTraits, class SuperType>
typename RewriteRuleElementStream<ImplTraits, SuperType>::TokenType*
RewriteRuleElementStream<ImplTraits, SuperType>::nextToken()
{
return this->_next();
}
template<class ImplTraits, class SuperType>
typename RewriteRuleElementStream<ImplTraits, SuperType>::TokenType*
RewriteRuleElementStream<ImplTraits, SuperType>::next()
{
ANTLR_UINT32 s;
s = this->size();
if ( (m_cursor >= s) && (s == 1) )
{
TreeTypePtr el;
el = this->_next();
return this->dup(el);
}
return this->_next();
}
*/
template<class ImplTraits, class ElementType>
ElementType*
RewriteRuleElementStream<ImplTraits, ElementType>::dup( ElementType* element)
{
return dupImpl(element);
}
template<class ImplTraits, class ElementType>
ElementType*
RewriteRuleElementStream<ImplTraits, ElementType>::dupImpl( typename ImplTraits::CommonTokenType* element)
{
return NULL; // TODO throw here
}
template<class ImplTraits, class ElementType>
ElementType*
RewriteRuleElementStream<ImplTraits, ElementType>::dupImpl( typename ImplTraits::TreeTypePtr element)
{
return m_adaptor->dupTree(element);
}
template<class ImplTraits>
typename RewriteRuleSubtreeStream<ImplTraits>::TreeTypePtr
RewriteRuleSubtreeStream<ImplTraits>::dup(TreeTypePtr element)
{
return this->dupTree(element);
}
template<class ImplTraits>
typename RewriteRuleSubtreeStream<ImplTraits>::TreeTypePtr
RewriteRuleSubtreeStream<ImplTraits>::dupTree(TreeTypePtr element)
{
return BaseType::m_adaptor->dupNode(element);
}
template<class ImplTraits, class ElementType>
ElementType*
RewriteRuleElementStream<ImplTraits, ElementType>::toTree( ElementType* element)
{
return element;
}
/*
template<class ImplTraits>
typename RewriteRuleNodeStream<ImplTraits>::TreeTypePtr
RewriteRuleNodeStream<ImplTraits>::toTree(TreeTypePtr element)
{
return this->toTreeNode(element);
}
template<class ImplTraits>
typename RewriteRuleNodeStream<ImplTraits>::TreeTypePtr
RewriteRuleNodeStream<ImplTraits>::toTreeNode(TreeTypePtr element)
{
return BaseType::m_adaptor->dupNode(element);
}
*/
template<class ImplTraits, class ElementType>
bool RewriteRuleElementStream<ImplTraits, ElementType>::hasNext()
{
if ( !m_elements.empty() && m_cursor < m_elements.size())
{
return true;
}
else
{
return false;
}
}
template<class ImplTraits >
typename RewriteRuleTokenStream<ImplTraits>::TreeTypePtr
RewriteRuleTokenStream<ImplTraits>::nextNode()
{
TokenType *Token = this->nextToken();
//return BaseType::m_adaptor->create(Token);
return m_adaptor->create(Token);
}
/*
template<class ImplTraits>
typename RewriteRuleTokenStream<ImplTraits>::TreeTypePtr
RewriteRuleTokenStream<ImplTraits>::nextNodeToken()
{
return BaseType::m_adaptor->create(this->_next());
}
*/
/// Number of elements available in the stream
///
template<class ImplTraits, class ElementType>
ANTLR_UINT32 RewriteRuleElementStream<ImplTraits, ElementType>::size()
{
return (ANTLR_UINT32)(m_elements.size());
}
template<class ImplTraits, class ElementType>
typename RewriteRuleElementStream<ImplTraits, ElementType>::StringType
RewriteRuleElementStream<ImplTraits, ElementType>::getDescription()
{
if ( m_elementDescription.empty() )
{
m_elementDescription = "<unknown source>";
}
return m_elementDescription;
}
template<class ImplTraits, class ElementType>
RewriteRuleElementStream<ImplTraits, ElementType>::~RewriteRuleElementStream()
{
// Before placing the stream back in the pool, we
// need to clear any vector it has. This is so any
// free pointers that are associated with the
// entries are called. However, if this particular function is called
// then we know that the entries in the stream are definitely
// tree nodes. Hence we check to see if any of them were nilNodes as
// if they were, we can reuse them.
//
// We have some elements to traverse
//
for (ANTLR_UINT32 i = 0; i < m_elements.size(); i++)
{
ElementType *tree = m_elements.at(i);
//if ( (tree != NULL) && tree->isNilNode() )
{
// Had to remove this for now, check is not comprehensive enough
// tree->reuse(tree);
}
}
m_elements.clear();
}
template<class ImplTraits>
typename RewriteRuleTokenStream<ImplTraits>::TokenType*
RewriteRuleTokenStream<ImplTraits>::nextToken()
{
return this->_next();
}
template<class ImplTraits>
typename RewriteRuleSubtreeStream<ImplTraits>::TreeTypePtr
RewriteRuleSubtreeStream<ImplTraits>::nextNode(TreeTypePtr element)
{
//System.out.println("nextNode: elements="+elements+", singleElement="+((Tree)singleElement).toStringTree());
ANTLR_UINT32 n = this->size();
if ( BaseType::m_dirty || (BaseType::m_cursor>=n && n==1) ) {
// if out of elements and size is 1, dup (at most a single node
// since this is for making root nodes).
TreeTypePtr el = this->_next();
return BaseType::m_adaptor->dupNode(el);
}
// test size above then fetch
TreeType *tree = this->_next();
while (BaseType::m_adaptor.isNil(tree) && BaseType::m_adaptor.getChildCount(tree) == 1)
tree = BaseType::m_adaptor->getChild(tree, 0);
//System.out.println("_next="+((Tree)tree).toStringTree());
TreeType *el = BaseType::m_adaptor->dupNode(tree); // dup just the root (want node here)
return el;
}
}
|
