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
|
package parse
import (
"unicode"
"unicode/utf8"
)
// eof rune sent when end of file is reached
var eof = rune(0)
// token is a lexical token.
type token uint
// list of lexical tokens.
const (
// special tokens
tokenIllegal token = iota
tokenEOF
// identifiers and literals
tokenIdent
// operators and delimiters
tokenLbrack
tokenRbrack
tokenQuote
)
// predefined mode bits to control recognition of tokens.
const (
scanIdent byte = 1 << iota
scanLbrack
scanRbrack
scanEscape
)
// returns true if rune is accepted.
type acceptFunc func(r rune, i int) bool
// scanner implements a lexical scanner that reads unicode
// characters and tokens from a string buffer.
type scanner struct {
buf string
pos int
start int
width int
mode byte
accept acceptFunc
}
// init initializes a scanner with a new buffer.
func (s *scanner) init(buf string) {
s.buf = buf
s.pos = 0
s.start = 0
s.width = 0
s.accept = nil
}
// read returns the next unicode character. It returns eof at
// the end of the string buffer.
func (s *scanner) read() rune {
if s.pos >= len(s.buf) {
s.width = 0
return eof
}
r, w := utf8.DecodeRuneInString(s.buf[s.pos:])
s.width = w
s.pos += s.width
return r
}
func (s *scanner) unread() {
s.pos -= s.width
}
// skip skips over the curring unicode character in the buffer
// by slicing and removing from the buffer.
func (s *scanner) skip() {
l := s.buf[:s.pos-1]
r := s.buf[s.pos:]
s.buf = l + r
}
// peek returns the next unicode character in the buffer without
// advancing the scanner. It returns eof if the scanner's position
// is at the last character of the source.
func (s *scanner) peek() rune {
r := s.read()
s.unread()
return r
}
// string returns the string corresponding to the most recently
// scanned token. Valid after calling scan().
func (s *scanner) string() string {
return s.buf[s.start:s.pos]
}
// scan reads the next token or Unicode character from source and
// returns it. It returns EOF at the end of the source.
func (s *scanner) scan() token {
s.start = s.pos
r := s.read()
switch {
case r == eof:
return tokenEOF
case s.scanLbrack(r):
return tokenLbrack
case s.scanRbrack(r):
return tokenRbrack
case s.scanIdent(r):
return tokenIdent
}
return tokenIllegal
}
// scanIdent reads the next token or Unicode character from source
// and returns true if the Ident character is accepted.
func (s *scanner) scanIdent(r rune) bool {
if s.mode&scanIdent == 0 {
return false
}
if s.scanEscaped(r) {
s.skip()
} else if !s.accept(r, s.pos-s.start) {
return false
}
loop:
for {
r := s.read()
switch {
case r == eof:
s.unread()
break loop
case s.scanLbrack(r):
s.unread()
s.unread()
break loop
}
if s.scanEscaped(r) {
s.skip()
continue
}
if !s.accept(r, s.pos-s.start) {
s.unread()
break loop
}
}
return true
}
// scanLbrack reads the next token or Unicode character from source
// and returns true if the open bracket is encountered.
func (s *scanner) scanLbrack(r rune) bool {
if s.mode&scanLbrack == 0 {
return false
}
if r == '$' {
if s.read() == '{' {
return true
}
s.unread()
}
return false
}
// scanRbrack reads the next token or Unicode character from source
// and returns true if the closing bracket is encountered.
func (s *scanner) scanRbrack(r rune) bool {
if s.mode&scanRbrack == 0 {
return false
}
return r == '}'
}
// scanEscaped reads the next token or Unicode character from source
// and returns true if it being escaped and should be sipped.
func (s *scanner) scanEscaped(r rune) bool {
if s.mode&scanEscape == 0 {
return false
}
if r == '$' {
if s.peek() == '$' {
return true
}
}
if r != '\\' {
return false
}
switch s.peek() {
case '/', '\\':
return true
default:
return false
}
}
//
// scanner functions accept or reject runes.
//
func acceptRune(r rune, i int) bool {
return true
}
func acceptIdent(r rune, i int) bool {
return unicode.IsLetter(r) || unicode.IsDigit(r) || r == '_'
}
func acceptColon(r rune, i int) bool {
return r == ':'
}
func acceptOneHash(r rune, i int) bool {
return r == '#' && i == 1
}
func acceptNone(r rune, i int) bool {
return false
}
func acceptNotClosing(r rune, i int) bool {
return r != '}'
}
func acceptHashFunc(r rune, i int) bool {
return r == '#' && i < 3
}
func acceptPercentFunc(r rune, i int) bool {
return r == '%' && i < 3
}
func acceptDefaultFunc(r rune, i int) bool {
switch {
case i == 1 && r == ':':
return true
case i == 2 && (r == '=' || r == '-' || r == '?' || r == '+'):
return true
default:
return false
}
}
func acceptReplaceFunc(r rune, i int) bool {
switch {
case i == 1 && r == '/':
return true
case i == 2 && (r == '/' || r == '#' || r == '%'):
return true
default:
return false
}
}
func acceptOneEqual(r rune, i int) bool {
return i == 1 && r == '='
}
func acceptOneColon(r rune, i int) bool {
return i == 1 && r == ':'
}
func rejectColonClose(r rune, i int) bool {
return r != ':' && r != '}'
}
func acceptSlash(r rune, i int) bool {
return r == '/'
}
func acceptNotSlash(r rune, i int) bool {
return r != '/'
}
func acceptCasingFunc(r rune, i int) bool {
return (r == ',' || r == '^') && i < 3
}
|