-
Notifications
You must be signed in to change notification settings - Fork 0
/
lexer.go
182 lines (149 loc) · 2.76 KB
/
lexer.go
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
package lexer
import (
"fmt"
"strings"
"unicode/utf8"
)
type item struct {
typ itemType
pos int
val string
}
type itemType int
const (
itemError itemType = iota
itemEOF
itemLeftBracket
itemRightBracket
itemEqualSign
itemNewLine
itemSection
itemKey
itemValue
)
const (
leftBracket string = "["
rightBracket string = "]"
equalSign string = "="
newLine string = "\n"
spaceChars string = " \t\r\n"
)
const eof = -1
type stateFn func(*lexer) stateFn
type lexer struct {
input string
start int
pos int
width int
state stateFn
items chan item
}
func (l *lexer) next() rune {
if l.isEOF() {
l.width = 0
return eof
}
r, w := utf8.DecodeRuneInString(l.input[l.pos:])
l.width = w
l.pos += l.width
return r
}
func (l *lexer) backup() {
l.pos -= l.width
}
func (l *lexer) peek() rune {
r := l.next()
l.backup()
return r
}
func (l *lexer) ignore() {
l.start = l.pos
}
func (l *lexer) ignoreSpace() {
for strings.ContainsRune(spaceChars, l.next()) {
}
l.backup()
l.ignore()
}
func (l *lexer) isEOF() bool {
return l.pos >= len(l.input)
}
func (l *lexer) contains(c string) bool {
return strings.Index(l.input[l.pos:], c) >= 0
}
func (l *lexer) acceptUntil(c string) {
for !strings.ContainsRune(c, l.next()) {
}
l.backup()
}
func (l *lexer) emit(t itemType) {
l.items <- item{t, l.pos, l.input[l.start:l.pos]}
l.start = l.pos
}
func (l *lexer) run() {
for l.state = lexLoop; l.state != nil; {
l.state = l.state(l)
}
close(l.items)
}
func (l *lexer) errorf(format string, args ...interface{}) stateFn {
l.items <- item{itemError, l.start, fmt.Sprintf(format, args...)}
return nil
}
func lex(input string) *lexer {
l := &lexer{
input: input,
items: make(chan item),
}
go l.run()
return l
}
func lexLoop(l *lexer) stateFn {
l.ignoreSpace()
if string(l.peek()) == leftBracket {
return lexLeftBracket
} else if !l.isEOF() {
return lexKey
}
l.emit(itemEOF)
return nil
}
func lexLeftBracket(l *lexer) stateFn {
l.pos += len(leftBracket)
l.emit(itemLeftBracket)
return lexSection
}
func lexSection(l *lexer) stateFn {
if l.contains(rightBracket) {
l.acceptUntil(rightBracket)
l.emit(itemSection)
return lexRightBracket
}
return l.errorf("no right bracket found")
}
func lexRightBracket(l *lexer) stateFn {
l.pos += len(rightBracket)
l.emit(itemRightBracket)
return lexLoop
}
func lexKey(l *lexer) stateFn {
if l.contains(equalSign) {
l.acceptUntil(equalSign)
l.emit(itemKey)
return lexEqualSign
}
return l.errorf("no equal sign found")
}
func lexEqualSign(l *lexer) stateFn {
l.pos += len(equalSign)
l.emit(itemEqualSign)
return lexValue
}
func lexValue(l *lexer) stateFn {
if l.contains(newLine) {
l.acceptUntil(newLine)
l.emit(itemValue)
return lexLoop
}
return l.errorf("no new line found")
}