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
|
/*
* [The "BSD licence"]
* Copyright (c) 2005-2008 Terence Parr
* All rights reserved.
*
* Conversion to C#:
* Copyright (c) 2008-2009 Sam Harwell, Pixel Mine, Inc.
* 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 Antlr.Runtime.Tree {
using System.Collections.Generic;
using Antlr.Runtime.Misc;
using StringBuilder = System.Text.StringBuilder;
using NotSupportedException = System.NotSupportedException;
[System.Serializable]
public class CommonTreeNodeStream : LookaheadStream<object>, ITreeNodeStream {
public const int DEFAULT_INITIAL_BUFFER_SIZE = 100;
public const int INITIAL_CALL_STACK_SIZE = 10;
/** <summary>Pull nodes from which tree?</summary> */
object _root;
/** <summary>If this tree (root) was created from a token stream, track it.</summary> */
protected ITokenStream tokens;
/** <summary>What tree adaptor was used to build these trees</summary> */
[System.NonSerialized]
ITreeAdaptor _adaptor;
/** The tree iterator we are using */
TreeIterator _it;
/** <summary>Stack of indexes used for push/pop calls</summary> */
Stack<int> _calls;
/** <summary>Tree (nil A B C) trees like flat A B C streams</summary> */
bool _hasNilRoot = false;
/** <summary>Tracks tree depth. Level=0 means we're at root node level.</summary> */
int _level = 0;
public CommonTreeNodeStream(object tree)
: this(new CommonTreeAdaptor(), tree) {
}
public CommonTreeNodeStream(ITreeAdaptor adaptor, object tree) {
this._root = tree;
this._adaptor = adaptor;
_it = new TreeIterator(adaptor, _root);
}
#region Properties
public virtual string SourceName {
get {
if (TokenStream == null)
return null;
return TokenStream.SourceName;
}
}
public virtual ITokenStream TokenStream {
get {
return tokens;
}
set {
tokens = value;
}
}
public virtual ITreeAdaptor TreeAdaptor {
get {
return _adaptor;
}
set {
_adaptor = value;
}
}
public virtual object TreeSource {
get {
return _root;
}
}
public virtual bool UniqueNavigationNodes {
get {
return false;
}
set {
}
}
#endregion
public virtual void Reset() {
base.Clear();
_it.Reset();
_hasNilRoot = false;
_level = 0;
if (_calls != null)
_calls.Clear();
}
public override object NextElement() {
_it.MoveNext();
object t = _it.Current;
//System.out.println("pulled "+adaptor.getType(t));
if (t == _it.up) {
_level--;
if (_level == 0 && _hasNilRoot) {
_it.MoveNext();
return _it.Current; // don't give last UP; get EOF
}
} else if (t == _it.down) {
_level++;
}
if (_level == 0 && TreeAdaptor.IsNil(t)) {
// if nil root, scarf nil, DOWN
_hasNilRoot = true;
_it.MoveNext();
t = _it.Current; // t is now DOWN, so get first real node next
_level++;
_it.MoveNext();
t = _it.Current;
}
return t;
}
public override bool IsEndOfFile(object o) {
return TreeAdaptor.GetType(o) == CharStreamConstants.EndOfFile;
}
public virtual int LA(int i) {
return TreeAdaptor.GetType(LT(i));
}
/** Make stream jump to a new location, saving old location.
* Switch back with pop().
*/
public virtual void Push(int index) {
if (_calls == null) {
_calls = new Stack<int>();
}
_calls.Push(_p); // save current index
Seek(index);
}
/** Seek back to previous index saved during last push() call.
* Return top of stack (return index).
*/
public virtual int Pop() {
int ret = _calls.Pop();
Seek(ret);
return ret;
}
#region Tree rewrite interface
public virtual void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t) {
if (parent != null) {
TreeAdaptor.ReplaceChildren(parent, startChildIndex, stopChildIndex, t);
}
}
#endregion
public virtual string ToString(object start, object stop) {
// we'll have to walk from start to stop in tree; we're not keeping
// a complete node stream buffer
return "n/a";
}
/** <summary>For debugging; destructive: moves tree iterator to end.</summary> */
public virtual string ToTokenTypeString() {
Reset();
StringBuilder buf = new StringBuilder();
object o = LT(1);
int type = TreeAdaptor.GetType(o);
while (type != TokenTypes.EndOfFile) {
buf.Append(" ");
buf.Append(type);
Consume();
o = LT(1);
type = TreeAdaptor.GetType(o);
}
return buf.ToString();
}
}
}
|
