aboutsummaryrefslogtreecommitdiff
path: root/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/CommonTree.cs
blob: 33f9bda93056e204397f6aa409cea44b0bb28fd4 (plain)
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
/*
 * [The "BSD licence"]
 * Copyright (c) 2011 Terence Parr
 * All rights reserved.
 *
 * Conversion to C#:
 * Copyright (c) 2011 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 ArgumentNullException = System.ArgumentNullException;

    /** <summary>
     *  A tree node that is wrapper for a Token object.  After 3.0 release
     *  while building tree rewrite stuff, it became clear that computing
     *  parent and child index is very difficult and cumbersome.  Better to
     *  spend the space in every tree node.  If you don't want these extra
     *  fields, it's easy to cut them out in your own BaseTree subclass.
     *  </summary>
     */
    [System.Serializable]
    public class CommonTree : BaseTree
    {
        /** <summary>A single token is the payload</summary> */
        private IToken _token;

        /** <summary>
         *  What token indexes bracket all tokens associated with this node
         *  and below?
         *  </summary>
         */
        protected int startIndex = -1;
        protected int stopIndex = -1;

        /** <summary>Who is the parent node of this node; if null, implies node is root</summary> */
        CommonTree parent;

        /** <summary>What index is this node in the child list? Range: 0..n-1</summary> */
        int childIndex = -1;

        public CommonTree()
        {
        }

        public CommonTree( CommonTree node )
            : base( node )
        {
            if (node == null)
                throw new ArgumentNullException("node");

            this.Token = node.Token;
            this.startIndex = node.startIndex;
            this.stopIndex = node.stopIndex;
        }

        public CommonTree( IToken t )
        {
            this.Token = t;
        }

        #region Properties

        public override int CharPositionInLine
        {
            get
            {
                if ( Token == null || Token.CharPositionInLine == -1 )
                {
                    if ( ChildCount > 0 )
                        return Children[0].CharPositionInLine;

                    return 0;
                }
                return Token.CharPositionInLine;
            }

            set
            {
                base.CharPositionInLine = value;
            }
        }

        public override int ChildIndex
        {
            get
            {
                return childIndex;
            }

            set
            {
                childIndex = value;
            }
        }

        public override bool IsNil
        {
            get
            {
                return Token == null;
            }
        }

        public override int Line
        {
            get
            {
                if ( Token == null || Token.Line == 0 )
                {
                    if ( ChildCount > 0 )
                        return Children[0].Line;

                    return 0;
                }

                return Token.Line;
            }

            set
            {
                base.Line = value;
            }
        }

        public override ITree Parent
        {
            get
            {
                return parent;
            }

            set
            {
                parent = (CommonTree)value;
            }
        }

        public override string Text
        {
            get
            {
                if ( Token == null )
                    return null;

                return Token.Text;
            }

            set
            {
            }
        }

        public IToken Token
        {
            get
            {
                return _token;
            }

            set
            {
                _token = value;
            }
        }

        public override int TokenStartIndex
        {
            get
            {
                if ( startIndex == -1 && Token != null )
                    return Token.TokenIndex;

                return startIndex;
            }

            set
            {
                startIndex = value;
            }
        }

        public override int TokenStopIndex
        {
            get
            {
                if ( stopIndex == -1 && Token != null )
                {
                    return Token.TokenIndex;
                }
                return stopIndex;
            }

            set
            {
                stopIndex = value;
            }
        }

        public override int Type
        {
            get
            {
                if ( Token == null )
                    return TokenTypes.Invalid;

                return Token.Type;
            }

            set
            {
            }
        }

        #endregion

        public override ITree DupNode()
        {
            return new CommonTree( this );
        }

        /** <summary>
         *  For every node in this subtree, make sure it's start/stop token's
         *  are set.  Walk depth first, visit bottom up.  Only updates nodes
         *  with at least one token index &lt; 0.
         *  </summary>
         */
        public virtual void SetUnknownTokenBoundaries()
        {
            if ( Children == null )
            {
                if ( startIndex < 0 || stopIndex < 0 )
                    startIndex = stopIndex = Token.TokenIndex;

                return;
            }

            foreach (ITree childTree in Children)
            {
                CommonTree commonTree = childTree as CommonTree;
                if (commonTree == null)
                    continue;

                commonTree.SetUnknownTokenBoundaries();
            }

            if ( startIndex >= 0 && stopIndex >= 0 )
                return; // already set

            if ( Children.Count > 0 )
            {
                ITree firstChild = Children[0];
                ITree lastChild = Children[Children.Count - 1];
                startIndex = firstChild.TokenStartIndex;
                stopIndex = lastChild.TokenStopIndex;
            }
        }

        public override string ToString()
        {
            if (IsNil)
                return "nil";

            if (Type == TokenTypes.Invalid)
                return "<errornode>";

            if (Token == null)
                return string.Empty;

            return Token.Text;
        }
    }
}