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
165
166
167
168
169
170
171
172
173
174
175
|
package main
func parseReplacement(l *RuneReader) (output []TransducerOutput) {
loop: for {
r := l.next()
switch r {
case eof:
panic("Missing closing \"")
case '"':
break loop
case '$':
slot := l.next()
if slot == eof {
panic("Missing slot character")
}
output = append(output, TransducerReplacementLoad(slot))
default:
output = append(output, TransducerReplacementRune(r))
}
}
return output
}
func parseRangeSubex(l *RuneReader) map[rune]rune {
parts := make(map[rune]rune)
var froms []rune
var hasTo bool
for {
fromsStart := l.next()
if fromsStart == ']' {
hasTo = false
break
} else if fromsStart == '=' {
hasTo = true
break
}
var fromsEnd rune
if l.accept("-") {
fromsEnd = l.next()
if fromsEnd == ']' || fromsEnd == '=' {
l.rewind()
fromsEnd = fromsStart
}
} else {
fromsEnd = fromsStart
}
for i := fromsStart; i <= fromsEnd; i += 1 {
froms = append(froms, i)
}
}
if len(froms) == 0 {
panic("Missing from part of range expression")
}
var tos []rune
if hasTo {
for {
tosStart := l.next()
if tosStart == ']' {
break
}
var tosEnd rune
if l.accept("-") {
tosEnd = l.next()
if tosEnd == ']' {
l.rewind()
tosEnd = tosStart
}
} else {
tosEnd = tosStart
}
for i := tosStart; i <= tosEnd; i += 1 {
tos = append(tos, i)
}
}
} else {
tos = froms
}
if len(tos) == 0 {
panic("Missing to part of range expression")
}
for i, from := range froms {
parts[from] = tos[i % len(tos)]
}
return parts
}
func parseSubex(l *RuneReader, minPower int) SubexAST {
var lhs SubexAST
r := l.next()
switch r {
case eof:
return nil
case '(':
lhs = parseSubex(l, 0)
if !l.accept(")") {
panic("Missing matching )")
}
case '[':
rangeParts := parseRangeSubex(l)
lhs = SubexASTRange {rangeParts}
case ')', '*', '-', '|', '!', '?', ';':
l.rewind()
return nil
case '$':
slot := l.next()
if slot == eof {
panic("Missing slot character")
}
match := parseSubex(l, 100)
if match == nil {
panic("Missing regex for store")
}
lhs = SubexASTStore{
match: match,
slot: slot,
}
case '"':
replacement := parseReplacement(l)
lhs = SubexASTOutput{replacement}
case '.':
lhs = SubexASTCopyAny{}
default:
lhs = SubexASTCopyRune(r)
}
loop: for {
if minPower <= 0 {
next := parseSubex(l, 1)
if next != nil {
lhs = SubexASTConcat{lhs, next}
continue loop
}
}
r := l.next()
switch {
case r == '*' && minPower <= 8:
lhs = SubexASTMaximise{lhs}
case r == '-' && minPower <= 8:
lhs = SubexASTMinimise{lhs}
case r == '!' && minPower <= 8:
lhs = SubexASTTry{lhs}
case r == '?' && minPower <= 8:
lhs = SubexASTMaybe{lhs}
case r == '|' && minPower <= 4:
rhs := parseSubex(l, 5)
if rhs == nil {
panic("Missing subex after |")
}
lhs = SubexASTOr{lhs, rhs}
case r == ';' && minPower <= 2:
rhs := parseSubex(l, 3)
if rhs == nil {
panic("Missing subex after ;")
}
lhs = SubexASTJoin{
content: lhs,
delimiter: rhs,
}
default:
l.rewind()
break loop
}
}
return lhs
}
func parse(input string) SubexAST {
l := RuneReader {
input: input,
pos: 0,
width: 0,
}
return parseSubex(&l, 0)
}
|
