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
|
package grammar
import (
"fmt"
)
type followEntry struct {
symbols map[symbol]struct{}
eof bool
}
func newFollowEntry() *followEntry {
return &followEntry{
symbols: map[symbol]struct{}{},
eof: false,
}
}
func (e *followEntry) add(sym symbol) bool {
if _, ok := e.symbols[sym]; ok {
return false
}
e.symbols[sym] = struct{}{}
return true
}
func (e *followEntry) addEOF() bool {
if !e.eof {
e.eof = true
return true
}
return false
}
func (e *followEntry) merge(fst *firstEntry, flw *followEntry) bool {
changed := false
if fst != nil {
for sym := range fst.symbols {
added := e.add(sym)
if added {
changed = true
}
}
}
if flw != nil {
for sym := range flw.symbols {
added := e.add(sym)
if added {
changed = true
}
}
if flw.eof {
added := e.addEOF()
if added {
changed = true
}
}
}
return changed
}
type followSet struct {
set map[symbol]*followEntry
}
func newFollow(prods *productionSet) *followSet {
flw := &followSet{
set: map[symbol]*followEntry{},
}
for _, prod := range prods.getAllProductions() {
if _, ok := flw.set[prod.lhs]; ok {
continue
}
flw.set[prod.lhs] = newFollowEntry()
}
return flw
}
func (flw *followSet) find(sym symbol) (*followEntry, error) {
e, ok := flw.set[sym]
if !ok {
return nil, fmt.Errorf("an entry of FOLLOW was not found; symbol: %s", sym)
}
return e, nil
}
type followComContext struct {
prods *productionSet
first *firstSet
follow *followSet
}
func newFollowComContext(prods *productionSet, first *firstSet) *followComContext {
return &followComContext{
prods: prods,
first: first,
follow: newFollow(prods),
}
}
func genFollowSet(prods *productionSet, first *firstSet) (*followSet, error) {
ntsyms := map[symbol]struct{}{}
for _, prod := range prods.getAllProductions() {
if _, ok := ntsyms[prod.lhs]; ok {
continue
}
ntsyms[prod.lhs] = struct{}{}
}
cc := newFollowComContext(prods, first)
for {
more := false
for ntsym := range ntsyms {
e, err := cc.follow.find(ntsym)
if err != nil {
return nil, err
}
if ntsym.isStart() {
changed := e.addEOF()
if changed {
more = true
}
}
for _, prod := range prods.getAllProductions() {
for i, sym := range prod.rhs {
if sym != ntsym {
continue
}
fst, err := first.find(prod, i+1)
if err != nil {
return nil, err
}
changed := e.merge(fst, nil)
if changed {
more = true
}
if fst.empty {
flw, err := cc.follow.find(prod.lhs)
if err != nil {
return nil, err
}
changed := e.merge(nil, flw)
if changed {
more = true
}
}
}
}
}
if !more {
break
}
}
return cc.follow, nil
}
func genFollowEntry(cc *followComContext, acc *followEntry, ntsym symbol) (bool, error) {
changed := false
if ntsym.isStart() {
added := acc.addEOF()
if added {
changed = true
}
}
for _, prod := range cc.prods.getAllProductions() {
for i, sym := range prod.rhs {
if sym != ntsym {
continue
}
fst, err := cc.first.find(prod, i+1)
if err != nil {
return false, err
}
added := acc.merge(fst, nil)
if added {
changed = true
}
if fst.empty {
flw, err := cc.follow.find(prod.lhs)
if err != nil {
return false, err
}
added := acc.merge(nil, flw)
if added {
changed = true
}
}
}
}
return changed, nil
}
|
