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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
/*
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 parseBlock(tokens *[]Token, tok, max int) (Node, int) {
out, tmp, def, name := Node{}, Node{}, Node{}, false
out.Data = Token{Type: 10, Data: "block"}
def.Data = Token{Type: 10, Data: "blockdef"}
tok++
for ;tok < max; tok++{
t := (*tokens)[tok]
tmp = Node{}
switch t.Type {
case DELIMIT:
if t.Data == "(" {
tmp, tok = parseValueList(tokens, tok, max)
def.Sub = append(def.Sub, tmp)
} else if t.Data == "[" {
tmp, tok = parseTypeList(tokens, tok, max)
def.Sub = append(def.Sub, tmp)
} else {
goto BREAK
}
case DEFWORD:
if name {
errOut("Unexpected defword, the block has already been given a name or keyword.", t)
}
tmp.Data = t
def.Sub = append(def.Sub, tmp)
name = true
case KEYWORD:
if name {
errOut("Unexpected keyword, the block has already been given a name or keyword.", t)
}
switch t.Data {
case "else":
if (*tokens)[tok+1].Data == "if" {
tmp.Data = Token{KEYWORD, "elif", t.Line, t.Char}
tok++
name = true
continue
}
case "if", "match", "case", "loop":
case "export", "inline", "raw", "override":
}
case LINESEP:
goto BREAK
}
}
BREAK:
out.Sub = append(out.Sub, def)
for ;tok < max; {
t := (*tokens)[tok]
switch t.Data {
case ";/", ";;", ";:":
return out, tok
case ";":
tmp, tok = parseStatement(tokens, tok, max)
case "/;":
REBLOCK:
tmp, tok = parseBlock(tokens, tok, max)
if (*tokens)[tok].Data == ";;" {
out.Sub = append(out.Sub, tmp)
goto REBLOCK
} else if (*tokens)[tok].Data == ";/" {
tok++
}
default:
errOut("Error: unexpected token when parsing a code block", t)
}
out.Sub = append(out.Sub, tmp)
}
return out, tok
}
func parseStatement(tokens *[]Token, tok, max int) (Node, int) {
out := Node{}
out.Data = Token{Type: 11, Data: ";"}
var tmp Node
// Check for keyword, definition, then if none of those apply, assume it's a value.
if (*tokens)[tok].Type == KEYWORD {
tmp, tok = keywordStatement(tokens, tok, max)
out.Sub = append(out.Sub, tmp)
} else {
// do check for definition
if false {
// if not, parse a value
tmp, tok = parseDefinition(tokens, tok, max)
} else {
// if not, parse a value
tmp, tok = parseValue(tokens, tok, max)
}
out.Sub = append(out.Sub, tmp)
}
return out, tok
}
// Works? Please test.
func keywordStatement(tokens *[]Token, tok, max int) (Node, int) {
out := Node{}
out.Data = (*tokens)[tok]
out.IsBlock = false
var tmp Node
tmp.IsBlock = false
if tok + 1 < max {
tok++
} else {
return out, max
}
switch out.Data.Data {
case "raw":
// Something, something... code.
if (*tokens)[tok].Data != "struct" {
errOut("Unexpected use of raw operator in a statement", out.Data)
}
tok++
fallthrough
case "struct":
// Check for defword, (), and {} then dip
if (*tokens)[tok].Type != DEFWORD {
errOut("Expected defword after struct keyword.", (*tokens)[tok])
}
tmp.Data = (*tokens)[tok]
out.Sub = append(out.Sub, tmp)
tok++
if (*tokens)[tok].Data == "(" {
tmp, tok = parseValueList(tokens, tok, max)
out.Sub = append(out.Sub, tmp)
}
if (*tokens)[tok].Data != "{" {
errOut("Could not find struct member list", (*tokens)[tok])
}
tmp, tok = parseValueList(tokens, tok, max)
case "goto", "label":
if (*tokens)[tok].Type != DEFWORD {
errOut("Expected defword after goto or label keyword.", out.Data)
}
tmp.Data = (*tokens)[tok]
tok++
// Check for a defword and dip
case "continue", "break":
if (*tokens)[tok].Type != LITERAL {
return out, tok
}
tmp.Data = (*tokens)[tok]
tok++
// Check for a numerical value and dip
case "alloc", "salloc":
// Parse value list
tmp, tok = parseValueList(tokens, tok, max)
case "delete":
// Parse value list
tmp, tok = parseValueList(tokens, tok, max)
}
out.Sub = append(out.Sub, tmp)
return out, tok
}
func parseDef(tokens *[]Token, tok, max int) (Node, int) {
out := Node{}
out.Data = Token{}
var tmp Node
tmp, tok = parseType(tokens, tok, max, false)
out.Sub = append(out.Sub, tmp)
tmp, tok = parseValueList(tokens, tok, max)
out.Sub = append(out.Sub, tmp)
return out, tok
}
|
