-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathscanner.go
More file actions
170 lines (150 loc) · 3.32 KB
/
scanner.go
File metadata and controls
170 lines (150 loc) · 3.32 KB
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
package resrap
import (
"fmt"
"unicode/utf8"
)
// scanner will take all the components and convert them to a series of tokens
type scanner struct {
Input string
pos int // current byte offset
width int // width of last rune
currR rune
lineno int
tokens []token
}
func extracttokens(inp string) ([]token, []ScanError) {
sc := scanner{}
sc.Input = inp
return sc.scan()
}
type ScanError struct {
Pos int
Msg string
}
// advance and return the next rune
func (s *scanner) next() rune {
if s.pos >= len(s.Input) {
s.width = 0
s.currR = -1 // EOF
return -1
}
r, w := utf8.DecodeRuneInString(s.Input[s.pos:])
s.width = w
s.pos += w
s.currR = r
return r
}
// look at the next rune without consuming it
func (s *scanner) peek() rune {
r := s.next()
s.backup()
return r
}
// go back one rune
func (s *scanner) backup() {
if s.width > 0 {
s.pos -= s.width
}
}
// return the current rune (last consumed by next)
func (s *scanner) curr() rune {
return s.currR
}
func (s *scanner) scanDelimited(open, close rune, allowEscapes bool) (string, *ScanError) {
start := s.pos
var buf string
for {
r := s.next()
if r == -1 {
return "", &ScanError{start, fmt.Sprintf("unterminated %q", open)}
}
if r == close {
return buf, nil
}
buf += string(r)
}
}
func isAlpha(r rune) bool {
return (r >= 'a' && r <= 'z') || (r >= 'A' && r <= 'Z')
}
func isDigit(r rune) bool {
return r >= '0' && r <= '9'
}
func isIdentStart(r rune) bool {
return isAlpha(r) || r == '_'
}
func isIdentPart(r rune) bool {
return isAlpha(r) || isDigit(r) || r == '_'
}
func (s *scanner) scanIdentifier() string {
buf := string(s.currR)
// Keep reading while next runes are valid identifier parts
for {
r := s.peek()
if !isIdentPart(r) {
break
}
s.next()
buf += string(s.currR)
}
return buf
}
func (s *scanner) scan() ([]token, []ScanError) {
var errs []ScanError
for s.next() != -1 {
switch s.currR {
case '+':
s.tokens = append(s.tokens, token{0, oneormore, ""})
case '*':
s.tokens = append(s.tokens, token{0, anyno, ""})
case '^':
s.tokens = append(s.tokens, token{0, infinite, ""})
case '?':
s.tokens = append(s.tokens, token{0, maybe, ""})
case '|':
s.tokens = append(s.tokens, token{0, option, ""})
case ';':
s.tokens = append(s.tokens, token{0, padding, ""})
case '(':
s.tokens = append(s.tokens, token{0, bracopen, ""})
case ')':
s.tokens = append(s.tokens, token{0, bracclose, ""})
case ':':
s.tokens = append(s.tokens, token{0, colon, ""})
case '\'':
val, err := s.scanDelimited('\'', '\'', false)
if err != nil {
errs = append(errs, *err)
} else {
s.tokens = append(s.tokens, token{0, character, val})
}
case '<':
val, err := s.scanDelimited('<', '>', false)
if err != nil {
errs = append(errs, *err)
} else {
s.tokens = append(s.tokens, token{0, probability, val})
}
case '[':
val, err := s.scanDelimited('[', ']', false)
if err != nil {
errs = append(errs, *err)
} else {
s.tokens = append(s.tokens, token{0, regex, val})
}
default:
if isIdentStart(s.currR) {
buff := s.scanIdentifier()
if buff != "" {
s.tokens = append(s.tokens, token{0, identifier, buff})
}
}
}
}
return s.tokens, errs
}
func (s *scanner) PrintTokens() {
for _, token := range s.tokens {
fmt.Println(token.text)
}
}