-
Notifications
You must be signed in to change notification settings - Fork 2
/
parser.go
73 lines (67 loc) · 1.22 KB
/
parser.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
package compiler
type node struct {
left *node
right *node
value string
}
var index int
var tokens []string
var length int
// 计算表达式块,包含括号内的表达式或数值
func factor() *node {
token := tokens[index]
index++
switch token {
case exprStart:
expression := expr()
index++ // 移除最后的右括号
return expression
case plus:
value := tokens[index]
index++
return &node{value: value}
case minus:
value := minus + tokens[index]
index++
return &node{value: value}
default:
return &node{value: token}
}
}
// 计算乘除法
func term() *node {
factor1 := factor()
if index == length {
return factor1
}
op := tokens[index]
for op == multiply || op == divide {
index++
factor2 := factor()
factor1 = &node{value: op, left: factor1, right: factor2}
op = tokens[index]
}
return factor1
}
// 计算加减法
func expr() *node {
term1 := term()
if index == length {
return term1
}
op := tokens[index]
for op == plus || op == minus {
index++
term2 := term()
term1 = &node{value: op, left: term1, right: term2}
op = tokens[index]
}
return term1
}
// 语法分析
func parse(input []string) *node {
index = 0
tokens = input
length = len(tokens)
return expr()
}