-
Notifications
You must be signed in to change notification settings - Fork 0
/
walk.go
90 lines (67 loc) · 1.37 KB
/
walk.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
/*
* Copyright (c) 2023, Dana Burkart <dana.burkart@gmail.com>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
package ast
func Walk(v Visitor, node ASTNode) {
if v.Visit(node); v == nil {
return
}
switch n := node.(type) {
case *QueryNode:
Walk(v, n.Quantifier)
if n.Identifier != nil {
Walk(v, n.Identifier)
}
if n.Topic != nil {
Walk(v, n.Topic)
}
if n.TimePredicate != nil {
Walk(v, n.TimePredicate)
}
if n.DataPipeline != nil {
Walk(v, n.DataPipeline)
}
case *QuantifierNode:
if n.TimeQuantity != nil {
Walk(v, n.TimeQuantity)
}
case *TopicSelectorNode:
// Skip, leaf node
case *TimePredicateNode:
Walk(v, n.Begin)
if n.End != nil {
Walk(v, n.End)
}
case *TimeExpressionNode:
Walk(v, n.Whence)
if n.Quantity != nil {
Walk(v, n.Quantity)
}
case *TimeWhenceNode:
// Skip, leaf node
case *BinaryOpNode:
Walk(v, n.Left)
Walk(v, n.Right)
case *UnaryOpNode:
Walk(v, n.Operand)
case *TimespanNode, *IdentifierNode, *NumberNode, *StringNode, *TupleElementNode:
// Skip, leaf nodes
case *TupleNode:
for _, e := range n.Elements {
Walk(v, e)
}
case *DataPipelineNode:
for _, s := range n.Stages {
Walk(v, s)
}
case *DataFunctionNode:
Walk(v, n.Expression)
case *BuiltinFunctionNode:
Walk(v, n.Expression)
default:
panic("Unexpected ASTNode passed to Walk")
}
v.Visit(nil)
}