-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathparser_test.go
67 lines (60 loc) · 913 Bytes
/
parser_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
package main
import (
"testing"
)
type TestCase struct {
Case string
Tree Op
}
func TestParser(t *testing.T) {
cases := []TestCase{
{
Case: `+ 1 + 1 2`,
Tree: AddOp{
a: Atom(1),
b: AddOp{a: Atom(1), b: Atom(2)},
},
},
{
Case: `- 5 + 1 3`,
Tree: SubOp{
a: Atom(5),
b: AddOp{a: Atom(1), b: Atom(3)},
},
},
{
Case: `* 1 + 3 - 1 2`,
Tree: MultiplyOp{
a: Atom(1),
b: AddOp{
a: Atom(3),
b: SubOp{
a: Atom(1),
b: Atom(2),
},
},
},
},
{
Case: `+ 1 ( - 3 2 ) uh`,
Tree: AddOp{
a: Atom(1),
b: SubOp{
a: Atom(3),
b: Atom(2),
},
},
},
}
for _, c := range cases {
parser := NewParser(c.Case)
actual, err := parser.Parse()
if err != nil {
t.Fatalf("Nope: %v", err)
}
if actual != c.Tree {
t.Fatalf("%s: expected %v != actual %v",
c.Case, c.Tree, actual)
}
}
}