/** Read fractional part and 'd' or 'f' suffix of floating point number. */ private void scanFractionAndSuffix() { this.radix = 10; scanFraction(); if (ch == 'f' || ch == 'F') { putChar(ch); scanChar(); token = FLOATLITERAL; } else { if (ch == 'd' || ch == 'D') { putChar(ch); scanChar(); } token = DOUBLELITERAL; } }
/** Read fractional part and 'd' or 'f' suffix of floating point number. */ private void scanFractionAndSuffix() { this.radix = 10; scanFraction(); if (ch == 'f' || ch == 'F') { putChar(ch); scanChar(); token = FLOATLITERAL; } else { if (ch == 'd' || ch == 'D') { putChar(ch); scanChar(); } token = DOUBLELITERAL; } }
/** Read fractional part of floating point number. */ private void scanFraction() { while (digit(10) >= 0) { putChar(ch); scanChar(); } int sp1 = sp; if (ch == 'e' || ch == 'E') { putChar(ch); scanChar(); if (ch == '+' || ch == '-') { putChar(ch); scanChar(); } if ('0' <= ch && ch <= '9') { do { putChar(ch); scanChar(); } while ('0' <= ch && ch <= '9'); return; } lexError("malformed.fp.lit"); sp = sp1; } }
/** Read fractional part of floating point number. */ private void scanFraction() { while (digit(10) >= 0) { putChar(ch); scanChar(); } int sp1 = sp; if (ch == 'e' || ch == 'E') { putChar(ch); scanChar(); if (ch == '+' || ch == '-') { putChar(ch); scanChar(); } if ('0' <= ch && ch <= '9') { do { putChar(ch); scanChar(); } while ('0' <= ch && ch <= '9'); return; } lexError("malformed.fp.lit"); sp = sp1; } }
/** Read fractional part and 'd' or 'f' suffix of floating point number. */ private void scanHexFractionAndSuffix(boolean seendigit) { this.radix = 16; assert ch == '.'; putChar(ch); scanChar(); while (digit(16) >= 0) { seendigit = true; putChar(ch); scanChar(); } if (!seendigit) lexError("invalid.hex.number"); else scanHexExponentAndSuffix(); }
/** Read fractional part and 'd' or 'f' suffix of floating point number. */ private void scanHexFractionAndSuffix(boolean seendigit) { this.radix = 16; assert ch == '.'; putChar(ch); scanChar(); while (digit(16) >= 0) { seendigit = true; putChar(ch); scanChar(); } if (!seendigit) lexError("invalid.hex.number"); else scanHexExponentAndSuffix(); }
if (buf[bp+1] == '\\' && unicodeConversionBp != bp) { bp++; putChar('\\'); scanChar(); } else { putChar((char)oct); break; case 'b': putChar('\b'); scanChar(); break; case 't': putChar('\t'); scanChar(); break; case 'n': putChar('\n'); scanChar(); break; case 'f': putChar('\f'); scanChar(); break; case 'r': putChar('\r'); scanChar(); break; case '\'': putChar('\''); scanChar(); break; case '\"': putChar('\"'); scanChar(); break; case '\\': putChar('\\'); scanChar(); break; default: lexError(bp, "illegal.esc.char"); putChar(ch); scanChar();
if (buf[bp+1] == '\\' && unicodeConversionBp != bp) { bp++; putChar('\\'); scanChar(); } else { putChar((char)oct); break; case 'b': putChar('\b'); scanChar(); break; case 't': putChar('\t'); scanChar(); break; case 'n': putChar('\n'); scanChar(); break; case 'f': putChar('\f'); scanChar(); break; case 'r': putChar('\r'); scanChar(); break; case '\'': putChar('\''); scanChar(); break; case '\"': putChar('\"'); scanChar(); break; case '\\': putChar('\\'); scanChar(); break; default: lexError(bp, "illegal.esc.char"); putChar(ch); scanChar();
/** Read longest possible sequence of special characters and convert * to token. */ private void scanOperator() { while (true) { putChar(ch); Name newname = names.fromChars(sbuf, 0, sp); if (keywords.key(newname) == IDENTIFIER) { sp--; break; } name = newname; token = keywords.key(newname); scanChar(); if (!isSpecial(ch)) break; } }
/** Read longest possible sequence of special characters and convert * to token. */ private void scanOperator() { while (true) { putChar(ch); Name newname = names.fromChars(sbuf, 0, sp); if (keywords.key(newname) == IDENTIFIER) { sp--; break; } name = newname; token = keywords.key(newname); scanChar(); if (!isSpecial(ch)) break; } }
putChar('0'); scanNumber(8); scanChar(); if ('0' <= ch && ch <= '9') { putChar('.'); scanFractionAndSuffix(); } else if (ch == '.') { putChar('.'); putChar('.'); scanChar(); if (ch == '.') { scanChar(); putChar('.'); token = ELLIPSIS; } else { if (high != 0) { if (sp == sbuf.length) { putChar(high); } else { sbuf[sp++] = high;
putChar('0'); scanNumber(8); scanChar(); if ('0' <= ch && ch <= '9') { putChar('.'); scanFractionAndSuffix(); } else if (ch == '.') { putChar('.'); putChar('.'); scanChar(); if (ch == '.') { scanChar(); putChar('.'); token = ELLIPSIS; } else { if (high != 0) { if (sp == sbuf.length) { putChar(high); } else { sbuf[sp++] = high;