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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
/*
Copyright 2020 Kyle Gunger
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 tparse
func getClosing(start string) string {
switch start {
case "{":
return "}"
case "[":
return "]"
case "(":
return ")"
}
return ""
}
// Parse a list of values
func parseValueList(tokens *[]Token, tok, max int) (Node, int) {
out := Node{Data: Token{Type: 10, Data: "vlist"}}
var tmp Node
for ;tok < max; {
t := (*tokens)[tok]
switch t.Type {
case LINESEP:
return out, tok
case DELIMIT:
switch t.Data {
case "}", ")", "]":
return out, tok
default:
mx := findClosing(tokens, tok)
if mx > -1 {
tmp, tok = parseValue(tokens, tok, mx + 1)
out.Sub = append(out.Sub, tmp)
} else {
errOut("Failed to find closing delim within list of values", t)
}
}
case INLNSEP:
tok++
fallthrough
default:
tmp, tok = parseValue(tokens, tok, max)
out.Sub = append(out.Sub, tmp)
}
}
return out, tok
}
// Parse list of parameters
func parseParamList(tokens *[]Token, tok, max int) (Node, int) {
out := Node{Data: Token{Type: 10, Data: "plist"}}
var tmp Node
if isTypeThenValue(tokens, tok, max) {
tmp, tok = parseType(tokens, tok, max, true)
out.Sub = append(out.Sub, tmp)
tmp, tok = parseValue(tokens, tok, max)
out.Sub = append(out.Sub, tmp)
} else {
errOut("Error: no initial type in parameter list", (*tokens)[tok])
}
for ; tok < max; {
t := (*tokens)[tok]
switch t.Type {
case LINESEP:
fallthrough
case DELIMIT:
return out, tok
case INLNSEP:
tok++
}
if isTypeThenValue(tokens, tok, max) {
tmp, tok = parseType(tokens, tok, max, true)
out.Sub = append(out.Sub, tmp)
} else {
tmp, tok = parseValue(tokens, tok, max)
out.Sub = append(out.Sub, tmp)
}
}
return out, tok
}
// Parse a list of types
func parseTypeList(tokens *[]Token, tok, max int) (Node, int) {
out := Node{Data: Token{Type: 10, Data: "tlist"}}
var tmp Node
for ; tok < max; {
t := (*tokens)[tok]
switch t.Type {
case LINESEP:
fallthrough
case DELIMIT:
return out, tok
case INLNSEP:
tok++
}
tmp, tok = parseType(tokens, tok, max, true)
out.Sub = append(out.Sub, tmp)
}
return out, tok
}
func parseStatementList(tokens *[]Token, tok, max int) (Node, int) {
out := Node{}
out.Data = Token{Type: 10, Data: "slist"}
var tmp Node
if (*tokens)[tok].Data == ")" || (*tokens)[tok].Data == "}" || (*tokens)[tok].Data == "]" {
return out, tok
}
tmp, tok = parseStatement(tokens, tok, max)
out.Sub = append(out.Sub, tmp)
for ; tok < max; {
t := (*tokens)[tok]
switch t.Type {
case DELIMIT:
return out, tok
case LINESEP:
tok++
tmp, tok = parseStatement(tokens, tok, max)
out.Sub = append(out.Sub, tmp)
default:
errOut("Error: unexpected token when parsing a list of statements", t)
}
}
return out, tok
}
|
