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
|
/*
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
import "fmt"
// ID 9 = ast thing
func errOut(message string, token Token) {
fmt.Println(message)
fmt.Println(token)
panic(token)
}
func tree(tokens *[]Token, tok, max int) (Node, int) {
out := Node{}
for ; tok < max; tok++ {
//t := (*tokens)[tok]
}
return out, tok
}
func parseList(tokens *[]Token, tok, max int) (Node, int) {
out := Node{}
out.Data = Token{Type: 10, Data: "list"}
for ; tok < max; tok++ {
//t := (*tokens)[tok]
}
return out, tok
}
func parseTypeList(tokens *[]Token, tok, max int) (Node, int) {
out := Node{}
out.Data = Token{Type: 10, Data: "list"}
var tmp Node
for ; tok < max; tok++ {
t := (*tokens)[tok]
switch t.Data {
case ")", "]", "}":
return out, tok
case ",":
tok++
default:
errOut("Error: unexpected token when parsing a list of types", t)
}
tmp, tok = parseType(tokens, tok, max)
out.Sub = append(out.Sub, tmp)
}
return out, tok
}
func parseVoidType(tokens *[]Token, tok, max int) (Node, int) {
out := Node{}
for ; tok < max; tok++ {
//t := (*tokens)[tok]
}
return out, tok
}
func parseType(tokens *[]Token, tok, max int) (Node, int) {
out := Node{}
working := &out
for ; tok < max; tok++ {
t := (*tokens)[tok]
switch t.Type {
case AUGMENT:
if t.Data != "~" && t.Data != "`" {
errOut("Error: unexpected augment token when parsing type", t)
}
working.Data = t
case KEYTYPE:
if t.Data == "void" {
*working, tok = parseVoidType(tokens, tok, max)
} else {
working.Data = t
}
return out, tok
case DEFWORD:
if (*tokens)[tok+1].Data == "(" {
}
case KEYWORD:
if t.Data != "const" && t.Data != "volatile" {
errOut("Error: unexpected keyword when parsing type", t)
}
working.Data = t
default:
errOut("Error: unexpected token when parsing type", t)
}
working.Sub = append(working.Sub, Node{})
working = &(working.Sub[0])
}
return out, tok
}
func parseValue(tokens *[]Token, tok, max int) (Node, int) {
out := Node{}
for ; tok < max; tok++ {
t := (*tokens)[tok]
switch t.Type {
case LITERAL:
case DEFWORD:
case DELIMIT:
}
}
return out, tok
}
// MakeTree creates an AST out of a set of tokens
func MakeTree(tokens *[]Token, file string) Node {
out := Node{}
out.Data = Token{9, file, 0, 0}
out.Parent = &out
tmp := Node{}
working := &tmp
for _, t := range *tokens {
switch t.Type {
case LINESEP:
case DELIMIT:
}
tmp = Node{Data: t}
working.Sub = append(working.Sub, tmp)
}
return out
}
|
