forked from adkennan/logo
/
parse.go
299 lines (251 loc) · 4.92 KB
/
parse.go
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
package main
import (
"bufio"
"io"
"strings"
"unicode"
)
const comment rune = ';'
const escape rune = '\\'
const listStart rune = '['
const listEnd rune = ']'
const groupStart rune = '('
const groupEnd rune = ')'
const literalStart rune = '"'
const newLine rune = '\n'
const thingStart rune = ':'
var wordSeparators = []rune{' ', '\t', newLine, comment, listEnd, groupEnd}
var infixOpChars = []rune{'+', '-', '*', '/', '<', '>', '='}
var listSeparators = []rune{' ', '\t', newLine, comment}
func ParseString(text string) (n Node, err error) {
r := strings.NewReader(text)
return Parse(r)
}
func Parse(r io.Reader) (n Node, err error) {
l := 1
c := 1
rr := bufio.NewReader(r)
var pn Node = nil
var nn Node = nil
for err == nil {
nn, err = parse(rr, &l, &c, false)
if nn != nil {
if pn != nil {
pn.addNode(nn)
for nn.next() != nil {
nn = nn.next()
}
} else {
n = nn
}
pn = nn
}
}
if err == io.EOF {
err = nil
}
return n, err
}
func parse(r *bufio.Reader, line, col *int, inList bool) (n Node, err error) {
err = readSeparator(r, List, line, col)
if err != nil {
return
}
c, _, err := r.ReadRune()
checkNewline(c, line, col)
switch c {
case comment:
err = readComment(r, line, col)
case listStart:
n, err = readList(r, line, col)
case listEnd:
r.UnreadRune()
case groupStart:
n, err = readGroup(r, line, col)
case groupEnd:
r.UnreadRune()
default:
n, err = readWord(r, line, col)
}
return
}
func isSeparator(c rune, nt NodeType) bool {
if nt == Word {
for _, s := range wordSeparators {
if c == s {
return true
}
}
} else {
for _, s := range listSeparators {
if c == s {
return true
}
}
}
return false
}
func isOperator(c rune) bool {
for _, s := range infixOpChars {
if s == c {
return true
}
}
return false
}
func checkNewline(c rune, line, col *int) {
if c == newLine {
(*line)++
(*col) = 1
} else {
(*col)++
}
}
func readSeparator(r *bufio.Reader, nt NodeType, line, col *int) (err error) {
c, _, err := r.ReadRune()
checkNewline(c, line, col)
for err == nil && isSeparator(c, nt) {
c, _, err = r.ReadRune()
checkNewline(c, line, col)
}
if err == nil || err == io.EOF {
r.UnreadRune()
}
return err
}
func readComment(r *bufio.Reader, line, col *int) (err error) {
c, _, err := r.ReadRune()
checkNewline(c, line, col)
for err == nil && c != newLine {
c, _, err = r.ReadRune()
checkNewline(c, line, col)
}
return err
}
func readList(r *bufio.Reader, line, col *int) (n Node, err error) {
n, err = readUntil(r, line, col, listEnd)
if err == nil {
return newListNode(*line, *col, n), nil
}
return nil, err
}
func readGroup(r *bufio.Reader, line, col *int) (n Node, err error) {
n, err = readUntil(r, line, col, groupEnd)
if err == nil {
wn, ok := n.(*WordNode)
if ok {
wn.isFirstOfGroup = true
}
return newGroupNode(*line, *col, n), nil
}
return nil, err
}
func readUntil(r *bufio.Reader, line, col *int, untilChar rune) (n Node, err error) {
var fn Node = nil
var pn Node = nil
var nn Node = nil
var closed bool = false
for {
nn, err = parse(r, line, col, true)
if err != nil {
break
}
if nn != nil {
if pn != nil {
pn.addNode(nn)
}
pn = nn
if fn == nil {
fn = nn
}
}
err = readSeparator(r, List, line, col)
if err != nil {
break
}
c, _, err := r.ReadRune()
if err != nil {
break
}
if c == untilChar {
closed = true
break
}
r.UnreadRune()
}
if err == io.EOF && !closed {
err = io.ErrUnexpectedEOF
}
return fn, err
}
func isNegativeNumber(pc, c rune, r *bufio.Reader) bool {
if c != '-' {
return false
}
if pc != 0 && !isSeparator(pc, Word) {
return false
}
nc, _, _ := r.ReadRune()
r.UnreadRune()
return unicode.IsDigit(nc)
}
func readWord(r *bufio.Reader, line, col *int) (*WordNode, error) {
r.UnreadRune()
chars := make([]rune, 0, 4)
escaped := false
isLiteral := false
var pc rune
var err error
for {
c, _, err := r.ReadRune()
if err != nil {
break
}
if !escaped && isOperator(c) && !isNegativeNumber(pc, c, r) {
if len(chars) == 0 {
chars = append(chars, c)
if c == '<' || c == '>' {
nc, _, err := r.ReadRune()
if err != nil {
break
}
if (c == '<' && (nc == '>' || nc == '=')) ||
(c == '>' && nc == '=') {
chars = append(chars, nc)
} else {
r.UnreadRune()
}
break
}
break
} else {
r.UnreadRune()
break
}
} else {
if len(chars) == 0 && (c == literalStart || unicode.IsDigit(c) || c == '-') {
isLiteral = true
}
if !escaped {
if isSeparator(c, Word) {
r.UnreadRune()
break
}
if c == escape {
escaped = true
continue
}
} else {
escaped = false
}
if len(chars) > 0 || c != literalStart {
chars = append(chars, c)
pc = c
}
}
}
if len(chars) > 0 {
return newWordNode(*line, *col, string(chars), isLiteral), err
}
return nil, err
}