forked from xwb1989/sqlparser
-
Notifications
You must be signed in to change notification settings - Fork 0
/
precedence_test.go
112 lines (103 loc) · 2.76 KB
/
precedence_test.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
/*
Copyright 2017 Google Inc.
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 sqlparser
import (
"fmt"
"testing"
)
func readable(node Expr) string {
switch node := node.(type) {
case *OrExpr:
return fmt.Sprintf("(%s or %s)", readable(node.Left), readable(node.Right))
case *AndExpr:
return fmt.Sprintf("(%s and %s)", readable(node.Left), readable(node.Right))
case *BinaryExpr:
return fmt.Sprintf("(%s %s %s)", readable(node.Left), node.Operator, readable(node.Right))
case *IsExpr:
return fmt.Sprintf("(%s %s)", readable(node.Expr), node.Operator)
default:
return String(node)
}
}
func TestAndOrPrecedence(t *testing.T) {
validSQL := []struct {
input string
output string
}{{
input: "select * from a where a=b and c=d or e=f",
output: "((a = b and c = d) or e = f)",
}, {
input: "select * from a where a=b or c=d and e=f",
output: "(a = b or (c = d and e = f))",
}}
for _, tcase := range validSQL {
tree, err := Parse(tcase.input)
if err != nil {
t.Error(err)
continue
}
expr := readable(tree.(*Select).Where.Expr)
if expr != tcase.output {
t.Errorf("Parse: \n%s, want: \n%s", expr, tcase.output)
}
}
}
func TestPlusStarPrecedence(t *testing.T) {
validSQL := []struct {
input string
output string
}{{
input: "select 1+2*3 from a",
output: "(1 + (2 * 3))",
}, {
input: "select 1*2+3 from a",
output: "((1 * 2) + 3)",
}}
for _, tcase := range validSQL {
tree, err := Parse(tcase.input)
if err != nil {
t.Error(err)
continue
}
expr := readable(tree.(*Select).SelectExprs[0].(*AliasedExpr).Expr)
if expr != tcase.output {
t.Errorf("Parse: \n%s, want: \n%s", expr, tcase.output)
}
}
}
func TestIsPrecedence(t *testing.T) {
validSQL := []struct {
input string
output string
}{{
input: "select * from a where a+b is true",
output: "((a + b) is true)",
}, {
input: "select * from a where a=1 and b=2 is true",
output: "(a = 1 and (b = 2 is true))",
}, {
input: "select * from a where (a=1 and b=2) is true",
output: "((a = 1 and b = 2) is true)",
}}
for _, tcase := range validSQL {
tree, err := Parse(tcase.input)
if err != nil {
t.Error(err)
continue
}
expr := readable(tree.(*Select).Where.Expr)
if expr != tcase.output {
t.Errorf("Parse: \n%s, want: \n%s", expr, tcase.output)
}
}
}