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
|
package parser
import "github.com/gnolang/parscan/scanner"
type Node struct {
Child []*Node // sub-tree nodes
*scanner.Token // token at origin of the node
Kind // Node kind, depends on the language spec
}
// TODO: remove it in favor of Walk2
func (n *Node) Walk(in, out func(*Node) bool) (stop bool) {
if in != nil && !in(n) {
return true
}
for _, child := range n.Child {
if child.Walk(in, out) {
return
}
}
if out != nil {
stop = !out(n)
}
return
}
// Idem to walk, but also propagates the ancestor of visited node and child index.
func (n *Node) Walk2(a *Node, i int, in, out func(*Node, *Node, int) bool) (stop bool) {
if in != nil && !in(n, a, i) {
return true
}
for j, child := range n.Child {
if child.Walk2(n, j, in, out) {
return
}
}
if out != nil {
stop = !out(n, a, i)
}
return
}
func (n *Node) RemoveChild(i int) {
n.Child = append(n.Child[:i], n.Child[i+1:]...)
}
func (n *Node) InsertChild(node *Node, i int) {
n.Child = append(n.Child[:i+1], n.Child[i:]...)
n.Child[i] = node
}
|
