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
|
#ifndef ANTLR3REWRITESTREAM_HPP
#define ANTLR3REWRITESTREAM_HPP
// [The "BSD licence"]
// Copyright (c) 2005-2009 Gokulakannan Somasundaram, ElectronDB
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// 3. The name of the author may not be used to endorse or promote products
// derived from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
// OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
// IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
// NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
// THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
namespace antlr3 {
/// This is an implementation of a token stream, which is basically an element
/// stream that deals with tokens only.
///
template<class ImplTraits>
class RewriteRuleTokenStream
{
public:
typedef typename ImplTraits::StringType StringType;
typedef typename ImplTraits::AllocPolicyType AllocPolicyType;
typedef typename ImplTraits::TreeAdaptorType TreeAdaptorType;
typedef typename ImplTraits::ParserType ComponentType;
typedef typename ComponentType::StreamType StreamType;
typedef typename ImplTraits::CommonTokenType TokenType;
typedef typename ImplTraits::TreeType TreeType;
typedef typename ImplTraits::TreeTypePtr TreeTypePtr;
typedef typename AllocPolicyType::template VectorType<const TokenType* > ElementsType;
typedef typename ImplTraits::template RecognizerType< StreamType > RecognizerType;
typedef typename ImplTraits::CommonTokenType ElementType;
public:
RewriteRuleTokenStream(TreeAdaptorType* adaptor, const char* description);
RewriteRuleTokenStream(TreeAdaptorType* adaptor, const char* description, const TokenType* oneElement);
RewriteRuleTokenStream(TreeAdaptorType* adaptor, const char* description, const ElementsType& elements);
~RewriteRuleTokenStream();
/// Reset the condition of this stream so that it appears we have
/// not consumed any of its elements. Elements themselves are untouched.
///
void reset();
TreeTypePtr nextNode();
const TokenType* nextToken();
/// TODO copied from RewriteRuleElementStreamType
/// Add a new pANTLR3_BASE_TREE to this stream
///
void add(const ElementType* el);
/// When constructing trees, sometimes we need to dup a token or AST
/// subtree. Dup'ing a token means just creating another AST node
/// around it. For trees, you must call the adaptor.dupTree().
///
ElementType* dup( ElementType* el );
/// Ensure stream emits trees; tokens must be converted to AST nodes.
/// AST nodes can be passed through unmolested.
///
TreeTypePtr toTree(const ElementType* el);
/// Pointer to the tree adaptor in use for this stream
///
TreeAdaptorType* m_adaptor;
ElementType nextTree();
typename ElementsType::iterator _next();
/// Returns true if there is a next element available
///
bool hasNext();
/// Number of elements available in the stream
///
ANTLR_UINT32 size();
/// Returns the description string if there is one available (check for NULL).
///
StringType getDescription();
private:
ElementType* dupImpl(typename ImplTraits::CommonTokenType* el);
ElementType* dupImpl(typename ImplTraits::TreeTypePtr el);
/// Cursor 0..n-1. If singleElement!=NULL, cursor is 0 until you next(),
/// which bumps it to 1 meaning no more elements.
///
typename ElementsType::iterator m_cursor;
/// The element or stream description; usually has name of the token or
/// rule reference that this list tracks. Can include rulename too, but
/// the exception would track that info.
///
StringType m_elementDescription;
/// The list of tokens or subtrees we are tracking
///
ElementsType m_elements;
/// Once a node / subtree has been used in a stream, it must be dup'ed
/// from then on. Streams are reset after sub rules so that the streams
/// can be reused in future sub rules. So, reset must set a dirty bit.
/// If dirty, then next() always returns a dup.
///
bool m_dirty;
};
}
#include "antlr3rewriteruletokenstream.inl"
#endif
|
