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
|
/*
[The "BSD license"]
Copyright (c) 2005-2009 Terence Parr
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.
*/
package org.antlr.runtime;
/** The most common stream of tokens where every token is buffered up
* and tokens are filtered for a certain channel (the parser will only
* see these tokens).
*
* Even though it buffers all of the tokens, this token stream pulls tokens
* from the tokens source on demand. In other words, until you ask for a
* token using consume(), LT(), etc. the stream does not pull from the lexer.
*
* The only difference between this stream and BufferedTokenStream superclass
* is that this stream knows how to ignore off channel tokens. There may be
* a performance advantage to using the superclass if you don't pass
* whitespace and comments etc. to the parser on a hidden channel (i.e.,
* you set $channel instead of calling skip() in lexer rules.)
*
* @see org.antlr.runtime.UnbufferedTokenStream
* @see org.antlr.runtime.BufferedTokenStream
*/
public class CommonTokenStream extends BufferedTokenStream {
/** Skip tokens on any channel but this one; this is how we skip whitespace... */
protected int channel = Token.DEFAULT_CHANNEL;
public CommonTokenStream() { ; }
public CommonTokenStream(TokenSource tokenSource) {
super(tokenSource);
}
public CommonTokenStream(TokenSource tokenSource, int channel) {
this(tokenSource);
this.channel = channel;
}
/** Always leave p on an on-channel token. */
public void consume() {
if ( p == -1 ) setup();
p++;
sync(p);
while ( tokens.get(p).getChannel()!=channel ) {
p++;
sync(p);
}
}
protected Token LB(int k) {
if ( k==0 || (p-k)<0 ) return null;
int i = p;
int n = 1;
// find k good tokens looking backwards
while ( n<=k ) {
// skip off-channel tokens
i = skipOffTokenChannelsReverse(i-1);
n++;
}
if ( i<0 ) return null;
return tokens.get(i);
}
public Token LT(int k) {
//System.out.println("enter LT("+k+")");
if ( p == -1 ) setup();
if ( k == 0 ) return null;
if ( k < 0 ) return LB(-k);
int i = p;
int n = 1; // we know tokens[p] is a good one
// find k good tokens
while ( n<k ) {
// skip off-channel tokens
i = skipOffTokenChannels(i+1);
n++;
}
if ( i>range ) range = i;
return tokens.get(i);
}
/** Given a starting index, return the index of the first on-channel
* token.
*/
protected int skipOffTokenChannels(int i) {
sync(i);
while ( tokens.get(i).getChannel()!=channel ) { // also stops at EOF (it's onchannel)
i++;
sync(i);
}
return i;
}
protected int skipOffTokenChannelsReverse(int i) {
while ( i>=0 && ((Token)tokens.get(i)).getChannel()!=channel ) {
i--;
}
return i;
}
public void reset() {
super.reset();
p = skipOffTokenChannels(0);
}
protected void setup() {
p = 0;
sync(0);
int i = 0;
while ( tokens.get(i).getChannel()!=channel ) {
i++;
sync(i);
}
p = i;
}
/** Count EOF just once. */
public int getNumberOfOnChannelTokens() {
int n = 0;
fill();
for (int i = 0; i < tokens.size(); i++) {
Token t = tokens.get(i);
if ( t.getChannel()==channel ) n++;
if ( t.getType()==Token.EOF ) break;
}
return n;
}
/** Reset this token stream by setting its token source. */
public void setTokenSource(TokenSource tokenSource) {
super.setTokenSource(tokenSource);
channel = Token.DEFAULT_CHANNEL;
}
}
|
