-
Notifications
You must be signed in to change notification settings - Fork 3
/
lexer.go
517 lines (458 loc) · 13.1 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
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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
// Package pdflex is a lexer for PDF files, based on the spec PDF32000_2008.pdf.
// Initial code inspiration text/template/parse, which is licensed as:
// Copyright 2011 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// Imitation is the sincerest form of flattery.
// (c) Ben Nagy 2015
package pdflex
import (
"fmt"
"strings"
"unicode"
"unicode/utf8"
)
type Pos int
// item represents a token or text string returned from the scanner.
type Item struct {
Typ ItemType // The type of this item.
Pos // The starting position, in bytes, of this item in the input string.
Val string // The value of this item.
}
// itemType identifies the type of lex items.
type ItemType int
const (
ItemError ItemType = iota // error occurred; value is text of error
ItemEOF
ItemNumber // PDF Number 7.3.3
ItemSpace // run of space characters 7.2.2 Table 1
ItemEOL // special just token for line breaks. \n, \r or \r\n
ItemLeftDict // Just the << token
ItemRightDict // >> token
ItemLeftArray
ItemRightArray
ItemStreamBody // raw contents of a stream
ItemString // PDF Literal String 7.3.4.2
ItemHexString // PDF Hex String 7.3.4.3
ItemComment // 7.2.3
ItemName // PDF Name Object 7.3.5
ItemWord // catchall for an unrecognised blob of alnums
// Keywords appear after all the rest.
ItemKeyword // used only to delimit the keywords
ItemObj // just the obj and endobj markers
ItemEndObj
ItemStream // just the markers
ItemEndStream
ItemTrailer
ItemXref
ItemStartXref
ItemTrue // not really keywords, they're actually types of
ItemFalse // PDF Basic Object, but this is cleaner 7.3.2
ItemNull
)
// If they need to be used directly in code then a constant string is easiest
const (
leftDict = "<<"
rightDict = ">>"
leftStream = "stream"
rightStream = "endstream"
)
// keytoks maps special strings to itemTypes
var keytoks = map[string]ItemType{
"obj": ItemObj,
"endobj": ItemEndObj,
leftStream: ItemStream,
rightStream: ItemEndStream,
"trailer": ItemTrailer,
"xref": ItemXref,
"startxref": ItemStartXref,
"true": ItemTrue,
"false": ItemFalse,
"null": ItemNull,
}
const lexEOF = -1
// stateFn represents the state of the scanner as a function that returns the next state.
type stateFn func(*Lexer) stateFn
// lexer holds the state of the scanner.
type Lexer struct {
name string // the name of the input; used only for error reports
input string // the string being scanned
state stateFn // the next lexing function to enter
pos Pos // current position in the input
start Pos // start position of this item
width Pos // width of last rune read from input
lastPos Pos // position of most recent item returned by nextItem
items chan Item // channel of scanned items
arrayDepth int // nesting depth of [], <<>>
dictDepth int
}
func (l *Lexer) Pos() Pos { return l.pos }
func (l *Lexer) Start() Pos { return l.start }
func (l *Lexer) Width() Pos { return l.width }
func (l *Lexer) LastPos() Pos { return l.lastPos }
// next returns the next rune in the input.
func (l *Lexer) next() rune {
if int(l.pos) >= len(l.input) {
l.width = 0
return lexEOF
}
r, w := utf8.DecodeRuneInString(l.input[l.pos:])
l.width = Pos(w)
l.pos += l.width
return r
}
// peek returns but does not consume the next rune in the input.
func (l *Lexer) peek() rune {
r := l.next()
l.backup()
return r
}
// backup steps back one rune. Must only be called once per call of next.
func (l *Lexer) backup() {
l.pos -= l.width
}
// emit passes an item back to the client.
func (l *Lexer) emit(t ItemType) {
l.items <- Item{t, l.start, l.input[l.start:l.pos]}
l.start = l.pos
}
// ignore skips over the pending input before this point.
func (l *Lexer) ignore() {
l.start = l.pos
}
// accept consumes the next rune if it's from the valid set.
func (l *Lexer) accept(valid string) bool {
if strings.IndexRune(valid, l.next()) >= 0 {
return true
}
l.backup()
return false
}
// acceptRun consumes a run of runes from the valid set.
func (l *Lexer) acceptRun(valid string) {
for strings.IndexRune(valid, l.next()) >= 0 {
}
l.backup()
}
// lineNumber reports which line we're on, based on the position of
// the previous item returned by nextItem. Doing it this way
// means we don't have to worry about peek double counting.
func (l *Lexer) LineNumber() int {
return 1 + strings.Count(l.input[:l.lastPos], "\n")
}
// errorf returns an error token and terminates the scan by passing
// back a nil pointer that will be the next state, terminating l.nextItem.
func (l *Lexer) errorf(format string, args ...interface{}) stateFn {
l.items <- Item{ItemError, l.start, fmt.Sprintf(format, args...)}
l.items <- Item{ItemEOF, l.start, ""}
return nil
}
// nextItem returns the next item from the input.
func (l *Lexer) NextItem() Item {
item := <-l.items
l.lastPos = item.Pos
return item
}
// NewLexer creates a new scanner for the input string.
func NewLexer(name, input string) *Lexer {
l := &Lexer{
name: name,
input: input,
items: make(chan Item),
}
go l.run()
return l
}
// run runs the state machine for the lexer.
func (l *Lexer) run() {
for l.state = lexDefault; l.state != nil; {
l.state = l.state(l)
}
}
// state functions
// lexDefault is the main lexing state. The rules here work for the root
// namespace, as well as inside dicts <<>> and arrays [].
func lexDefault(l *Lexer) stateFn {
switch r := l.next(); {
case r == '\r':
l.accept("\n")
l.emit(ItemEOL)
return lexDefault
case r == '\n':
l.emit(ItemEOL)
return lexDefault
case unicode.IsSpace(r):
return lexSpace
case r == '/':
return lexName
case r == '+' || r == '-' || r == '.' || ('0' <= r && r <= '9'):
l.backup()
return lexNumber
// strings and hex objects have stricter rules
case isAlphaNumeric(r):
return lexWord
case r == '(':
return lexStringObj
// dicts and arrays can nest arbitrarily deeply. We're not a parser, but
// let's just sanity check termination.
case r == '<':
if l.peek() == '<' {
l.backup()
l.dictDepth++
return lexLeftDict
}
return lexHexObj
// Arrays are just collections of objects, so all these default rules are still fine
case r == '[':
l.emit(ItemLeftArray)
l.arrayDepth++
return lexDefault
case r == ']':
l.arrayDepth--
l.emit(ItemRightArray)
if l.arrayDepth < 0 {
return l.errorf("unexexpected array terminator")
}
return lexDefault
case r == '%':
return lexComment
case r == '>':
if l.peek() == '>' {
l.dictDepth--
if l.dictDepth < 0 {
l.next()
l.emit(ItemRightDict)
return l.errorf("unexexpected dict terminator")
}
l.backup()
return lexRightDict
}
// '>' as part of a hex object should have been consumed in lexHex, so
// a stray '>' in this state is not valid.
fallthrough
case r == lexEOF:
if l.arrayDepth > 0 {
return l.errorf("unterminated array")
}
if l.dictDepth > 0 {
return l.errorf("unterminated dict")
}
l.emit(ItemEOF)
return nil
default:
return l.errorf("illegal character: %#U", r)
}
}
// lexStream quickly skips over all the contents of PDF stream objects. The
// 'stream' header has already been consumed and emitted in lexWord.
func lexStream(l *Lexer) stateFn {
// emit a space token for the space(s) terminating the stream marker
if !l.scanEOL() {
return l.errorf("expected EOL terminator for stream keyword, got: %#U", l.peek())
}
l.emit(ItemEOL)
i := strings.Index(l.input[l.pos:], rightStream)
if i < 0 {
return l.errorf("unclosed stream")
}
substr := l.input[l.pos : l.pos+Pos(i)]
// We have now consumed the stream contents AND a whitespace separator. We
// actually want to emit the stream body token 'bare', so now we need to
// walk backwards past those spaces.
for {
r, size := utf8.DecodeLastRuneInString(substr)
if !unicode.IsSpace(r) || len(substr) <= 0 {
break
}
substr = substr[:len(substr)-size]
}
l.pos += Pos(len(substr))
l.emit(ItemStreamBody)
// let lexDefault take care of lexing the space and the endstream token
return lexDefault
}
// lexLeftDict scans the left delimiter, which is known to be present.
func lexLeftDict(l *Lexer) stateFn {
l.pos += Pos(len(leftDict))
l.emit(ItemLeftDict)
return lexDefault
}
// lexComment lexes a PDF comment from a comment marker % to the next EOL
// marker. However, '\r\n' (specifically) is treated as one EOL marker. Some
// comments such as %%EOF and %PDF-1.7 are special to reader software, but
// that's parser business.
// cf PDF3200_2008.pdf 7.2.2
func lexComment(l *Lexer) stateFn {
var r rune
for !isEndOfLine(l.peek()) {
r = l.next()
if r == lexEOF {
l.emit(ItemComment)
return lexDefault
}
}
// any single EOL marker has been consumed above. Check for CRLF.
if r == '\r' {
l.accept("\n")
}
l.emit(ItemComment)
return lexDefault
}
// lexRightDict scans the right delimiter, which is known to be present.
func lexRightDict(l *Lexer) stateFn {
l.pos += Pos(len(rightDict))
l.emit(ItemRightDict)
return lexDefault
}
// lexName scans a PDF Name object, which is a SOLIDUS (lol) '/' followed by a
// run of non-special characters. Unprintable ASCII must be escaped with '#XX'
// codes.
// cf PDF3200_2008.pdf 7.3.5
func lexName(l *Lexer) stateFn {
for {
switch r := l.next(); {
case isDelim(r) || unicode.IsSpace(r) || r == lexEOF:
l.backup()
l.emit(ItemName)
return lexDefault
case 0x20 < r && r < 0x7f:
break
default:
return l.errorf("illegal character in name: %#U", r)
}
}
}
// lexStringObj scans a PDF String object which is any collection of bytes
// enclosed in parens (). Strings can contain balanced parens, or unbalanced
// parens that are escaped with '\'. There are some other rules about what to
// do with parsing linebreaks and escaped special chars, but that's above our
// pay grade here.
// cf PDF3200_2008.pdf 7.3.4.2
func lexStringObj(l *Lexer) stateFn {
balance := 1
for {
r := l.next()
switch r {
case '\\':
// escaped parens don't count towards balance
if !l.accept("\\") {
// two backslashes \x5c\x5c is an escaped \
l.accept("()")
}
case '(':
balance++
case ')':
balance--
if balance <= 0 {
l.emit(ItemString)
return lexDefault
}
case lexEOF:
return l.errorf("unterminated string object")
default:
}
}
}
// lexHexObj scans a hex string, which is any number of hexadecimal characters
// or whitespace enclosed by '<' '>'. The '<' rune has already been consumed.
// cf PDF3200_2008.pdf 7.3.4.3
func lexHexObj(l *Lexer) stateFn {
digits := "0123456789abcdefABCDEF"
for {
switch r := l.next(); {
case strings.IndexRune(digits, r) >= 0 || unicode.IsSpace(r):
//
case r == '>':
l.emit(ItemHexString)
return lexDefault
case r == lexEOF:
return l.errorf("unterminated hexstring")
default:
return l.errorf("illegal character in hexstring: %#U", r)
}
}
}
// lexSpace scans a run of space characters one of which has already been seen.
// cf PDF3200_2008.pdf 7.2.2
func lexSpace(l *Lexer) stateFn {
// This is more permissive than the spec, which doesn't mention U+0085
// (NEL), U+00A0 (NBSP)
// We don't allow space runs that include any EOL chars.
for isSpace(l.peek()) {
l.next()
}
l.emit(ItemSpace)
return lexDefault
}
// lexWord scans a run of basic alnums, one of which has already been seen. It
// will emit known tokens as their special types, call new state functions for
// types that require special lexing, and, failing that, emit the run as a
// catchall itemWord and then return to lexDefault
func lexWord(l *Lexer) stateFn {
for isAlphaNumeric(l.peek()) {
l.next()
}
tok, found := keytoks[l.input[l.start:l.pos]]
if found {
// known token type, emit it
l.emit(tok)
switch tok {
case ItemStream:
return lexStream
default:
return lexDefault
}
}
l.emit(ItemWord)
return lexDefault
}
// lexNumber scans a decimal or real number
// cf PDF3200_2008.pdf 7.3.3
func lexNumber(l *Lexer) stateFn {
if !l.scanNumber() {
return l.errorf("bad number syntax: %q", l.input[l.start:l.pos])
}
l.emit(ItemNumber)
return lexDefault
}
func (l *Lexer) scanNumber() bool {
// Optional leading sign.
l.accept("+-")
digits := "0123456789"
l.acceptRun(digits)
if l.accept(".") {
l.acceptRun(digits)
}
// Next thing must be a delimeter, space char or lexEOF
if isDelim(l.peek()) || unicode.IsSpace(l.peek()) || l.peek() == lexEOF {
return true
}
l.next()
return false
}
func (l *Lexer) scanEOL() bool {
if !isEndOfLine(l.peek()) {
return false
}
r := l.next()
if r == '\r' {
l.accept("\n")
}
return true
}
// isEndOfLine reports whether r is an end-of-line character.
func isEndOfLine(r rune) bool {
return r == '\r' || r == '\n'
}
func isSpace(r rune) bool {
return unicode.IsSpace(r) && !isEndOfLine(r)
}
// isDelim reports whether r is one of the 10 reserved PDF delimiter characters
// cf PDF3200_2008.pdf 7.2.2
func isDelim(r rune) bool {
return strings.IndexRune("[]{}()<>/%", r) >= 0
}
// isAlphaNumeric reports whether r is an alphabetic, digit, or underscore.
func isAlphaNumeric(r rune) bool {
return r == '_' || unicode.IsLetter(r) || unicode.IsDigit(r)
}