summaryrefslogtreecommitdiff
path: root/src/tparse/tree-value.go
blob: 1c7e99c31b94c36ce5d3593da96904a978dc7154 (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
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
/*
	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

// Ops order in TNSL
// Cast/Paren > Address > Get > Inc/Dec > Math > Bitwise > Logic

var UNARY_PRE = map[string]int {
	"~": 0,
	"++": 2,
	"--": 2,
	"!": 6,
	"len": 0,
	"-": 0,
}

var UNARY_POST = map[string]int {
	"`": 0,
	"++": 2,
	"--": 2,
}

var ORDER = map[string]int{
	// Get
	".": 1,

	"is": 2,

	// Multiplication
	"*": 3,
	// Division
	"/": 3,

	// Addition
	"+": 4,
	// Subtraction
	"-": 4,
	
	// Mod
	"%": 5,

	// Bitwise and
	"&": 6,
	// Bitwise or
	"|": 6,
	// Bitwise xor
	"^": 6,

	// Bitwise l-shift
	"<<": 6,
	// Bitwise r-shift
	">>": 6,

	"!&": 6,
	"!|": 6,
	"!^": 6,

	// Boolean and
	"&&": 7,
	// Boolean or
	"||": 7,
	// Truthy equals
	"==": 7,

	// Greater than
	">": 7,
	// Less than
	"<": 7,

	"!&&": 7,
	"!||": 7,
	"!==": 7,

	"!>": 7,
	"!<": 7,

	// Assignement
	"=": 8,
}

// Works? Please test. 
func parseUnaryOps(tokens *[]Token, tok, max int) (Node) {
	var out Node
	var vnode *Node = &out
	val, comp := false, false
	// Pre-value op scan
	for ; tok < max && !val; tok++ {
		t := (*tokens)[tok]
		switch t.Type {
		case DELIMIT:
			
			switch t.Data {
			case "{": // Array or struct evaluation, parenthetical value
				if vnode != &out {
					errOut("Composite values may not use unary operators.", out.Data)
				}
				(*vnode), tok = parseValueList(tokens, tok + 1, max)
				(*vnode).Data.Data = "comp"
				val = true
				comp = true
			default:
				errOut("Unexpected delimiter when parsing value", t)
			}
		case LITERAL, DEFWORD:
			(*vnode).Data = t
			val = true
		case AUGMENT:
			_, prs := UNARY_PRE[t.Data]
			if !prs {
				errOut("Parser bug!  Operator failed to load into AST.", t)
			} else {
				(*vnode) = Node{t, []Node{Node{}}}
				vnode = &((*vnode).Sub[0])
			}
		default:
			errOut("Unexpected token in value declaration", t)
		}
	}

	// Sanity check: make sure there's actually a value here
	if !val {
		errOut("Expected to find value, but there wasn't one", (*tokens)[max - 1])
	}

	// Post-value op scan
	for ; tok < max; tok++ {
		t := (*tokens)[tok]
		var tmp Node
		switch t.Type {
		case DELIMIT:
			switch t.Data {
			case "(": // Function call
				if comp {
					errOut("Composite values can not be called as functions.", t)
				}
				tmp, tok = parseValueList(tokens, tok + 1, max)
				tmp.Data.Data = "call"
			case "[": // Typecasting
				tmp, tok = parseTypeList(tokens, tok + 1, max)
				tmp.Data.Data = "cast"
			case "{": // Indexing
				if comp {
					errOut("Inline composite values can not be indexed.", t)
				}
				tmp, tok = parseValueList(tokens, tok + 1, max)
				tmp.Data.Data = "index"
			default:
				errOut("Unexpected delimiter when parsing value", t)
			}
		case AUGMENT:
			_, prs := UNARY_POST[t.Data]
			if !prs {
				errOut("Parser bug!  Operator failed to load into AST.", t)
			}else if comp {
				errOut("Composite values are not allowed to use unary operators.", t)
			}
			tmp = Node{}
			tmp.Data = t
		default:
			errOut("Unexpected token in value declaration", t)
		}
		(*vnode).Sub = append((*vnode).Sub, tmp)
	}

	return out
}

// Works? Please test.
func parseBinaryOp(tokens *[]Token, tok, max int) (Node) {
	out := Node{}
	first := tok
	var high, highOrder, bincount int = first, 0, 0
	var curl, brak, parn int = 0, 0, 0

	// Find first high-order op
	for ; tok < max; tok++ {
		t := (*tokens)[tok]
		if t.Type == DELIMIT {
			switch t.Data {
			case "{":
				curl++
			case "[":
				brak++
			case "(":
				parn++
			
			case "}":
				curl--
			case "]":
				brak--
			case ")":
				parn--
			}

			if curl < 0 || brak < 0 || parn < 0 {
				if curl > 0 || brak > 0 || parn > 0 {
					errOut("Un-matched closing delimiter when parsing a type.", t)
				}
			}
		} else if t.Type == AUGMENT {
			order, prs := ORDER[t.Data]
			if t.Data == "-" {
				_, prs := ORDER[(*tokens)[tok - 1].Data]
				if prs || (*tokens)[tok - 1].Data == "return" {
					continue
				} else if order > highOrder {
					high, highOrder = tok, order
				}
			} else if prs == false || curl > 0 || brak > 0 || parn > 0 {
				continue
			} else if order > highOrder {
				high, highOrder = tok, order
			}
			// TODO: Add in case for the "is" operator
			bincount++
		}
	}

	out.Data = (*tokens)[high]

	if bincount == 0 {
		// No binops means we have a pure value to parse.  Parse all unary ops around it.
		return parseUnaryOps(tokens, first, max)
	} else {
		
		// Recursive split to lower order operations
		out.Sub = append(out.Sub, parseBinaryOp(tokens, first, high))
		out.Sub = append(out.Sub, parseBinaryOp(tokens, high + 1, max))
	}

	return out
}

// Works? Please test.
func parseValue(tokens *[]Token, tok, max int) (Node, int) {
	first := tok
	var curl, brak, parn, block int = 0, 0, 0, 0

	for ; tok < max; tok++ {
		t := (*tokens)[tok]
		switch t.Type {
		case LINESEP:
			if block > 0 {
				continue
			}
			if curl > 0 || brak > 0 || parn > 0 {
				errOut("Encountered end of statement before all delimiter pairs were closed while looking for the end of a value.", t)
			}
			goto PARSEBIN
		case INLNSEP:
			if curl > 0 || brak > 0 || parn > 0 || block > 0 {
				continue
			}
			goto PARSEBIN
		case DELIMIT:
			switch t.Data {
			case "{":
				curl++
			case "[":
				brak++
			case "(":
				parn++
			
			case "}":
				curl--
			case "]":
				brak--
			case ")":
				parn--
			
			case "/;":
				_, prs := ORDER[(*tokens)[tok - 1].Data]
				if !prs && block == 0 {
					goto PARSEBIN
				}
				block++
			case ";/":
				
				if block > 0 {
					block--
				}
				fallthrough
			case ";;":
				if block > 1 {
					continue
				} else if block == 1 {
					errOut("Error: redefinition of a block from a block as a value is not permitted.", t)
				}
				if curl > 0 || brak > 0 || parn > 0 {
					errOut("Delimeter pairs not closed before end of value", t)
				}
				goto PARSEBIN
			}

			// TODO: Support blocks as values

			if curl < 0 || brak < 0 || parn < 0 {
				if curl > 0 || brak > 0 || parn > 0 {
					errOut("Un-matched closing delimiter when parsing a value.", t)
				} else if curl + brak + parn == -1 {
					goto PARSEBIN
				} else {
					errOut("Strange bracket values detected when parsing value.  Possibly a parser bug.", t)
				}
			}
		}
	}

	PARSEBIN:

	return parseBinaryOp(tokens, first, tok), tok
}

// Works? Please test.
func parseTypeParams(tokens *[]Token, tok, max int) (Node, int) {
	out := Node{Data: (*tokens)[tok]}
	tok++

	for ; tok < max; tok++{
		t := (*tokens)[tok]
		tmp := Node{}
		switch t.Type {
		case DELIMIT:
			if tok < max {
				if t.Data == "(" {
					tmp, tok = parseTypeList(tokens, tok + 1, max)
					tmp.Data.Data = "()"
				} else if t.Data == "[" {
					tmp, tok = parseTypeList(tokens, tok + 1, max)
					tmp.Data.Data = "[]"
				} else if t.Data == ")" || t.Data == "]" || t.Data == "}" {
					// End of type
					//errOutV("Test", tok, max, t)
					goto DONE
				} else {
					errOut("Error: unexpected delimeter when parsing type", t)
				}
			} else {
				errOut("Error: unexpected end of file when parsing type", t)
			}

		default:
			// End of type
			goto DONE
		}

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

	DONE:

	return out, tok
}

// TODO: make sure this actually works
func parseType(tokens *[]Token, tok, max int, param bool) (Node, int) {
	out := Node{Data: Token{Type: 10, Data: "type"}}

	for ; tok < max; tok++ {
		t := (*tokens)[tok]

		var tmp Node
		switch t.Type {
		case AUGMENT:
			if t.Data != "~" {
				errOut("Error: unexpected augment token when parsing type", t)
			}
			tmp.Data = t

		case KEYTYPE:
			if t.Data == "void" {
				tmp, tok = parseTypeParams(tokens, tok, max)
			} else {
				tmp.Data = t
				tok++
			}

			out.Sub = append(out.Sub, tmp)
			
			if param && (*tokens)[tok].Data == "`" {
				tmp = Node{(*tokens)[tok], []Node{}}
				out.Sub = append(out.Sub, tmp)
				tok++
			}
			
			return out, tok
		case DEFWORD:
			if (*tokens)[tok+1].Data == "(" {
				tmp, tok = parseTypeParams(tokens, tok, max)
			} else if (*tokens)[tok+1].Data == "." {
				tmp.Data = t
				out.Sub = append(out.Sub, tmp)
				tok++
				continue
			} else {
				tmp.Data = t
				tok++
			}
			
			out.Sub = append(out.Sub, tmp)

			if param && (*tokens)[tok].Data == "`" {
				tmp = Node{(*tokens)[tok], []Node{}}
				out.Sub = append(out.Sub, tmp)
				tok++
			}

			return out, tok

		case KEYWORD:
			if param && t.Data == "static" {
				// Nonstandard keyword in parameter definition
				errOut("Error: parameter or value types cannot be static", t)
			} else if t.Data != "const" && t.Data != "volatile" && t.Data != "static" {
				// Nonstandard keyword in variable definition
				errOut("Error: unexpected keyword when parsing type", t)
			}
			tmp.Data = t

		case DELIMIT:
			if tok < max-1 {
				if t.Data == "{" {
					// What happens when an array type is defined
					tmp.Data = Token{AUGMENT, "{}", t.Line, t.Char}
					if (*tokens)[tok+1].Data == "}" {
						// Length variable array, add no sub-nodes and increment
						tok++
					} else {
						// Constant length array.  Parse value for length and increment
						var tmp2 Node
						tmp2, tok = parseValueList(tokens, tok + 1, max)
						tmp.Sub = append(tmp.Sub, tmp2)
					}
				} else if t.Data == ")" || t.Data == "]" || t.Data == "}"{
					// End of type
					goto TYPEDONE
				} else {
					errOut("Error: unexpected delimeter when parsing type", t)
				}
			} else {
				// End of file with open delimiter after type parsing has begun
				errOut("Error: unexpected end of file when parsing type", t)
			}

		default:
			goto TYPEDONE
		}

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

	TYPEDONE:

	return out, tok
}

// TODO: Check if this works. This implimentation is probably bad, but I don't care.
func isTypeThenValue(tokens *[]Token, tok, max int) (bool) {
	//TODO: check for a standard type and then a value
	var stage int = 0
	var curl, brak, parn int = 0, 0, 0

	for ; tok < max && stage < 2; tok++ {
		t := (*tokens)[tok]
		switch t.Type {
		case KEYTYPE:
			if curl > 0 || brak > 0 || parn > 0 {
				continue
			} else if stage > 0 {
				errOut("Encountered a keytype where we weren't expecting one (iTTV).", t)
			}
			stage++
		case DEFWORD:
			if curl > 0 || brak > 0 || parn > 0 {
				continue
			}
			stage++
		case LINESEP:
			if curl > 0 || brak > 0 || parn > 0 {
				errOut("Encountered end of statement before all delimiter pairs were closed (iTTV).", t)
			}
			return false
		case INLNSEP:
			if curl > 0 || brak > 0 || parn > 0 {
				continue
			}
			return false
		case DELIMIT:
			switch t.Data {
			case "{":
				curl++
			case "[":
				brak++
			case "(":
				parn++
			
			case "}":
				curl--
			case "]":
				brak--
			case ")":
				parn--
			default:
				return false
			}

			if curl < 0 || brak < 0 || parn < 0 {
				if curl > 0 || brak > 0 || parn > 0 {
					errOut("Un-matched closing delimiter (iTTV).", t)
				} else if curl + brak + parn == -1 {
					return false
				} else {
					errOut("Strange bracket values detected when parsing value.  Possibly a parser bug. (iTTV)", t)
				}
			}
		case AUGMENT:
			switch t.Data {
			case ".":
				if (*tokens)[tok + 1].Type == DEFWORD {
					tok++
				} else {
					errOut("Expected defword after 'get' operator (iTTV).", t)
				}
			case "~":
			case "`":
			default:
				return false
			}
		}
	}

	return stage == 2
}