summaryrefslogtreecommitdiff
path: root/src/tparse/tree-statement.go
blob: cf25085485f7e9f17d9a7195b5bafd976a4b48e1 (plain)
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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
/*
   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

// TODO: re-validate this code.  I forgot if it works or not.
func parseBlock(tokens *[]Token, tok, max int) (Node, int) {
	out, tmp, def, name, sparse := Node{}, Node{}, Node{}, false, false
	out.Data = Token{Type: 10, Data: "block"}
	def.Data = Token{Type: 10, Data: "bdef"}


	for ;tok < max; tok++{
		t := (*tokens)[tok]
		tmp = Node{}
		switch t.Type {
		case DELIMIT:
			if t.Data == "(" {
				if sparse {
					tmp, tok = parseStatementList(tokens, tok + 1, max)
				} else {
					tmp, tok = parseParamList(tokens, tok + 1, max)
				}
				tmp.Data.Data = "()"
				def.Sub = append(def.Sub, tmp)
			} else if t.Data == "[" {
				if sparse {
					tmp, tok = parseStatementList(tokens, tok + 1, max)
				} else {
					tmp, tok = parseType(tokens, tok + 1, max, false)
				}
				tmp.Data.Data = "[]"
				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 "operator":
				name = true
				if (*tokens)[tok+1].Type != AUGMENT && (*tokens)[tok+1].Data != "delete" {
					errOut("You must supply an operator to overload.", t)
				} else if (*tokens)[tok+1].Data == "`" || (*tokens)[tok+1].Data == "~" {
					errOut("You may not overload the following operators: '~', '`'.", t)
				}
				tmp.Data = (*tokens)[tok+1]
				def.Sub = append(def.Sub, tmp)
				tok += 1
			case "else":
				if (*tokens)[tok+1].Data == "if" {
					tok++
				}
				fallthrough
			case "if", "match", "case", "loop":
				name = true
				sparse = true
				fallthrough
			case "export", "inline", "raw", "override":
				tmp.Data = t
				def.Sub = append(def.Sub, tmp)
			case "module", "method":
				if (*tokens)[tok+1].Type != DEFWORD && !name {
					errOut("You must provide a name for a module or method.", t)
				} else if !name {
					tmp.Sub = append(tmp.Sub, Node{(*tokens)[tok+1], []Node{}})
					tok++
				}
				tmp.Data = t
				def.Sub = append(def.Sub, tmp)
				tok++
				goto BREAK
			default:
				errOut("Unexpected keyword in block definition.", t)
			}
		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 + 1, max)
		case "/;", ":;":
			REBLOCK:
			
			tmp, tok = parseBlock(tokens, tok + 1, max)

			if (*tokens)[tok].Data == ";;" {
				out.Sub = append(out.Sub, tmp)
				goto REBLOCK
			} else if (*tokens)[tok].Data == ";/" {
				tok++
			}
		case "/:":
			tmp, tok = parsePreBlock(tokens, tok + 1, max)
		case ":":
			tmp, tok = parsePre(tokens, tok + 1, max)
		default:
			errOut("Error: unexpected token when parsing a code block", t)
		}

		out.Sub = append(out.Sub, tmp)
	}

	return out, tok
}

// This should work once isTypeThenValue properly functions
func parseStatement(tokens *[]Token, tok, max int) (Node, int) {
	out := Node{}
	out.Data = Token{Type: 10, Data: "value"}
	var tmp Node

	// Check for keyword, definition, then if none of those apply, assume it's a value.
	t := (*tokens)[tok]
	if t.Type == KEYWORD && t.Data != "const" && t.Data != "volatile" && t.Data != "static" {
		return keywordStatement(tokens, tok, max)
	} else {
		// do check for definition
		if isTypeThenValue(tokens, tok, max) {
			// if not, parse a value
			return parseDef(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]
	var tmp Node

	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 + 1, max)
			out.Sub = append(out.Sub, tmp)
			tok++
		}

		if (*tokens)[tok].Data != "{" {
			errOut("Could not find struct member list", (*tokens)[tok])
		}

		tmp, tok = parseParamList(tokens, tok + 1, max)
		tok++
	case "enum":
		if (*tokens)[tok].Type != DEFWORD {
			errOut("Expected defword after enum keyword.", (*tokens)[tok])
		}
		tmp.Data = (*tokens)[tok]
		out.Sub = append(out.Sub, tmp)
		tok++
		if (*tokens)[tok].Data == "[" {
			tmp, tok = parseType(tokens, tok + 1, max, false)
			out.Sub = append(out.Sub, tmp)
			tok++
		}

		if (*tokens)[tok].Data != "{" {
			errOut("Could not find enum value list", (*tokens)[tok])
		}

		tmp, tok = parseValueList(tokens, tok + 1, max)
		tok++
	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 "return":
		if (*tokens)[tok].Type == LINESEP || (*tokens)[tok].Data == ";/" {
			return out, tok
		}
		tmp, tok = parseValue(tokens, tok, max)
	case "alloc", "salloc", "realloc":
		// 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
}

// Should work, but none of this is tested.
func parseDef(tokens *[]Token, tok, max int) (Node, int) {
	out := Node{Data: Token{10, "define", 0, 0}}
	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
}