File: visitor.go

package info (click to toggle)
golang-github-antonmedv-expr 1.8.9-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, forky, sid, trixie
  • size: 4,524 kB
  • sloc: makefile: 6
file content (108 lines) | stat: -rw-r--r-- 1,968 bytes parent folder | download
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
package ast

import "fmt"

type Visitor interface {
	Enter(node *Node)
	Exit(node *Node)
}

type walker struct {
	visitor Visitor
}

func Walk(node *Node, visitor Visitor) {
	w := walker{
		visitor: visitor,
	}
	w.walk(node)
}

func (w *walker) walk(node *Node) {
	w.visitor.Enter(node)

	switch n := (*node).(type) {
	case *NilNode:
		w.visitor.Exit(node)
	case *IdentifierNode:
		w.visitor.Exit(node)
	case *IntegerNode:
		w.visitor.Exit(node)
	case *FloatNode:
		w.visitor.Exit(node)
	case *BoolNode:
		w.visitor.Exit(node)
	case *StringNode:
		w.visitor.Exit(node)
	case *ConstantNode:
		w.visitor.Exit(node)
	case *UnaryNode:
		w.walk(&n.Node)
		w.visitor.Exit(node)
	case *BinaryNode:
		w.walk(&n.Left)
		w.walk(&n.Right)
		w.visitor.Exit(node)
	case *MatchesNode:
		w.walk(&n.Left)
		w.walk(&n.Right)
		w.visitor.Exit(node)
	case *PropertyNode:
		w.walk(&n.Node)
		w.visitor.Exit(node)
	case *IndexNode:
		w.walk(&n.Node)
		w.walk(&n.Index)
		w.visitor.Exit(node)
	case *SliceNode:
		if n.From != nil {
			w.walk(&n.From)
		}
		if n.To != nil {
			w.walk(&n.To)
		}
		w.visitor.Exit(node)
	case *MethodNode:
		w.walk(&n.Node)
		for i := range n.Arguments {
			w.walk(&n.Arguments[i])
		}
		w.visitor.Exit(node)
	case *FunctionNode:
		for i := range n.Arguments {
			w.walk(&n.Arguments[i])
		}
		w.visitor.Exit(node)
	case *BuiltinNode:
		for i := range n.Arguments {
			w.walk(&n.Arguments[i])
		}
		w.visitor.Exit(node)
	case *ClosureNode:
		w.walk(&n.Node)
		w.visitor.Exit(node)
	case *PointerNode:
		w.visitor.Exit(node)
	case *ConditionalNode:
		w.walk(&n.Cond)
		w.walk(&n.Exp1)
		w.walk(&n.Exp2)
		w.visitor.Exit(node)
	case *ArrayNode:
		for i := range n.Nodes {
			w.walk(&n.Nodes[i])
		}
		w.visitor.Exit(node)
	case *MapNode:
		for i := range n.Pairs {
			w.walk(&n.Pairs[i])
		}
		w.visitor.Exit(node)
	case *PairNode:
		w.walk(&n.Key)
		w.walk(&n.Value)
		w.visitor.Exit(node)
	default:
		panic(fmt.Sprintf("undefined node type (%T)", node))
	}
}