-
Notifications
You must be signed in to change notification settings - Fork 5.7k
/
ast.go
514 lines (438 loc) · 10.7 KB
/
ast.go
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
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
// CAUTION: Generated by yy - DO NOT EDIT.
// Copyright 2015 The parser Authors. All rights reserved. Use
// of this source code is governed by a BSD-style license that can be found in
// the LICENSE file.
//
// This is a derived work base on the original at
//
// http://pubs.opengroup.org/onlinepubs/009695399/utilities/yacc.html
//
// The original work is
//
// Copyright © 2001-2004 The IEEE and The Open Group, All Rights reserved.
//
// Grammar for the input to yacc.
package parser
import (
"go/token"
)
// Action represents data reduced by production:
//
// Action:
// '{' '}'
type Action struct {
Values []*ActionValue // For backward compatibility.
Token *Token
Token2 *Token
}
func (n *Action) fragment() interface{} { return n }
// String implements fmt.Stringer.
func (n *Action) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *Action) Pos() token.Pos {
return n.Token.Pos()
}
// Definition represents data reduced by productions:
//
// Definition:
// START IDENTIFIER
// | UNION // Case 1
// | LCURL RCURL // Case 2
// | ReservedWord Tag NameList // Case 3
// | ReservedWord Tag // Case 4
// | ERROR_VERBOSE // Case 5
type Definition struct {
Nlist []*Name // For backward compatibility.
Value string
Case int
NameList *NameList
ReservedWord *ReservedWord
Tag *Tag
Token *Token
Token2 *Token
}
func (n *Definition) fragment() interface{} { return n }
// String implements fmt.Stringer.
func (n *Definition) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *Definition) Pos() token.Pos {
switch n.Case {
case 3, 4:
return n.ReservedWord.Pos()
case 0, 1, 2, 5:
return n.Token.Pos()
default:
panic("internal error")
}
}
// DefinitionList represents data reduced by productions:
//
// DefinitionList:
// /* empty */
// | DefinitionList Definition // Case 1
type DefinitionList struct {
Definition *Definition
DefinitionList *DefinitionList
}
func (n *DefinitionList) reverse() *DefinitionList {
if n == nil {
return nil
}
na := n
nb := na.DefinitionList
for nb != nil {
nc := nb.DefinitionList
nb.DefinitionList = na
na = nb
nb = nc
}
n.DefinitionList = nil
return na
}
func (n *DefinitionList) fragment() interface{} { return n.reverse() }
// String implements fmt.Stringer.
func (n *DefinitionList) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *DefinitionList) Pos() token.Pos {
if n == nil {
return 0
}
if p := n.DefinitionList.Pos(); p != 0 {
return p
}
return n.Definition.Pos()
}
// LiteralStringOpt represents data reduced by productions:
//
// LiteralStringOpt:
// /* empty */
// | STRING_LITERAL // Case 1
type LiteralStringOpt struct {
Token *Token
}
func (n *LiteralStringOpt) fragment() interface{} { return n }
// String implements fmt.Stringer.
func (n *LiteralStringOpt) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *LiteralStringOpt) Pos() token.Pos {
if n == nil {
return 0
}
return n.Token.Pos()
}
// Name represents data reduced by productions:
//
// Name:
// IDENTIFIER LiteralStringOpt
// | IDENTIFIER NUMBER LiteralStringOpt // Case 1
type Name struct {
Identifier interface{} // For backward compatibility.
Number int // For backward compatibility.
Case int
LiteralStringOpt *LiteralStringOpt
Token *Token
Token2 *Token
}
func (n *Name) fragment() interface{} { return n }
// String implements fmt.Stringer.
func (n *Name) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *Name) Pos() token.Pos {
return n.Token.Pos()
}
// NameList represents data reduced by productions:
//
// NameList:
// Name
// | NameList Name // Case 1
// | NameList ',' Name // Case 2
type NameList struct {
Case int
Name *Name
NameList *NameList
Token *Token
}
func (n *NameList) reverse() *NameList {
if n == nil {
return nil
}
na := n
nb := na.NameList
for nb != nil {
nc := nb.NameList
nb.NameList = na
na = nb
nb = nc
}
n.NameList = nil
return na
}
func (n *NameList) fragment() interface{} { return n.reverse() }
// String implements fmt.Stringer.
func (n *NameList) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *NameList) Pos() token.Pos {
switch n.Case {
case 0:
return n.Name.Pos()
case 1, 2:
return n.NameList.Pos()
default:
panic("internal error")
}
}
// Precedence represents data reduced by productions:
//
// Precedence:
// /* empty */
// | PREC IDENTIFIER // Case 1
// | PREC IDENTIFIER Action // Case 2
// | Precedence ';' // Case 3
type Precedence struct {
Identifier interface{} // Name string or literal int.
Action *Action
Case int
Precedence *Precedence
Token *Token
Token2 *Token
}
func (n *Precedence) fragment() interface{} { return n }
// String implements fmt.Stringer.
func (n *Precedence) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *Precedence) Pos() token.Pos {
switch n.Case {
case 0:
return 0
case 3:
if p := n.Precedence.Pos(); p != 0 {
return p
}
return n.Token.Pos()
case 1, 2:
return n.Token.Pos()
default:
panic("internal error")
}
}
// ReservedWord represents data reduced by productions:
//
// ReservedWord:
// TOKEN
// | LEFT // Case 1
// | RIGHT // Case 2
// | NONASSOC // Case 3
// | TYPE // Case 4
// | PRECEDENCE // Case 5
type ReservedWord struct {
Case int
Token *Token
}
func (n *ReservedWord) fragment() interface{} { return n }
// String implements fmt.Stringer.
func (n *ReservedWord) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *ReservedWord) Pos() token.Pos {
return n.Token.Pos()
}
// Rule represents data reduced by productions:
//
// Rule:
// C_IDENTIFIER RuleItemList Precedence
// | '|' RuleItemList Precedence // Case 1
type Rule struct {
Body []interface{} // For backward compatibility.
Name *Token
Case int
Precedence *Precedence
RuleItemList *RuleItemList
Token *Token
}
func (n *Rule) fragment() interface{} { return n }
// String implements fmt.Stringer.
func (n *Rule) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *Rule) Pos() token.Pos {
return n.Token.Pos()
}
// RuleItemList represents data reduced by productions:
//
// RuleItemList:
// /* empty */
// | RuleItemList IDENTIFIER // Case 1
// | RuleItemList Action // Case 2
// | RuleItemList STRING_LITERAL // Case 3
type RuleItemList struct {
Action *Action
Case int
RuleItemList *RuleItemList
Token *Token
}
func (n *RuleItemList) reverse() *RuleItemList {
if n == nil {
return nil
}
na := n
nb := na.RuleItemList
for nb != nil {
nc := nb.RuleItemList
nb.RuleItemList = na
na = nb
nb = nc
}
n.RuleItemList = nil
return na
}
func (n *RuleItemList) fragment() interface{} { return n.reverse() }
// String implements fmt.Stringer.
func (n *RuleItemList) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *RuleItemList) Pos() token.Pos {
switch n.Case {
case 0:
return 0
case 2:
if p := n.RuleItemList.Pos(); p != 0 {
return p
}
return n.Action.Pos()
case 1, 3:
if p := n.RuleItemList.Pos(); p != 0 {
return p
}
return n.Token.Pos()
default:
panic("internal error")
}
}
// RuleList represents data reduced by productions:
//
// RuleList:
// C_IDENTIFIER RuleItemList Precedence
// | RuleList Rule // Case 1
type RuleList struct {
Case int
Precedence *Precedence
Rule *Rule
RuleItemList *RuleItemList
RuleList *RuleList
Token *Token
}
func (n *RuleList) reverse() *RuleList {
if n == nil {
return nil
}
na := n
nb := na.RuleList
for nb != nil {
nc := nb.RuleList
nb.RuleList = na
na = nb
nb = nc
}
n.RuleList = nil
return na
}
func (n *RuleList) fragment() interface{} { return n.reverse() }
// String implements fmt.Stringer.
func (n *RuleList) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *RuleList) Pos() token.Pos {
switch n.Case {
case 1:
return n.RuleList.Pos()
case 0:
return n.Token.Pos()
default:
panic("internal error")
}
}
// Specification represents data reduced by production:
//
// Specification:
// DefinitionList "%%" RuleList Tail
type Specification struct {
Defs []*Definition // For backward compatibility.
Rules []*Rule // For backward compatibility.
DefinitionList *DefinitionList
RuleList *RuleList
Tail *Tail
Token *Token
}
func (n *Specification) fragment() interface{} { return n }
// String implements fmt.Stringer.
func (n *Specification) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *Specification) Pos() token.Pos {
if p := n.DefinitionList.Pos(); p != 0 {
return p
}
return n.Token.Pos()
}
// Tag represents data reduced by productions:
//
// Tag:
// /* empty */
// | '<' IDENTIFIER '>' // Case 1
type Tag struct {
Token *Token
Token2 *Token
Token3 *Token
}
func (n *Tag) fragment() interface{} { return n }
// String implements fmt.Stringer.
func (n *Tag) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *Tag) Pos() token.Pos {
if n == nil {
return 0
}
return n.Token.Pos()
}
// Tail represents data reduced by productions:
//
// Tail:
// "%%"
// | /* empty */ // Case 1
type Tail struct {
Value string
Token *Token
}
func (n *Tail) fragment() interface{} { return n }
// String implements fmt.Stringer.
func (n *Tail) String() string {
return prettyString(n)
}
// Pos reports the position of the first component of n or zero if it's empty.
func (n *Tail) Pos() token.Pos {
if n == nil {
return 0
}
return n.Token.Pos()
}