37 lines
722 B
Go
37 lines
722 B
Go
|
package parser
|
||
|
|
|
||
|
|
// Walk traverses an AST in depth-first order: It starts by calling fn(node);
|
||
|
|
// node must not be nil. If f returns true, Walk invokes f recursively for
|
||
|
|
// each of the non-nil children of node, followed by a call of f(nil).
|
||
|
|
func Walk(node Node, fn func(Node) bool) {
|
||
|
|
if !fn(node) {
|
||
|
|
return
|
||
|
|
}
|
||
|
|
|
||
|
|
switch n := node.(type) {
|
||
|
|
case *ObjectList:
|
||
|
|
for _, item := range n.items {
|
||
|
|
Walk(item, fn)
|
||
|
|
}
|
||
|
|
case *ObjectKey:
|
||
|
|
// nothing to do
|
||
|
|
case *ObjectItem:
|
||
|
|
for _, k := range n.keys {
|
||
|
|
Walk(k, fn)
|
||
|
|
}
|
||
|
|
Walk(n.val, fn)
|
||
|
|
case *LiteralType:
|
||
|
|
// nothing to do
|
||
|
|
case *ListType:
|
||
|
|
for _, l := range n.list {
|
||
|
|
Walk(l, fn)
|
||
|
|
}
|
||
|
|
case *ObjectType:
|
||
|
|
for _, l := range n.list {
|
||
|
|
Walk(l, fn)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
fn(nil)
|
||
|
|
}
|