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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
package compiler
import (
"os"
"reflect"
"testing"
)
func TestParser(t *testing.T) {
rune2Byte := func(char rune, index int) byte {
return []byte(string(char))[index]
}
symPos := func(n uint8) symbolPosition {
return newSymbolPosition(n, false)
}
endPos := func(n uint8) symbolPosition {
return newSymbolPosition(n, true)
}
root, symTab, err := parse(map[int][]byte{
1: []byte("(a|b)*abb"),
})
if err != nil {
t.Fatal(err)
}
if root == nil {
t.Fatal("root of AST is nil")
}
printAST(os.Stdout, root, "", "", false)
{
expectedAST := genConcatNode(
newRepeatNode(
newAltNode(
newSymbolNodeWithPos(rune2Byte('a', 0), symPos(1)),
newSymbolNodeWithPos(rune2Byte('b', 0), symPos(2)),
),
),
newSymbolNodeWithPos(rune2Byte('a', 0), symPos(3)),
newSymbolNodeWithPos(rune2Byte('b', 0), symPos(4)),
newSymbolNodeWithPos(rune2Byte('b', 0), symPos(5)),
newEndMarkerNodeWithPos(1, endPos(6)),
)
testAST(t, expectedAST, root)
}
{
followTab := genFollowTable(root)
if followTab == nil {
t.Fatal("follow table is nil")
}
expectedFollowTab := followTable{
1: newSymbolPositionSet().add(symPos(1)).add(symPos(2)).add(symPos(3)),
2: newSymbolPositionSet().add(symPos(1)).add(symPos(2)).add(symPos(3)),
3: newSymbolPositionSet().add(symPos(4)),
4: newSymbolPositionSet().add(symPos(5)),
5: newSymbolPositionSet().add(endPos(6)),
}
testFollowTable(t, expectedFollowTab, followTab)
}
{
entry := func(v byte) byteRange {
return byteRange{
from: v,
to: v,
}
}
expectedSymTab := &symbolTable{
symPos2Byte: map[symbolPosition]byteRange{
symPos(1): entry(byte('a')),
symPos(2): entry(byte('b')),
symPos(3): entry(byte('a')),
symPos(4): entry(byte('b')),
symPos(5): entry(byte('b')),
},
endPos2ID: map[symbolPosition]int{
endPos(6): 1,
},
}
testSymbolTable(t, expectedSymTab, symTab)
}
}
func testAST(t *testing.T, expected, actual astNode) {
t.Helper()
aTy := reflect.TypeOf(actual)
eTy := reflect.TypeOf(expected)
if eTy != aTy {
t.Fatalf("AST node type is mismatched; want: %v, got: %v", eTy, aTy)
}
if actual == nil {
return
}
switch e := expected.(type) {
case *symbolNode:
a := actual.(*symbolNode)
if a.pos != e.pos {
t.Fatalf("symbol position is mismatched; want: %v, got: %v", e.pos, a.pos)
}
case *endMarkerNode:
a := actual.(*endMarkerNode)
if a.pos != e.pos {
t.Fatalf("symbol position is mismatched; want: %v, got: %v", e.pos, a.pos)
}
}
eLeft, eRight := expected.children()
aLeft, aRight := actual.children()
testAST(t, eLeft, aLeft)
testAST(t, eRight, aRight)
}
func testFollowTable(t *testing.T, expected, actual followTable) {
if len(actual) != len(expected) {
t.Errorf("unexpected number of the follow table entries; want: %v, got: %v", len(expected), len(actual))
}
for ePos, eSet := range expected {
aSet, ok := actual[ePos]
if !ok {
t.Fatalf("follow entry is not found; position: %v, follow: %v", ePos, eSet)
}
if aSet.hash() != eSet.hash() {
t.Fatalf("follow entry of position %v is mismatched; want: %v, got: %v", ePos, aSet, eSet)
}
}
}
func testSymbolTable(t *testing.T, expected, actual *symbolTable) {
t.Helper()
if len(actual.symPos2Byte) != len(expected.symPos2Byte) {
t.Errorf("unexpected symPos2Byte entries; want: %v entries, got: %v entries", len(expected.symPos2Byte), len(actual.symPos2Byte))
}
for ePos, eByte := range expected.symPos2Byte {
byte, ok := actual.symPos2Byte[ePos]
if !ok {
t.Errorf("a symbol position entry was not found: %v -> %v", ePos, eByte)
continue
}
if byte.from != eByte.from || byte.to != eByte.to {
t.Errorf("unexpected symbol position entry; want: %v -> %v, got: %v -> %v", ePos, eByte, ePos, byte)
}
}
if len(actual.endPos2ID) != len(expected.endPos2ID) {
t.Errorf("unexpected endPos2ID entries; want: %v entries, got: %v entries", len(expected.endPos2ID), len(actual.endPos2ID))
}
for ePos, eID := range expected.endPos2ID {
id, ok := actual.endPos2ID[ePos]
if !ok {
t.Errorf("an end position entry was not found: %v -> %v", ePos, eID)
continue
}
if id != eID {
t.Errorf("unexpected end position entry; want: %v -> %v, got: %v -> %v", ePos, eID, ePos, id)
}
}
}
|
