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
|
//
// Generated by JTB 1.3.2
//
package kanga.syntaxtree;
/**
* Grammar production:
* f0 -> Label()
* f1 -> "["
* f2 -> IntegerLiteral()
* f3 -> "]"
* f4 -> "["
* f5 -> IntegerLiteral()
* f6 -> "]"
* f7 -> "["
* f8 -> IntegerLiteral()
* f9 -> "]"
* f10 -> StmtList()
* f11 -> "END"
*/
public class Procedure implements Node {
public Label f0;
public NodeToken f1;
public IntegerLiteral f2;
public NodeToken f3;
public NodeToken f4;
public IntegerLiteral f5;
public NodeToken f6;
public NodeToken f7;
public IntegerLiteral f8;
public NodeToken f9;
public StmtList f10;
public NodeToken f11;
public Procedure(Label n0, NodeToken n1, IntegerLiteral n2, NodeToken n3, NodeToken n4, IntegerLiteral n5, NodeToken n6, NodeToken n7, IntegerLiteral n8, NodeToken n9, StmtList n10, NodeToken n11) {
f0 = n0;
f1 = n1;
f2 = n2;
f3 = n3;
f4 = n4;
f5 = n5;
f6 = n6;
f7 = n7;
f8 = n8;
f9 = n9;
f10 = n10;
f11 = n11;
}
public Procedure(Label n0, IntegerLiteral n1, IntegerLiteral n2, IntegerLiteral n3, StmtList n4) {
f0 = n0;
f1 = new NodeToken("[");
f2 = n1;
f3 = new NodeToken("]");
f4 = new NodeToken("[");
f5 = n2;
f6 = new NodeToken("]");
f7 = new NodeToken("[");
f8 = n3;
f9 = new NodeToken("]");
f10 = n4;
f11 = new NodeToken("END");
}
public void accept(kanga.visitor.Visitor v) {
v.visit(this);
}
public <R,A> R accept(kanga.visitor.GJVisitor<R,A> v, A argu) {
return v.visit(this,argu);
}
public <R> R accept(kanga.visitor.GJNoArguVisitor<R> v) {
return v.visit(this);
}
public <A> void accept(kanga.visitor.GJVoidVisitor<A> v, A argu) {
v.visit(this,argu);
}
}
|
