-
Notifications
You must be signed in to change notification settings - Fork 329
/
cst.go
88 lines (77 loc) · 2 KB
/
cst.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
// Copyright (C) 2017 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package test
import (
"bytes"
"github.com/google/gapid/core/text/parse"
"github.com/google/gapid/core/text/parse/cst"
)
func Peek(r *parse.Reader, value string) bool {
result := r.String(value)
r.Rollback()
return result
}
func Token(value string) cst.Token {
source := &cst.Source{Filename: "cst_test.api", Runes: bytes.Runes([]byte(value))}
return cst.Token{Source: source, Start: 0, End: len(source.Runes)}
}
func Fragment(tok string) cst.Fragment {
return Token(tok)
}
func Separator(list ...interface{}) cst.Separator {
var sep cst.Separator
for _, e := range list {
if f, ok := e.(cst.Fragment); ok {
sep = append(sep, f)
} else {
sep = append(sep, Fragment(e.(string)))
}
}
return sep
}
func Leaf(v string) cst.Node {
return &cst.Leaf{Token: Token(v)}
}
func asNode(v interface{}) cst.Node {
if n, ok := v.(cst.Node); ok {
return n
}
return Leaf(v.(string))
}
func Branch(nodes ...interface{}) *cst.Branch {
n := &cst.Branch{}
for _, v := range nodes {
c := asNode(v)
n.Children = append(n.Children, c)
}
return n
}
func Node(prefix interface{}, v interface{}, suffix interface{}) cst.Node {
n := asNode(v)
if prefix != nil {
if sep, ok := prefix.(cst.Separator); ok {
n.AddPrefix(sep)
} else {
n.AddPrefix(Separator(prefix))
}
}
if suffix != nil {
if sep, ok := suffix.(cst.Separator); ok {
n.AddSuffix(sep)
} else {
n.AddSuffix(Separator(suffix))
}
}
return n
}