-
Notifications
You must be signed in to change notification settings - Fork 13
/
lexer.go
697 lines (576 loc) · 12.4 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
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
package frontend
import (
"fmt"
"regexp"
"strings"
"unicode"
"unicode/utf8"
)
// This lexer is heavily inspired on Rob Pike's lexer
func isAlphaNumeric(t rune) bool {
return unicode.IsLetter(t)
}
func isSpace(t rune) bool {
return unicode.IsSpace(t)
}
func isNumber(t rune) bool {
return unicode.IsNumber(t)
}
func isOperator(t rune) bool {
return strings.IndexRune("=+-/*><^!%&|", t) >= 0
}
const eof = -2
type stateFn func(*Lexer) stateFn
type itemType int
const (
itemEof itemType = 0
itemIdentifier = ID
itemEndStatement = END_STMT
itemNumber = NUMBER
itemBoolean = BOOLEAN
itemAssign = ASSIGN
itemDop = DOP /* Double op ++ -- */
itemLeftBracket = LEFT_BRACKET
itemRightBracket = RIGHT_BRACKET
itemLeftBrace = LEFT_BRACES
itemRightBrace = RIGHT_BRACES
itemEqual = EQUAL
itemIf = IF
itemElse = ELSE
itemFor = FOR
itemStore = STORE
itemExit = EXIT
itemAsm = ASM
itemInlineAsm = INLINE_ASM
itemLeftPar = LEFT_PAR
itemRightPar = RIGHT_PAR
itemStop = STOP
itemAddr = ADDR
itemOrigin = ORIGIN
itemCaller = CALLER
itemCallVal = CALLVAL
itemCallDataLoad = CALLDATALOAD
itemCallDataSize = CALLDATASIZE
itemDifficulty = DIFFICULTY
itemPrevHash = PREVHASH
itemTimeStamp = TIMESTAMP
itemGasPrice = GASPRICE
itemBlockNum = BLOCKNUM
itemCoinbase = COINBASE
itemBalance = BALANCE
itemSha3 = SHA3
itemSuicide = SUICIDE
itemGas = GAS
itemDot = DOT
itemBlock = BLOCK
itemTx = TX
itemContract = CONTRACT
itemMsg = MSG
itemArray = ARRAY
itemComma = COMMA
itemCall = CALL
itemCallcode = CALLCODE
itemTransact = TRANSACT
itemCreate = CREATE
itemSizeof = SIZEOF
itemQuote = QUOTE
itemStr = STR
itemNil = NIL
itemLamda = LAMBDA
itemCode = CODE
itemVar = VAR
itemColon = COLON
itemAddress = ADDRESS
itemFuncDef = FUNC
itemFuncCall = FUNC_CALL
itemReturn = RETURN
itemOp = OP
itemAnd = AND
itemMul = MUL
itemPush = PUSH
itemPop = POP
itemImport = IMPORT
itemByte = BYTE
itemPrint = PRINT
)
type item struct {
typ itemType
val string
}
func lexLambda(l *Lexer) stateFn {
count := 0
out:
for {
switch l.next() {
case '{':
if count == 0 {
l.emit(itemLeftBracket)
l.ignore()
}
count++
case '}':
count--
if count == 0 {
l.backup()
break out
}
}
}
l.emit(itemCode)
l.next()
l.emit(itemRightBracket)
return lexText(l)
}
func lexStatement(l *Lexer) stateFn {
acceptance := Alpha
l.acceptRun(acceptance)
if l.accept("_1234567890") {
acceptance += "_1234567890"
}
l.acceptRun(acceptance)
switch l.blob() {
case "nil":
l.emit(itemNil)
case "if":
l.emit(itemIf)
case "else":
l.emit(itemElse)
case "for":
l.emit(itemFor)
case "asm":
l.emit(itemAsm)
return lexInsideAsm
case "stop":
l.emit(itemStop)
case "block":
l.emit(itemBlock)
return lexBlockScope
case "message", "this":
l.emit(itemMsg)
return lexCallScope
case "tx":
l.emit(itemTx)
return lexTxScope
case "contract":
l.emit(itemContract)
return lexContractScope
case "array":
l.emit(itemArray)
return lexArray
case "compile":
l.emit(itemLamda)
return lexLambda
case "var":
l.emit(itemVar)
case "true", "false":
l.emit(itemBoolean)
case "call":
l.emit(itemCall)
case "callcode":
l.emit(itemCallcode)
case "create":
l.emit(itemCreate)
case "transact":
l.emit(itemTransact)
case "m_push":
l.emit(itemPush)
case "m_pop":
l.emit(itemPop)
case "exit":
l.emit(itemExit)
case "sizeof":
l.emit(itemSizeof)
case "func":
l.emit(itemFuncDef)
case "return":
l.emit(itemReturn)
case "import":
l.emit(itemImport)
case "byte":
l.emit(itemByte)
case "balance":
l.emit(itemBalance)
case "sha3":
l.emit(itemSha3)
case "suicide":
l.emit(itemSuicide)
case "print":
l.emit(itemPrint)
default:
l.emit(itemIdentifier)
}
return lexText
}
const Numbers = "1234567890"
const Alpha = "abcdefghijklmnopqrstuwvxyzABCDEFGHIJKLMNOPQRSTUWVXYZ"
func lexCall(l *Lexer) stateFn {
if !l.accept("(") {
l.err = fmt.Errorf("Expected '('")
return nil
}
l.emit(itemLeftPar)
return lexText
}
func lexArray(l *Lexer) stateFn {
if !l.accept("(") {
l.err = fmt.Errorf("Exepcted '('")
return nil
}
l.emit(itemLeftPar)
if !l.accept(Numbers) {
l.err = fmt.Errorf("Expected number")
return nil
}
l.acceptRun(Numbers)
l.emit(itemNumber)
if !l.accept(")") {
l.err = fmt.Errorf("Expected ')'")
return nil
}
l.emit(itemRightPar)
return lexText
}
func lexBlockScope(l *Lexer) stateFn {
if !l.accept(".") {
l.err = fmt.Errorf("Expected '.'")
return nil
}
l.emit(itemDot)
acceptance := "abcdefghijklmnopqrstuwvxyzABCDEFGHIJKLMNOPQRSTUWVXYZ"
l.acceptRun(acceptance)
switch l.blob() {
case "coinbase":
l.emit(itemCoinbase)
case "difficulty":
l.emit(itemDifficulty)
case "prevHash":
l.emit(itemPrevHash)
case "time":
l.emit(itemTimeStamp)
case "number":
l.emit(itemBlockNum)
default:
l.err = fmt.Errorf("Undefined '%s'", l.blob())
return nil
}
return lexText
}
func lexCallScope(l *Lexer) stateFn {
if !l.accept(".") {
l.err = fmt.Errorf("Expected '.'")
return nil
}
l.emit(itemDot)
acceptance := "abcdefghijklmnopqrstuwvxyzABCDEFGHIJKLMNOPQRSTUWVXYZ"
l.acceptRun(acceptance)
switch l.blob() {
case "data":
l.emit(itemCallDataLoad)
case "gas":
l.emit(itemGas)
case "caller":
l.emit(itemCaller)
default:
l.err = fmt.Errorf("Undefined '%s'", l.blob())
return nil
}
return lexText
}
func lexTxScope(l *Lexer) stateFn {
if !l.accept(".") {
l.err = fmt.Errorf("Expected '.'")
return nil
}
l.emit(itemDot)
acceptance := "abcdefghijklmnopqrstuwvxyzABCDEFGHIJKLMNOPQRSTUWVXYZ"
l.acceptRun(acceptance)
switch l.blob() {
case "gasPrice":
l.emit(itemGasPrice)
case "sender":
l.emit(itemOrigin)
case "value":
l.emit(itemCallVal)
default:
l.err = fmt.Errorf("Undefined '%s'", l.blob())
return nil
}
return lexText
}
func lexContractScope(l *Lexer) stateFn {
if !l.accept(".") {
l.err = fmt.Errorf("Expected '.'")
return nil
}
l.emit(itemDot)
acceptance := "abcdefghijklmnopqrstuwvxyzABCDEFGHIJKLMNOPQRSTUWVXYZ"
l.acceptRun(acceptance)
switch l.blob() {
case "address":
l.emit(itemAddress)
case "storage":
l.emit(itemStore)
default:
l.err = fmt.Errorf("Undefined '%s'", l.blob())
return nil
}
return lexText
}
func lexNumber(l *Lexer) stateFn {
digits := "0123456789"
if l.accept("0") && l.accept("xX") {
digits = "0123456789abcdefABCDEF"
}
l.acceptRun(digits)
l.emit(itemNumber)
return lexText
}
func lexInsideAsm(l *Lexer) stateFn {
out:
for {
switch r := l.next(); {
case isSpace(r):
l.ignore()
case r == '{':
l.emit(itemLeftBrace)
case r == '}':
l.backup()
break out
default:
if !l.acceptRunUntill('}') {
return nil
}
l.emit(itemInlineAsm)
}
}
return lexText
}
/* TODO
func lexInsidePar(l *Lexer) stateFn {
for {
switch r := l.next(); {
case isComma(r):
l.ignore()
case isAlphaNumeric(r):
l.backup()
return lexStatement
}
}
}
*/
func lexOperator(l *Lexer) stateFn {
// The only special case there is, assignment
acceptance := "="
if !l.accept("=") {
if l.accept("!") {
acceptance += "!"
} else {
acceptance += "-/*+><^%&|"
}
}
l.acceptRun(acceptance)
switch l.blob() {
case "=":
l.emit(itemAssign)
case "&":
l.emit(itemAnd)
case "*":
l.emit(itemMul)
case "++", "--":
l.emit(itemDop)
default:
l.emit(itemOp)
}
return lexText
}
func lexInsideString(l *Lexer) stateFn {
if !l.acceptRunUntill('"') {
l.err = fmt.Errorf("Expected '\"'")
return nil
}
l.emit(itemStr)
l.next()
l.emit(itemQuote)
return lexText
}
func lexComment(l *Lexer) stateFn {
l.acceptRunUntill('\n')
return lexText
}
var Lineno int
// Lex text attempts to identify the current state that *might*
// be and calls the appropriate lexing method. The lexing method
// should then take care of anything that is current (even validating)
func lexText(l *Lexer) stateFn {
for {
switch r := l.next(); {
case r == '\n':
Lineno++
l.emit(itemEndStatement)
//l.ignore()
case r == '\t':
l.ignore()
case isSpace(r): // Check whether this is a space (which we ignore)
l.ignore()
case isAlphaNumeric(r) || r == '_': // Check if it's alpha numeric (var, if, else etc)
l.backup()
return lexStatement
case isNumber(r): // Check if it's a number (constant)
l.backup()
return lexNumber
case r == '{': // Block check
l.emit(itemLeftBrace)
case r == '}':
l.emit(itemRightBrace)
case r == '[':
l.emit(itemLeftBracket)
case r == ']':
l.emit(itemRightBracket)
case r == '(':
l.emit(itemLeftPar)
case r == ')':
l.emit(itemRightPar)
case r == '.':
l.emit(itemDot)
case r == ',':
l.emit(itemComma)
case r == '"':
l.emit(itemQuote)
return lexInsideString
case r == '/', r == '#':
return lexComment
case r == ';':
l.emit(itemEndStatement)
case r == ':':
l.emit(itemColon)
case isOperator(r):
l.backup()
return lexOperator
default:
return nil
}
}
return nil
}
type Lexer struct {
name string
input string
start int
pos int
width int
state stateFn
items chan item
err error
lineno int
}
func lexer(name, input string) *Lexer {
l := &Lexer{
name: name,
input: input,
state: lexText,
items: make(chan item, 20),
}
Lineno = 0
return l
}
// Grabs the current blob of text
func (l *Lexer) blob() string {
return l.input[l.start:l.pos]
}
// Emits a new item on to item channel for processing
func (l *Lexer) emit(t itemType) {
l.items <- item{t, l.blob()}
l.start = l.pos
}
// Accepts checks whether the given input matches the next rune
func (l *Lexer) accept(valid string) bool {
if strings.IndexRune(valid, l.next()) >= 0 {
return true
}
l.backup()
return false
}
// Continues *eating* the next rune until no longer valid
func (l *Lexer) acceptRegexp(valid string) bool {
if MatchRegexp(valid, []byte(string(l.next()))) {
return true
}
l.backup()
return false
}
func MatchRegexp(reg string, str []byte) bool {
ok, _ := regexp.Match(reg, str)
return ok
}
func (l *Lexer) acceptRunRegexp(valid string) {
for r := l.next(); MatchRegexp(valid, []byte(string(r))); {
}
l.backup()
}
func (l *Lexer) acceptRun(valid string) {
for strings.IndexRune(valid, l.next()) >= 0 {
}
l.backup()
}
func (l *Lexer) acceptRunUntill(until rune) bool {
// Continues running until a rune is found
var i rune
for i = l.next(); strings.IndexRune(string(until), i) == -1; i = l.next() {
if i == eof {
break
}
}
l.backup()
if i == eof {
return false
}
return true
}
// Grabs the next item of the channel and returns it, or nil if we're done
func (l *Lexer) nextItem() item {
for {
select {
case item := <-l.items:
return item
default:
if l.state == nil {
return item{}
}
l.state = l.state(l)
}
}
panic("not reached")
}
// Takes the next rune and returns it or returns EOF
func (l *Lexer) next() (rune rune) {
if l.pos >= len(l.input) {
l.width = 0
return eof
}
rune, l.width = utf8.DecodeRuneInString(l.input[l.pos:])
l.pos += l.width
return rune
}
// Look ahead
func (l *Lexer) peek() rune {
rune := l.next()
l.backup()
return rune
}
// Backup a previous *next*
func (l *Lexer) backup() {
l.pos -= l.width
}
// Ignore the current rune
func (l *Lexer) ignore() {
l.start = l.pos
}
// yacc's lexing method
func (l *Lexer) Lex(lval *yySymType) int {
item := l.nextItem()
lval.str = item.val
return int(item.typ)
}
func (l *Lexer) Error(s string) {
l.err = fmt.Errorf("line %d: %s: %s", Lineno, s, l.blob())
}