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
|
/*
* [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.Debug
{
using Obsolete = System.ObsoleteAttribute;
using ITreeAdaptor = Antlr.Runtime.Tree.ITreeAdaptor;
using ITreeNodeStream = Antlr.Runtime.Tree.ITreeNodeStream;
/** <summary>
* Debug any tree node stream. The constructor accepts the stream
* and a debug listener. As node stream calls come in, debug events
* are triggered.
* </summary>
*/
public class DebugTreeNodeStream : ITreeNodeStream
{
protected IDebugEventListener dbg;
protected ITreeAdaptor adaptor;
protected ITreeNodeStream input;
protected bool initialStreamState = true;
/** <summary>Track the last mark() call result value for use in rewind().</summary> */
protected int lastMarker;
public DebugTreeNodeStream( ITreeNodeStream input,
IDebugEventListener dbg )
{
this.input = input;
this.adaptor = input.TreeAdaptor;
this.input.UniqueNavigationNodes = true;
DebugListener = dbg;
}
#region Properties
public virtual IDebugEventListener DebugListener
{
get
{
return dbg;
}
set
{
dbg = value;
}
}
public virtual int Index
{
get
{
return input.Index;
}
}
public virtual ITokenStream TokenStream
{
get
{
return input.TokenStream;
}
}
public virtual ITreeAdaptor TreeAdaptor
{
get
{
return adaptor;
}
}
public virtual object TreeSource
{
get
{
return input;
}
}
/** <summary>
* It is normally this object that instructs the node stream to
* create unique nav nodes, but to satisfy interface, we have to
* define it. It might be better to ignore the parameter but
* there might be a use for it later, so I'll leave.
* </summary>
*/
public bool UniqueNavigationNodes
{
get
{
return input.UniqueNavigationNodes;
}
set
{
input.UniqueNavigationNodes = value;
}
}
#endregion
public virtual void Consume()
{
object node = input.LT( 1 );
input.Consume();
dbg.ConsumeNode( node );
}
public virtual object this[int i]
{
get
{
return input[i];
}
}
public virtual object LT( int i )
{
object node = input.LT( i );
int ID = adaptor.GetUniqueID( node );
string text = adaptor.GetText( node );
int type = adaptor.GetType( node );
dbg.LT( i, node );
return node;
}
public virtual int LA( int i )
{
object node = input.LT( i );
int ID = adaptor.GetUniqueID( node );
string text = adaptor.GetText( node );
int type = adaptor.GetType( node );
dbg.LT( i, node );
return type;
}
public virtual int Mark()
{
lastMarker = input.Mark();
dbg.Mark( lastMarker );
return lastMarker;
}
public virtual void Rewind( int marker )
{
dbg.Rewind( marker );
input.Rewind( marker );
}
public virtual void Rewind()
{
dbg.Rewind();
input.Rewind( lastMarker );
}
public virtual void Release( int marker )
{
}
public virtual void Seek( int index )
{
// TODO: implement seek in dbg interface
// db.seek(index);
input.Seek( index );
}
public virtual int Count
{
get
{
return input.Count;
}
}
public virtual string SourceName
{
get
{
return TokenStream.SourceName;
}
}
public virtual void ReplaceChildren( object parent, int startChildIndex, int stopChildIndex, object t )
{
input.ReplaceChildren( parent, startChildIndex, stopChildIndex, t );
}
public virtual string ToString( object start, object stop )
{
return input.ToString( start, stop );
}
}
}
|
