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
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
|
/* NSC -- new Scala compiler
* Copyright 2005-2009 LAMP/EPFL
* @author Martin Odersky
*/
package scala.tools.nsc
package javac
import scala.tools.nsc.util._
import SourceFile.{LF, FF, CR, SU}
import JavaTokens._
import scala.annotation.switch
// Todo merge these better with Scanners
trait JavaScanners {
val global : Global
import global._
abstract class AbstractJavaTokenData {
def token: Int
type ScanPosition
val NoPos: ScanPosition
def pos: ScanPosition
def name: Name
}
/** A class for representing a token's data. */
trait JavaTokenData extends AbstractJavaTokenData {
type ScanPosition = Int
val NoPos: Int = -1
/** the next token */
var token: Int = EMPTY
/** the token's position */
var pos: Int = 0
/** the first character position after the previous token */
var lastPos: Int = 0
/** the name of an identifier or token */
var name: Name = null
/** the base of a number */
var base: Int = 0
def copyFrom(td: JavaTokenData) = {
this.token = td.token
this.pos = td.pos
this.lastPos = td.lastPos
this.name = td.name
this.base = td.base
}
}
/** ...
*/
abstract class AbstractJavaScanner extends AbstractJavaTokenData {
implicit def p2g(pos: Position): ScanPosition
implicit def g2p(pos: ScanPosition): Position
def warning(pos: ScanPosition, msg: String): Unit
def error (pos: ScanPosition, msg: String): Unit
def incompleteInputError(pos: ScanPosition, msg: String): Unit
def deprecationWarning(pos: ScanPosition, msg: String): Unit
/** the last error position
*/
var errpos: ScanPosition
var lastPos: ScanPosition
def skipToken: ScanPosition
def nextToken: Unit
def next: AbstractJavaTokenData
def intVal(negated: Boolean): Long
def floatVal(negated: Boolean): Double
def intVal: Long = intVal(false)
def floatVal: Double = floatVal(false)
//def token2string(token : Int) : String = configuration.token2string(token)
/** return recent scala doc, if any */
def flushDoc: String
def currentPos: Position
}
object JavaScannerConfiguration {
// Keywords -----------------------------------------------------------------
/** Keyword array; maps from name indices to tokens */
private var key: Array[Byte] = _
private var maxKey = 0
private var tokenName = new Array[Name](128)
{
var tokenCount = 0
// Enter keywords
def enterKeyword(s: String, tokenId: Int) {
val n = newTermName(s)
while (tokenId >= tokenName.length) {
val newTokName = new Array[Name](tokenName.length * 2)
Array.copy(tokenName, 0, newTokName, 0, newTokName.length)
tokenName = newTokName
}
tokenName(tokenId) = n
if (n.start > maxKey) maxKey = n.start
if (tokenId >= tokenCount) tokenCount = tokenId + 1
}
enterKeyword("abstract", ABSTRACT)
enterKeyword("assert", ASSERT)
enterKeyword("boolean", BOOLEAN)
enterKeyword("break", BREAK)
enterKeyword("byte", BYTE)
enterKeyword("case", CASE)
enterKeyword("catch", CATCH)
enterKeyword("char", CHAR)
enterKeyword("class", CLASS)
enterKeyword("const", CONST)
enterKeyword("continue", CONTINUE)
enterKeyword("default", DEFAULT)
enterKeyword("do", DO)
enterKeyword("double", DOUBLE)
enterKeyword("else", ELSE)
enterKeyword("enum", ENUM)
enterKeyword("extends", EXTENDS)
enterKeyword("final", FINAL)
enterKeyword("finally", FINALLY)
enterKeyword("float", FLOAT)
enterKeyword("for", FOR)
enterKeyword("if", IF)
enterKeyword("goto", GOTO)
enterKeyword("implements", IMPLEMENTS)
enterKeyword("import", IMPORT)
enterKeyword("instanceof", INSTANCEOF)
enterKeyword("int", INT)
enterKeyword("interface", INTERFACE)
enterKeyword("long", LONG)
enterKeyword("native", NATIVE)
enterKeyword("new", NEW)
enterKeyword("package", PACKAGE)
enterKeyword("private", PRIVATE)
enterKeyword("protected", PROTECTED)
enterKeyword("public", PUBLIC)
enterKeyword("return", RETURN)
enterKeyword("short", SHORT)
enterKeyword("static", STATIC)
enterKeyword("strictfp", STRICTFP)
enterKeyword("super", SUPER)
enterKeyword("switch", SWITCH)
enterKeyword("synchronized", SYNCHRONIZED)
enterKeyword("this", THIS)
enterKeyword("throw", THROW)
enterKeyword("throws", THROWS)
enterKeyword("transient", TRANSIENT)
enterKeyword("try", TRY)
enterKeyword("void", VOID)
enterKeyword("volatile", VOLATILE)
enterKeyword("while", WHILE)
// Build keyword array
key = new Array[Byte](maxKey + 1)
for (i <- 0 to maxKey)
key(i) = IDENTIFIER
for (j <- 0 until tokenCount)
if (tokenName(j) ne null)
key(tokenName(j).start) = j.asInstanceOf[Byte]
}
//Token representation -----------------------------------------------------
/** Convert name to token */
def name2token(name: Name): Int =
if (name.start <= maxKey) key(name.start) else IDENTIFIER
/** Returns the string representation of given token. */
def token2string(token: Int): String = token match {
case IDENTIFIER =>
"identifier"/* + \""+name+"\""*/
case CHARLIT =>
"character literal"
case INTLIT =>
"integer literal"
case LONGLIT =>
"long literal"
case FLOATLIT =>
"float literal"
case DOUBLELIT =>
"double literal"
case STRINGLIT =>
"string literal"
case COMMA => "`,'"
case SEMI => "`;'"
case DOT => "`.'"
case AT => "`@'"
case COLON => "`:'"
case ASSIGN => "`='"
case EQEQ => "`=='"
case BANGEQ => "`!='"
case LT => "`<'"
case GT => "`>'"
case LTEQ => "`<='"
case GTEQ => "`>='"
case BANG => "`!'"
case QMARK => "`?'"
case AMP => "`&'"
case BAR => "`|'"
case PLUS => "`+'"
case MINUS => "`-'"
case ASTERISK => "`*'"
case SLASH => "`/'"
case PERCENT => "`%'"
case HAT => "`^'"
case LTLT => "`<<'"
case GTGT => "`>>'"
case GTGTGT => "`>>>'"
case AMPAMP => "`&&'"
case BARBAR => "`||'"
case PLUSPLUS => "`++'"
case MINUSMINUS => "`--'"
case TILDE => "`~'"
case DOTDOTDOT => "`...'"
case AMPEQ => "`&='"
case BAREQ => "`|='"
case PLUSEQ => "`+='"
case MINUSEQ => "`-='"
case ASTERISKEQ => "`*='"
case SLASHEQ => "`/='"
case PERCENTEQ => "`%='"
case HATEQ => "`^='"
case LTLTEQ => "`<<='"
case GTGTEQ => "`>>='"
case GTGTGTEQ => "`>>>='"
case LPAREN => "`('"
case RPAREN => "`)'"
case LBRACE => "`{'"
case RBRACE => "`}'"
case LBRACKET => "`['"
case RBRACKET => "`]'"
case EOF => "eof"
case ERROR => "something"
case _ =>
try {
"`" + tokenName(token) + "'"
} catch {
case _: ArrayIndexOutOfBoundsException =>
"`<" + token + ">'"
case _: NullPointerException =>
"`<(" + token + ")>'"
}
}
}
/** A scanner for Java.
*
* @author Martin Odersky
*/
abstract class JavaScanner extends AbstractJavaScanner with JavaTokenData with Cloneable {
override def intVal = super.intVal// todo: needed?
override def floatVal = super.floatVal
override var errpos: Int = NoPos
def currentPos: Position = g2p(pos - 1)
var in: JavaCharArrayReader = _
def dup: JavaScanner = {
val dup = clone().asInstanceOf[JavaScanner]
dup.in = in.dup
dup
}
/** character buffer for literals
*/
val cbuf = new StringBuilder()
/** append Unicode character to "lit" buffer
*/
protected def putChar(c: Char) { cbuf.append(c) }
/** Clear buffer and set name */
private def setName() {
name = newTermName(cbuf.toString())
cbuf.setLength(0)
}
/** buffer for the documentation comment
*/
var docBuffer: StringBuilder = null
def flushDoc = {
val ret = if (docBuffer != null) docBuffer.toString else null
docBuffer = null
ret
}
/** add the given character to the documentation buffer
*/
protected def putDocChar(c: Char) {
if (docBuffer ne null) docBuffer.append(c)
}
private class JavaTokenData0 extends JavaTokenData
/** we need one token lookahead
*/
val next : JavaTokenData = new JavaTokenData0
val prev : JavaTokenData = new JavaTokenData0
// Get next token ------------------------------------------------------------
/** read next token and return last position
*/
def skipToken: Int = {
val p = pos; nextToken
p - 1
}
def nextToken {
if (next.token == EMPTY) {
//print("[")
val t = fetchToken()
//print(this)
//print("]")
t
} else {
this copyFrom next
next.token = EMPTY
}
}
def lookaheadToken: Int = {
prev copyFrom this
nextToken
val t = token
next copyFrom this
this copyFrom prev
t
}
private def afterLineEnd() = (
lastPos < in.lineStartPos &&
(in.lineStartPos <= pos ||
lastPos < in.lastLineStartPos && in.lastLineStartPos <= pos)
)
/** read next token
*/
private def fetchToken() {
if (token == EOF) return
lastPos = in.cpos - 1 // Position.encode(in.cline, in.ccol)
//var index = bp
while (true) {
in.ch match {
case ' ' | '\t' | CR | LF | FF =>
in.next
case _ =>
pos = in.cpos // Position.encode(in.cline, in.ccol)
(in.ch: @switch) match {
case 'A' | 'B' | 'C' | 'D' | 'E' |
'F' | 'G' | 'H' | 'I' | 'J' |
'K' | 'L' | 'M' | 'N' | 'O' |
'P' | 'Q' | 'R' | 'S' | 'T' |
'U' | 'V' | 'W' | 'X' | 'Y' |
'Z' | '$' | '_' |
'a' | 'b' | 'c' | 'd' | 'e' |
'f' | 'g' | 'h' | 'i' | 'j' |
'k' | 'l' | 'm' | 'n' | 'o' |
'p' | 'q' | 'r' | 's' | 't' |
'u' | 'v' | 'w' | 'x' | 'y' |
'z' =>
putChar(in.ch)
in.next
getIdentRest
return
case '0' =>
putChar(in.ch)
in.next
if (in.ch == 'x' || in.ch == 'X') {
in.next
base = 16
} else {
base = 8
}
getNumber
return
case '1' | '2' | '3' | '4' |
'5' | '6' | '7' | '8' | '9' =>
base = 10
getNumber
return
case '\"' =>
in.next
while (in.ch != '\"' && (in.isUnicode || in.ch != CR && in.ch != LF && in.ch != SU)) {
getlitch()
}
if (in.ch == '\"') {
token = STRINGLIT
setName()
in.next
} else {
syntaxError("unclosed string literal")
}
return
case '\'' =>
in.next
getlitch()
if (in.ch == '\'') {
in.next
token = CHARLIT
setName()
} else {
syntaxError("unclosed character literal")
}
return
case '=' =>
token = ASSIGN
in.next
if (in.ch == '=') {
token = EQEQ
in.next
}
return
case '>' =>
token = GT
in.next
if (in.ch == '=') {
token = GTEQ
in.next
} else if (in.ch == '>') {
token = GTGT
in.next
if (in.ch == '=') {
token = GTGTEQ
in.next
} else if (in.ch == '>') {
token = GTGTGT
in.next
if (in.ch == '=') {
token = GTGTGTEQ
in.next
}
}
}
return
case '<' =>
token = LT
in.next
if (in.ch == '=') {
token = LTEQ
in.next
} else if (in.ch == '<') {
token = LTLT
in.next
if (in.ch == '=') {
token = LTLTEQ
in.next
}
}
return
case '!' =>
token = BANG
in.next
if (in.ch == '=') {
token = BANGEQ
in.next
}
return
case '~' =>
token = TILDE
in.next
return
case '?' =>
token = QMARK
in.next
return
case ':' =>
token = COLON
in.next
return
case '@' =>
token = AT
in.next
return
case '&' =>
token = AMP
in.next
if (in.ch == '&') {
token = AMPAMP
in.next
} else if (in.ch == '=') {
token = AMPEQ
in.next
}
return
case '|' =>
token = BAR
in.next
if (in.ch == '|') {
token = BARBAR
in.next
} else if (in.ch == '=') {
token = BAREQ
in.next
}
return
case '+' =>
token = PLUS
in.next
if (in.ch == '+') {
token = PLUSPLUS
in.next
} else if (in.ch == '=') {
token = PLUSEQ
in.next
}
return
case '-' =>
token = MINUS
in.next
if (in.ch == '-') {
token = MINUSMINUS
in.next
} else if (in.ch == '=') {
token = MINUSEQ
in.next
}
return
case '*' =>
token = ASTERISK
in.next
if (in.ch == '=') {
token = ASTERISKEQ
in.next
}
return
case '/' =>
in.next
if (!skipComment()) {
token = SLASH
in.next
if (in.ch == '=') {
token = SLASHEQ
in.next
}
return
}
case '^' =>
token = HAT
in.next
if (in.ch == '=') {
token = HATEQ
in.next
}
return
case '%' =>
token = PERCENT
in.next
if (in.ch == '=') {
token = PERCENTEQ
in.next
}
return
case '.' =>
token = DOT
in.next
if ('0' <= in.ch && in.ch <= '9') {
putChar('.'); getFraction
} else if (in.ch == '.') {
in.next
if (in.ch == '.') {
in.next
token = DOTDOTDOT
} else syntaxError("`.' character expected")
}
return
case ';' =>
token = SEMI
in.next
return
case ',' =>
token = COMMA
in.next
return
case '(' =>
token = LPAREN
in.next
return
case '{' =>
token = LBRACE
in.next
return
case ')' =>
token = RPAREN
in.next
return
case '}' =>
token = RBRACE
in.next
return
case '[' =>
token = LBRACKET
in.next
return
case ']' =>
token = RBRACKET
in.next
return
case SU =>
if (!in.hasNext) token = EOF
else {
syntaxError("illegal character")
in.next
}
return
case _ =>
if (Character.isUnicodeIdentifierStart(in.ch)) {
putChar(in.ch)
in.next
getIdentRest
} else {
syntaxError("illegal character: "+in.ch.toInt)
in.next
}
return
}
}
}
}
private def skipComment(): Boolean = {
if (in.ch == '/') {
do {
in.next
} while ((in.ch != CR) && (in.ch != LF) && (in.ch != SU))
true
} else if (in.ch == '*') {
docBuffer = null
in.next
val scalaDoc = ("/**", "*/")
if (in.ch == '*' && onlyPresentation)
docBuffer = new StringBuilder(scalaDoc._1)
do {
do {
if (in.ch != '*' && in.ch != SU) {
in.next; putDocChar(in.ch)
}
} while (in.ch != '*' && in.ch != SU)
while (in.ch == '*') {
in.next; putDocChar(in.ch)
}
} while (in.ch != '/' && in.ch != SU)
if (in.ch == '/') in.next
else incompleteInputError("unclosed comment")
true
} else {
false
}
}
// Identifiers ---------------------------------------------------------------
def isIdentStart(c: Char): Boolean = (
('A' <= c && c <= 'Z') ||
('a' <= c && c <= 'a') ||
(c == '_') || (c == '$') ||
Character.isUnicodeIdentifierStart(c)
)
def isIdentPart(c: Char) = (
isIdentStart(c) ||
('0' <= c && c <= '9') ||
Character.isUnicodeIdentifierPart(c)
)
def isSpecial(c: Char) = {
val chtp = Character.getType(c)
chtp == Character.MATH_SYMBOL || chtp == Character.OTHER_SYMBOL
}
private def getIdentRest {
while (true) {
(in.ch: @switch) match {
case 'A' | 'B' | 'C' | 'D' | 'E' |
'F' | 'G' | 'H' | 'I' | 'J' |
'K' | 'L' | 'M' | 'N' | 'O' |
'P' | 'Q' | 'R' | 'S' | 'T' |
'U' | 'V' | 'W' | 'X' | 'Y' |
'Z' | '$' |
'a' | 'b' | 'c' | 'd' | 'e' |
'f' | 'g' | 'h' | 'i' | 'j' |
'k' | 'l' | 'm' | 'n' | 'o' |
'p' | 'q' | 'r' | 's' | 't' |
'u' | 'v' | 'w' | 'x' | 'y' |
'z' |
'0' | '1' | '2' | '3' | '4' |
'5' | '6' | '7' | '8' | '9' =>
putChar(in.ch)
in.next
case '_' =>
putChar(in.ch)
in.next
getIdentRest
return
case SU =>
setName()
token = JavaScannerConfiguration.name2token(name)
return
case _ =>
if (Character.isUnicodeIdentifierPart(in.ch)) {
putChar(in.ch)
in.next
} else {
setName()
token = JavaScannerConfiguration.name2token(name)
return
}
}
}
}
// Literals -----------------------------------------------------------------
/** read next character in character or string literal:
*/
protected def getlitch() =
if (in.ch == '\\') {
in.next
if ('0' <= in.ch && in.ch <= '7') {
val leadch: Char = in.ch
var oct: Int = in.digit2int(in.ch, 8)
in.next
if ('0' <= in.ch && in.ch <= '7') {
oct = oct * 8 + in.digit2int(in.ch, 8)
in.next
if (leadch <= '3' && '0' <= in.ch && in.ch <= '7') {
oct = oct * 8 + in.digit2int(in.ch, 8)
in.next
}
}
putChar(oct.asInstanceOf[Char])
} else {
in.ch match {
case 'b' => putChar('\b')
case 't' => putChar('\t')
case 'n' => putChar('\n')
case 'f' => putChar('\f')
case 'r' => putChar('\r')
case '\"' => putChar('\"')
case '\'' => putChar('\'')
case '\\' => putChar('\\')
case _ =>
syntaxError(in.cpos - 1, "invalid escape character")
putChar(in.ch)
}
in.next
}
} else {
putChar(in.ch)
in.next
}
/** read fractional part and exponent of floating point number
* if one is present.
*/
protected def getFraction {
token = DOUBLELIT
while ('0' <= in.ch && in.ch <= '9') {
putChar(in.ch)
in.next
}
if (in.ch == 'e' || in.ch == 'E') {
val lookahead = in.copy
lookahead.next
if (lookahead.ch == '+' || lookahead.ch == '-') {
lookahead.next
}
if ('0' <= lookahead.ch && lookahead.ch <= '9') {
putChar(in.ch)
in.next
if (in.ch == '+' || in.ch == '-') {
putChar(in.ch)
in.next
}
while ('0' <= in.ch && in.ch <= '9') {
putChar(in.ch)
in.next
}
}
token = DOUBLELIT
}
if (in.ch == 'd' || in.ch == 'D') {
putChar(in.ch)
in.next
token = DOUBLELIT
} else if (in.ch == 'f' || in.ch == 'F') {
putChar(in.ch)
in.next
token = FLOATLIT
}
setName()
}
/** convert name to long value
*/
def intVal(negated: Boolean): Long = {
if (token == CHARLIT && !negated) {
if (name.length > 0) name(0) else 0
} else {
var value: Long = 0
val divider = if (base == 10) 1 else 2
val limit: Long =
if (token == LONGLIT) Math.MAX_LONG else Math.MAX_INT
var i = 0
val len = name.length
while (i < len) {
val d = in.digit2int(name(i), base)
if (d < 0) {
syntaxError("malformed integer number")
return 0
}
if (value < 0 ||
limit / (base / divider) < value ||
limit - (d / divider) < value * (base / divider) &&
!(negated && limit == value * base - 1 + d)) {
syntaxError("integer number too large")
return 0
}
value = value * base + d
i += 1
}
if (negated) -value else value
}
}
/** convert name, base to double value
*/
def floatVal(negated: Boolean): Double = {
val limit: Double =
if (token == DOUBLELIT) Math.MAX_DOUBLE else Math.MAX_FLOAT
try {
val value: Double = java.lang.Double.valueOf(name.toString()).doubleValue()
if (value > limit)
syntaxError("floating point number too large")
if (negated) -value else value
} catch {
case _: NumberFormatException =>
syntaxError("malformed floating point number")
0.0
}
}
/** read a number into name and set base
*/
protected def getNumber {
while (in.digit2int(in.ch, if (base < 10) 10 else base) >= 0) {
putChar(in.ch)
in.next
}
token = INTLIT
if (base <= 10 && in.ch == '.') {
val lookahead = in.copy
lookahead.next
lookahead.ch match {
case '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' |
'8' | '9' | 'd' | 'D' | 'e' | 'E' | 'f' | 'F' =>
putChar(in.ch)
in.next
return getFraction
case _ =>
if (!isIdentStart(lookahead.ch)) {
putChar(in.ch)
in.next
return getFraction
}
}
}
if (base <= 10 &&
(in.ch == 'e' || in.ch == 'E' ||
in.ch == 'f' || in.ch == 'F' ||
in.ch == 'd' || in.ch == 'D')) {
return getFraction
}
setName()
if (in.ch == 'l' || in.ch == 'L') {
in.next
token = LONGLIT
}
}
// Errors -----------------------------------------------------------------
/** generate an error at the given position
*/
def syntaxError(pos: Int, msg: String) {
error(pos, msg)
token = ERROR
errpos = pos
}
/** generate an error at the current token position
*/
def syntaxError(msg: String) { syntaxError(pos, msg) }
/** signal an error where the input ended in the middle of a token */
def incompleteInputError(msg: String) {
incompleteInputError(pos, msg)
token = EOF
errpos = pos
}
override def toString() = token match {
case IDENTIFIER =>
"id(" + name + ")"
case CHARLIT =>
"char(" + intVal + ")"
case INTLIT =>
"int(" + intVal + ")"
case LONGLIT =>
"long(" + intVal + ")"
case FLOATLIT =>
"float(" + floatVal + ")"
case DOUBLELIT =>
"double(" + floatVal + ")"
case STRINGLIT =>
"string(" + name + ")"
case SEMI =>
";"
case COMMA =>
","
case _ =>
JavaScannerConfiguration.token2string(token)
}
/** INIT: read lookahead character and token.
*/
def init {
in.next
nextToken
}
}
/** ...
*/
class JavaUnitScanner(unit: CompilationUnit) extends JavaScanner {
in = new JavaCharArrayReader(unit.source.asInstanceOf[BatchSourceFile].content, !settings.nouescape.value, syntaxError)
init
def warning(pos: Int, msg: String) = unit.warning(pos, msg)
def error (pos: Int, msg: String) = unit. error(pos, msg)
def incompleteInputError(pos: Int, msg: String) = unit.incompleteInputError(pos, msg)
def deprecationWarning(pos: Int, msg: String) = unit.deprecationWarning(pos, msg)
implicit def p2g(pos: Position): Int = if (pos.isDefined) pos.point else -1
implicit def g2p(pos: Int): Position = new OffsetPosition(unit.source, pos)
}
}
|