-
Notifications
You must be signed in to change notification settings - Fork 10
/
expression.go
119 lines (99 loc) · 1.9 KB
/
expression.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
// Copyright 2012-2014, Rolf Veen and contributors.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package ogdl
// NewExpression parses an expression in text format (given in the string) to a Graph,
// in the form of a suitable syntax tree.
//
// expression := expr1 (op2 expr1)*
// expr1 := path | constant | op1 path | op1 constant | '(' expr ')' | op1 '(' expr ')'
// constant ::= quoted | number
func NewExpression(s string) *Graph {
p := newStringParser(s)
p.Expression()
g := p.graphTop(TypeExpression)
g._ast()
return g
}
// Ast reorganizes the expression graph in the form of an abstract syntax tree.
func (g *Graph) ast() {
if g == nil {
return
}
for _, node := range g.Out {
if node.ThisString() == TypeExpression {
node._ast()
} else {
node.ast()
}
}
}
func (g *Graph) _ast() {
if g.Len() < 3 {
return
}
for _, node := range g.Out {
node.ast()
}
var e1, e2 *Graph
for j := 6; j >= 0; j-- {
for i := 0; i < len(g.Out); i++ {
node := g.Out[i]
if precedence(node.ThisString()) == j {
e1 = g.Out[i-1]
e2 = g.Out[i+1]
g.Out = append(g.Out[:i-1], g.Out[i:]...)
g.Out = append(g.Out[:i], g.Out[i+1:]...)
node.Add(e1)
node.Add(e2)
i--
}
}
}
}
// Precedence is same as in Go, except for the missing operators (| << >> & ^ &^)
//
// Assignment operators are given the lowest precedence.
func precedence(s string) int {
switch s {
case "+":
return 4
case "-":
return 4
case "*":
return 5
case "/":
return 5
case "%":
return 5
case "=":
return 0
case "+=":
return 0
case "-=":
return 0
case "*=":
return 0
case "/=":
return 0
case "%=":
return 0
case "==":
return 3
case "!=":
return 3
case ">=":
return 3
case "<=":
return 3
case ">":
return 3
case "<":
return 3
case "||":
return 1
case "&&":
return 2
}
return -1
}