Newer
Older
package gql
leftCurl = '{'
rightCurl = '}'
)
// stateFn represents the state of the scanner as a function that
// returns the next state.
type stateFn func(*lexer) stateFn
func lexText(l *lexer) stateFn {
Loop:
switch r := l.next(); {
case r == leftCurl:
l.backup()
l.emit(itemText) // emit whatever we have so far.
l.next() // advance one to get back to where we saw leftCurl.
l.depth += 1 // one level down.
l.emit(itemLeftCurl)
return lexInside // we're in.
case r == rightCurl:
return l.errorf("Too many right characters")
case r == EOF:
break Loop
case isNameBegin(r):
l.backup()
l.emit(itemText)
return lexOperationType
}
}
if l.pos > l.start {
l.emit(itemText)
}
l.emit(itemEOF)
return nil
}
func lexInside(l *lexer) stateFn {
for {
switch r := l.next(); {
case r == rightCurl:
l.depth -= 1
l.emit(itemRightCurl)
if l.depth == 0 {
return lexText
}
case r == leftCurl:
l.depth += 1
l.emit(itemLeftCurl)
case r == EOF:
return l.errorf("unclosed action")
case isSpace(r) || isEndOfLine(r) || r == ',':
case isNameBegin(r):
return lexName
case r == '#':
l.backup()
return lexComment
case r == '(':
l.emit(itemLeftRound)
return lexArgInside
default:
return l.errorf("Unrecognized character in lexInside: %#U", r)
func lexName(l *lexer) stateFn {
// The caller already checked isNameBegin, and absorbed one rune.
r := l.next()
if isNameSuffix(r) {
continue
l.backup()
l.emit(itemName)
break
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
func lexComment(l *lexer) stateFn {
for {
r := l.next()
if isEndOfLine(r) {
l.emit(itemComment)
return lexInside
}
if r == EOF {
break
}
}
if l.pos > l.start {
l.emit(itemComment)
}
l.emit(itemEOF)
return nil // Stop the run loop.
}
func lexOperationType(l *lexer) stateFn {
for {
r := l.next()
if isNameSuffix(r) {
continue // absorb
}
l.backup()
word := l.input[l.start:l.pos]
if word == "query" || word == "mutation" {
l.emit(itemOpType)
}
break
}
return lexText
}
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
func lexArgInside(l *lexer) stateFn {
for {
switch r := l.next(); {
case r == EOF:
return l.errorf("unclosed argument")
case isSpace(r) || isEndOfLine(r):
l.ignore()
case isNameBegin(r):
return lexArgName
case r == ':':
l.ignore()
return lexArgVal
case r == ')':
l.emit(itemRightRound)
return lexInside
case r == ',':
l.ignore()
}
}
}
func lexArgName(l *lexer) stateFn {
for {
r := l.next()
if isNameSuffix(r) {
continue
}
l.backup()
l.emit(itemArgName)
break
}
return lexArgInside
}
func lexArgVal(l *lexer) stateFn {
l.acceptRun(isSpace)
l.ignore() // Any spaces encountered.
for {
r := l.next()
if isSpace(r) || isEndOfLine(r) || r == ')' || r == ',' {
l.backup()
l.emit(itemArgVal)
return lexArgInside
}
if r == EOF {
return l.errorf("Reached EOF while reading var value: %v",
l.input[l.start:l.pos])
}
}
glog.Fatal("This shouldn't be reached.")
return nil
}
func lexArgumentVal(l *lexer) stateFn {
for {
switch r := l.next(); {
case isSpace(r):
l.ignore()
}
}
}
return r == '\u0009' || r == '\u0020'
}
func isEndOfLine(r rune) bool {
return r == '\u000A' || r == '\u000D'
}
func isNameBegin(r rune) bool {
switch {
case r >= 'a' && r <= 'z':
return true
case r >= 'A' && r <= 'Z':
return true
case r == '_':
return true
default:
return false
}
func isNameSuffix(r rune) bool {
if isNameBegin(r) {
return true
}
if r >= '0' && r <= '9' {
return true
}
return false