-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathparse.go
65 lines (61 loc) · 1.06 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
package main
import (
"strconv"
"strings"
)
func parseText(tokens []string) *Cons {
parent := &Cons{}
result := parent
var now *Cons
nestCount := 0
var startIndex int
for i, token := range tokens {
switch token {
case "(":
if nestCount == 0 {
startIndex = i
}
nestCount++
case ")":
nestCount--
if nestCount == 0 {
now = &Cons{
parseText(tokens[startIndex+1 : i]),
nil,
}
parent.Cdr = now
parent = now
}
default:
if nestCount == 0 {
now := &Cons{
castToken(token),
nil,
}
parent.Cdr = now
parent = now
}
}
}
return result.Cdr.(*Cons)
}
func castToken(token string) any {
if token == "t" || token == "T" {
return &T{}
}
i, err := strconv.Atoi(token)
if err == nil {
return i
}
f, err := strconv.ParseFloat(token, 64)
if err == nil {
return f
}
return token
}
// ParseText parse string
func ParseText(text string) *Cons {
text = strings.Replace(text, "(", " ( ", -1)
text = strings.Replace(text, ")", " ) ", -1)
return parseText(strings.Fields(text)).Car.(*Cons)
}