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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
|
package grammar
import (
"fmt"
"urubu/grammar/symbol"
)
type stateAndLRItem struct {
kernelID kernelID
itemID lrItemID
}
type propagation struct {
src *stateAndLRItem
dest []*stateAndLRItem
}
type lalr1Automaton struct {
*lr0Automaton
}
func genLALR1Automaton(lr0 *lr0Automaton, prods *productionSet, first *firstSet) (*lalr1Automaton, error) {
// Set the look-ahead symbol <EOF> to the initial item: [S' → ・S, $]
iniState := lr0.states[lr0.initialState]
iniState.items[0].lookAhead.symbols = map[symbol.Symbol]struct{}{
symbol.SymbolEOF: {},
}
var props []*propagation
for _, state := range lr0.states {
for _, kItem := range state.items {
items, err := genLALR1Closure(kItem, prods, first)
if err != nil {
return nil, err
}
kItem.lookAhead.propagation = true
var propDests []*stateAndLRItem
for _, item := range items {
if item.reducible {
p, ok := prods.findByID(item.prod)
if !ok {
return nil, fmt.Errorf("production not found: %v", item.prod)
}
if p.isEmpty() {
var reducibleItem *lrItem
for _, it := range state.emptyProdItems {
if it.id != item.id {
continue
}
reducibleItem = it
break
}
if reducibleItem == nil {
return nil, fmt.Errorf("reducible item not found: %v", item.id)
}
if reducibleItem.lookAhead.symbols == nil {
reducibleItem.lookAhead.symbols = map[symbol.Symbol]struct{}{}
}
for a := range item.lookAhead.symbols {
reducibleItem.lookAhead.symbols[a] = struct{}{}
}
propDests = append(propDests, &stateAndLRItem{
kernelID: state.id,
itemID: item.id,
})
}
continue
}
nextKID := state.next[item.dottedSymbol]
var nextItemID lrItemID
{
p, ok := prods.findByID(item.prod)
if !ok {
return nil, fmt.Errorf("production not found: %v", item.prod)
}
it, err := newLR0Item(p, item.dot+1)
if err != nil {
return nil, fmt.Errorf("failed to generate an item ID: %v", err)
}
nextItemID = it.id
}
if item.lookAhead.propagation {
propDests = append(propDests, &stateAndLRItem{
kernelID: nextKID,
itemID: nextItemID,
})
} else {
nextState := lr0.states[nextKID]
var nextItem *lrItem
for _, it := range nextState.items {
if it.id != nextItemID {
continue
}
nextItem = it
break
}
if nextItem == nil {
return nil, fmt.Errorf("item not found: %v", nextItemID)
}
if nextItem.lookAhead.symbols == nil {
nextItem.lookAhead.symbols = map[symbol.Symbol]struct{}{}
}
for a := range item.lookAhead.symbols {
nextItem.lookAhead.symbols[a] = struct{}{}
}
}
}
if len(propDests) == 0 {
continue
}
props = append(props, &propagation{
src: &stateAndLRItem{
kernelID: state.id,
itemID: kItem.id,
},
dest: propDests,
})
}
}
err := propagateLookAhead(lr0, props)
if err != nil {
return nil, fmt.Errorf("failed to propagate look-ahead symbols: %v", err)
}
return &lalr1Automaton{
lr0Automaton: lr0,
}, nil
}
func genLALR1Closure(srcItem *lrItem, prods *productionSet, first *firstSet) ([]*lrItem, error) {
items := []*lrItem{}
knownItems := map[lrItemID]map[symbol.Symbol]struct{}{}
knownItemsProp := map[lrItemID]struct{}{}
uncheckedItems := []*lrItem{}
items = append(items, srcItem)
uncheckedItems = append(uncheckedItems, srcItem)
for len(uncheckedItems) > 0 {
nextUncheckedItems := []*lrItem{}
for _, item := range uncheckedItems {
if item.dottedSymbol.IsTerminal() {
continue
}
p, ok := prods.findByID(item.prod)
if !ok {
return nil, fmt.Errorf("production not found: %v", item.prod)
}
var fstSyms []symbol.Symbol
var isFstNullable bool
{
fst, err := first.find(p, item.dot+1)
if err != nil {
return nil, err
}
fstSyms = make([]symbol.Symbol, len(fst.symbols))
i := 0
for s := range fst.symbols {
fstSyms[i] = s
i++
}
if fst.empty {
isFstNullable = true
}
}
ps, _ := prods.findByLHS(item.dottedSymbol)
for _, prod := range ps {
var lookAhead []symbol.Symbol
{
var lookAheadCount int
if isFstNullable {
lookAheadCount = len(fstSyms) + len(item.lookAhead.symbols)
} else {
lookAheadCount = len(fstSyms)
}
lookAhead = make([]symbol.Symbol, lookAheadCount)
i := 0
for _, s := range fstSyms {
lookAhead[i] = s
i++
}
if isFstNullable {
for a := range item.lookAhead.symbols {
lookAhead[i] = a
i++
}
}
}
for _, a := range lookAhead {
newItem, err := newLR0Item(prod, 0)
if err != nil {
return nil, err
}
if items, exist := knownItems[newItem.id]; exist {
if _, exist := items[a]; exist {
continue
}
}
newItem.lookAhead.symbols = map[symbol.Symbol]struct{}{
a: {},
}
items = append(items, newItem)
if knownItems[newItem.id] == nil {
knownItems[newItem.id] = map[symbol.Symbol]struct{}{}
}
knownItems[newItem.id][a] = struct{}{}
nextUncheckedItems = append(nextUncheckedItems, newItem)
}
if isFstNullable {
newItem, err := newLR0Item(prod, 0)
if err != nil {
return nil, err
}
if _, exist := knownItemsProp[newItem.id]; exist {
continue
}
newItem.lookAhead.propagation = true
items = append(items, newItem)
knownItemsProp[newItem.id] = struct{}{}
nextUncheckedItems = append(nextUncheckedItems, newItem)
}
}
}
uncheckedItems = nextUncheckedItems
}
return items, nil
}
func propagateLookAhead(lr0 *lr0Automaton, props []*propagation) error {
for {
changed := false
for _, prop := range props {
srcState, ok := lr0.states[prop.src.kernelID]
if !ok {
return fmt.Errorf("source state not found: %v", prop.src.kernelID)
}
var srcItem *lrItem
for _, item := range srcState.items {
if item.id != prop.src.itemID {
continue
}
srcItem = item
break
}
if srcItem == nil {
return fmt.Errorf("source item not found: %v", prop.src.itemID)
}
for _, dest := range prop.dest {
destState, ok := lr0.states[dest.kernelID]
if !ok {
return fmt.Errorf("destination state not found: %v", dest.kernelID)
}
var destItem *lrItem
for _, item := range destState.items {
if item.id != dest.itemID {
continue
}
destItem = item
break
}
if destItem == nil {
for _, item := range destState.emptyProdItems {
if item.id != dest.itemID {
continue
}
destItem = item
break
}
if destItem == nil {
return fmt.Errorf("destination item not found: %v", dest.itemID)
}
}
for a := range srcItem.lookAhead.symbols {
if _, ok := destItem.lookAhead.symbols[a]; ok {
continue
}
if destItem.lookAhead.symbols == nil {
destItem.lookAhead.symbols = map[symbol.Symbol]struct{}{}
}
destItem.lookAhead.symbols[a] = struct{}{}
changed = true
}
}
}
if !changed {
break
}
}
return nil
}
|