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
|
package compiler
import (
"fmt"
"io"
"strings"
"github.com/nihei9/maleeni/compressor"
"github.com/nihei9/maleeni/log"
"github.com/nihei9/maleeni/spec"
)
type compilerOption func(c *compilerConfig) error
func EnableLogging(w io.Writer) compilerOption {
return func(c *compilerConfig) error {
logger, err := log.NewLogger(w)
if err != nil {
return err
}
c.logger = logger
return nil
}
}
type compilerConfig struct {
logger log.Logger
}
func Compile(lexspec *spec.LexSpec, opts ...compilerOption) (*spec.CompiledLexSpec, error) {
err := lexspec.Validate()
if err != nil {
return nil, fmt.Errorf("invalid lexical specification:\n%w", err)
}
config := &compilerConfig{
logger: log.NewNopLogger(),
}
for _, opt := range opts {
err := opt(config)
if err != nil {
return nil, err
}
}
modeEntries, modes, modeNums := groupEntriesByLexMode(lexspec.Entries)
modeSpecs := []*spec.CompiledLexModeSpec{
nil,
}
for i, es := range modeEntries[1:] {
modeName := modes[i+1]
config.logger.Log("Compile %v mode:", modeName)
modeSpec, err := compile(es, modeNums, config)
if err != nil {
return nil, fmt.Errorf("failed to compile in %v mode: %w", modeName, err)
}
modeSpecs = append(modeSpecs, modeSpec)
}
return &spec.CompiledLexSpec{
InitialMode: spec.LexModeNumDefault,
Modes: modes,
Specs: modeSpecs,
}, nil
}
func groupEntriesByLexMode(entries []*spec.LexEntry) ([][]*spec.LexEntry, []spec.LexModeName, map[spec.LexModeName]spec.LexModeNum) {
modes := []spec.LexModeName{
spec.LexModeNameNil,
spec.LexModeNameDefault,
}
modeNums := map[spec.LexModeName]spec.LexModeNum{
spec.LexModeNameNil: spec.LexModeNumNil,
spec.LexModeNameDefault: spec.LexModeNumDefault,
}
lastModeNum := spec.LexModeNumDefault
modeEntries := [][]*spec.LexEntry{
nil,
[]*spec.LexEntry{},
}
for _, e := range entries {
ms := e.Modes
if len(ms) == 0 {
ms = []spec.LexModeName{
spec.LexModeNameDefault,
}
}
for _, mode := range ms {
num, ok := modeNums[mode]
if !ok {
num = lastModeNum.Succ()
lastModeNum = num
modeNums[mode] = num
modes = append(modes, mode)
modeEntries = append(modeEntries, []*spec.LexEntry{})
}
modeEntries[num] = append(modeEntries[num], e)
}
}
return modeEntries, modes, modeNums
}
func compile(entries []*spec.LexEntry, modeNums map[spec.LexModeName]spec.LexModeNum, config *compilerConfig) (*spec.CompiledLexModeSpec, error) {
var kinds []spec.LexKind
var patterns map[int][]byte
{
kinds = append(kinds, spec.LexKindNil)
patterns = map[int][]byte{}
for i, e := range entries {
kinds = append(kinds, e.Kind)
patterns[i+1] = []byte(e.Pattern)
}
config.logger.Log("Patterns:")
for i, p := range patterns {
config.logger.Log(" #%v %v", i, string(p))
}
}
push := []spec.LexModeNum{
spec.LexModeNumNil,
}
pop := []int{
0,
}
for _, e := range entries {
pushV := spec.LexModeNumNil
if e.Push != "" {
pushV = modeNums[e.Push]
}
push = append(push, pushV)
popV := 0
if e.Pop {
popV = 1
}
pop = append(pop, popV)
}
var root astNode
var symTab *symbolTable
{
var err error
root, symTab, err = parse(patterns)
if err != nil {
return nil, err
}
var b strings.Builder
printAST(&b, root, "", "", false)
config.logger.Log("AST:\n%v", b.String())
}
var tranTab *spec.TransitionTable
{
dfa := genDFA(root, symTab)
var err error
tranTab, err = genTransitionTable(dfa)
if err != nil {
return nil, err
}
config.logger.Log(`DFA:
States: %v states (%v entries)
Initial State: %v`, tranTab.RowCount, tranTab.RowCount*tranTab.ColCount, tranTab.InitialState)
config.logger.Log(" Accepting States:")
for state, symbol := range tranTab.AcceptingStates {
config.logger.Log(" %v: %v", state, symbol)
}
}
tranTab, err := compressTransitionTable(tranTab)
if err != nil {
return nil, err
}
return &spec.CompiledLexModeSpec{
Kinds: kinds,
Push: push,
Pop: pop,
DFA: tranTab,
}, nil
}
func compressTransitionTable(tranTab *spec.TransitionTable) (*spec.TransitionTable, error) {
ueTab := compressor.NewUniqueEntriesTable()
{
orig, err := compressor.NewOriginalTable(tranTab.UncompressedTransition, tranTab.ColCount)
if err != nil {
return nil, err
}
err = ueTab.Compress(orig)
if err != nil {
return nil, err
}
}
rdTab := compressor.NewRowDisplacementTable(0)
{
orig, err := compressor.NewOriginalTable(ueTab.UniqueEntries, ueTab.OriginalColCount)
if err != nil {
return nil, err
}
err = rdTab.Compress(orig)
if err != nil {
return nil, err
}
}
tranTab.Transition = &spec.UniqueEntriesTable{
UniqueEntries: &spec.RowDisplacementTable{
OriginalRowCount: rdTab.OriginalRowCount,
OriginalColCount: rdTab.OriginalColCount,
EmptyValue: rdTab.EmptyValue,
Entries: rdTab.Entries,
Bounds: rdTab.Bounds,
RowDisplacement: rdTab.RowDisplacement,
},
RowNums: ueTab.RowNums,
OriginalRowCount: ueTab.OriginalRowCount,
OriginalColCount: ueTab.OriginalColCount,
}
tranTab.UncompressedTransition = nil
return tranTab, nil
}
|
