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 281 282 283 284 285 286 287 288
|
package token
import (
"bytes"
"fmt"
"strconv"
)
const (
eof = 0
dataElementDelimiter = '+'
groupDataElementDelimiter = ':'
segmentDelimiter = '\''
escapeCharacter = '?'
binaryIdentifier = '@'
)
// LexerStateFn represents a state function for the lexer.
type LexerStateFn func(*Lexer) LexerStateFn
// NewLexer creates a new scanner for the input string.
func NewLexer(name string, input []byte) *Lexer {
l := &Lexer{
name: name,
input: input,
state: lexStart,
tokens: make(chan Token, 2), // Two token sufficient.
}
return l
}
// A Lexer is a HBCI data element lexer based on an input string
type Lexer struct {
name string // the name of the input; used only for error reports.
input []byte // the data being scanned.
state LexerStateFn // the next lexing function to enter
pos int // current position in the input.
start int // start position of this item.
tokens chan Token // channel of scanned tokens.
}
// SetEntryPoint sets the initial state of the lexer. The lexer will reset itself to use the
// new entryPoint properly
func (l *Lexer) SetEntryPoint(entryPoint LexerStateFn) {
l.reset()
l.state = entryPoint
}
func (l *Lexer) reset() {
l.pos = 0
l.start = 0
l.tokens = make(chan Token, 2)
}
func (l *Lexer) run() {
for state := lexStart; state != nil; {
state = state(l)
}
close(l.tokens) // No more tokens will be delivered.
}
// Next returns the next item from the input.
func (l *Lexer) Next() Token {
for {
select {
case item, ok := <-l.tokens:
if ok {
return item
}
panic(fmt.Errorf("No items left"))
default:
l.state = l.state(l)
if l.state == nil {
close(l.tokens)
}
}
}
}
// HasNext returns true if there are tokens left, false if EOF has reached
func (l *Lexer) HasNext() bool {
return l.state != nil
}
// emit passes a token back to the client.
func (l *Lexer) emit(t Type) {
val := l.input[l.start:l.pos]
l.tokens <- New(t, val, l.start)
l.start = l.pos
}
// next returns the next byte in the input.
func (l *Lexer) next() byte {
if l.pos >= len(l.input) {
return eof
}
b := l.input[l.pos]
l.pos++
return b
}
// ignore skips over the pending input before this point.
func (l *Lexer) ignore() {
l.start = l.pos
}
// backup steps back one byte.
// Can be called only once per call of next.
func (l *Lexer) backup() {
l.pos--
}
// peek returns but does not consume
// the next byte in the input.
func (l *Lexer) peek() byte {
r := l.next()
l.backup()
return r
}
// accept consumes the next byte
// if it's from the valid set.
func (l *Lexer) accept(valid ...byte) bool {
if bytes.IndexByte(valid, l.next()) >= 0 {
return true
}
l.backup()
return false
}
// acceptRun consumes a run of bytes from the valid set.
func (l *Lexer) acceptRun(valid []byte) {
for bytes.IndexByte(valid, l.next()) >= 0 {
}
l.backup()
}
// error returns an error token and terminates the scan by passing
// back a nil pointer that will be the next state, terminating l.run.
func (l *Lexer) errorf(format string, args ...interface{}) LexerStateFn {
err := fmt.Sprintf(format, args...)
l.tokens <- New(ERROR, []byte(err), l.start)
return nil
}
// state functions
func lexStart(l *Lexer) LexerStateFn {
switch r := l.next(); {
case r == dataElementDelimiter:
l.emit(DATA_ELEMENT_SEPARATOR)
return lexStart
case r == segmentDelimiter:
l.emit(SEGMENT_END_MARKER)
return lexStart
case r == groupDataElementDelimiter:
l.emit(GROUP_DATA_ELEMENT_SEPARATOR)
return lexStart
case r == binaryIdentifier:
l.backup()
return lexBinaryData
case r == eof:
// Correctly reached EOF.
l.emit(EOF)
return nil
case r == '0':
l.backup()
return lexDigit
case ('1' <= r && r <= '9'):
l.backup()
return lexNumber
default:
l.backup()
return lexAlphaNumeric
}
}
func lexAlphaNumeric(l *Lexer) LexerStateFn {
text := false
for {
switch r := l.next(); {
case r == escapeCharacter:
if p := l.peek(); isSyntaxSymbol(p) {
l.next()
} else {
return l.errorf("Unexpected escape character")
}
case isDelimiter(r):
l.backup()
if text {
l.emit(TEXT)
} else {
l.emit(ALPHA_NUMERIC)
}
return lexStart
case r == eof:
return l.errorf("Unexpected end of input")
case (r == '\n' || r == '\r'):
text = true
}
}
}
func lexBinaryData(l *Lexer) LexerStateFn {
l.accept('@')
digits := []byte{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'}
binaryLengthStart := l.pos
l.acceptRun(digits)
binaryLengthEnd := l.pos
if binaryLengthEnd == binaryLengthStart {
return l.errorf("Binary length can't be empty")
}
lengthBytes := l.input[binaryLengthStart:binaryLengthEnd]
length, err := strconv.Atoi(string(lengthBytes))
if err != nil {
return l.errorf("Binary length must contain of digits only")
}
if !l.accept('@') {
return l.errorf("Binary length must contain of digits only")
}
l.pos += length
p := l.peek()
if isDelimiter(p) {
l.emit(BINARY_DATA)
return lexStart
}
if p == eof {
return l.errorf("Unexpected end of input")
}
return l.errorf("Expected syntax symbol after binary data")
}
func lexDigit(l *Lexer) LexerStateFn {
digits := []byte{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'}
l.accept('0')
// Only valid number with leading 0 is 0
if r := l.peek(); isDelimiter(r) {
l.emit(NUMERIC)
return lexStart
}
// Only valid float with leading 0 is value smaller than 1
if l.accept(',') {
l.acceptRun(digits)
if p := l.peek(); isDelimiter(p) {
l.emit(FLOAT)
return lexStart
}
return lexAlphaNumeric
}
l.acceptRun(digits)
if p := l.peek(); p == ',' {
return l.errorf("Malformed float")
}
if p := l.peek(); isDelimiter(p) {
l.emit(DIGIT)
return lexStart
}
return lexAlphaNumeric
}
func lexNumber(l *Lexer) LexerStateFn {
digits := []byte{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'}
l.acceptRun(digits)
// is it a float?
if l.accept(',') {
l.acceptRun(digits)
if p := l.peek(); isDelimiter(p) {
l.emit(FLOAT)
return lexStart
}
return lexAlphaNumeric
}
if p := l.peek(); isDelimiter(p) {
l.emit(NUMERIC)
return lexStart
}
return lexAlphaNumeric
}
func isDelimiter(r byte) bool {
return r == dataElementDelimiter || r == segmentDelimiter || r == groupDataElementDelimiter
}
func isSyntaxSymbol(r byte) bool {
return r == dataElementDelimiter || r == segmentDelimiter || r == groupDataElementDelimiter || r == escapeCharacter || r == binaryIdentifier
}
|