/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/* Generated By:JJTree&JavaCC: Do not edit this line. ParserTokenManager.java */
{
{
switch (pos)
{
case 0:
return 0;
{
jjmatchedKind = 31;
return 47;
}
{
jjmatchedKind = 31;
return 48;
}
return -1;
case 1:
{
jjmatchedKind = 31;
jjmatchedPos = 1;
return 49;
}
{
jjmatchedKind = 31;
jjmatchedPos = 1;
return 50;
}
return -1;
case 2:
{
jjmatchedKind = 31;
jjmatchedPos = 2;
return 49;
}
return 49;
{
jjmatchedKind = 31;
jjmatchedPos = 2;
return 50;
}
return -1;
case 3:
{
if (jjmatchedPos != 3)
{
jjmatchedKind = 31;
jjmatchedPos = 3;
}
return 49;
}
return 49;
{
if (jjmatchedPos != 3)
{
jjmatchedKind = 31;
jjmatchedPos = 3;
}
return 50;
}
return -1;
case 4:
return 51;
{
if (jjmatchedPos < 3)
{
jjmatchedKind = 31;
jjmatchedPos = 3;
}
return 51;
}
return 49;
{
jjmatchedKind = 31;
jjmatchedPos = 4;
return 49;
}
return -1;
case 5:
return 49;
{
if (jjmatchedPos != 5)
{
jjmatchedKind = 31;
jjmatchedPos = 5;
}
return 49;
}
{
if (jjmatchedPos != 5)
{
jjmatchedKind = 31;
jjmatchedPos = 5;
}
return 51;
}
return -1;
case 6:
return 51;
{
jjmatchedKind = 31;
jjmatchedPos = 6;
return 49;
}
{
jjmatchedKind = 31;
jjmatchedPos = 6;
return 51;
}
return -1;
case 7:
{
jjmatchedKind = 31;
jjmatchedPos = 7;
return 51;
}
return 51;
return 49;
{
jjmatchedKind = 31;
jjmatchedPos = 7;
return 49;
}
return -1;
case 8:
return 51;
{
jjmatchedKind = 31;
jjmatchedPos = 8;
return 49;
}
{
jjmatchedKind = 31;
jjmatchedPos = 8;
return 51;
}
return -1;
case 9:
return 51;
return 49;
{
jjmatchedKind = 31;
jjmatchedPos = 9;
return 51;
}
{
jjmatchedKind = 31;
jjmatchedPos = 9;
return 49;
}
return -1;
case 10:
{
jjmatchedKind = 31;
jjmatchedPos = 10;
return 51;
}
return 49;
return -1;
case 11:
{
jjmatchedKind = 31;
jjmatchedPos = 11;
return 51;
}
return -1;
case 12:
{
jjmatchedKind = 31;
jjmatchedPos = 12;
return 51;
}
return -1;
case 13:
{
jjmatchedKind = 31;
jjmatchedPos = 13;
return 51;
}
return 51;
return -1;
case 14:
{
jjmatchedKind = 31;
jjmatchedPos = 14;
return 51;
}
return -1;
default :
return -1;
}
}
{
}
{
jjmatchedPos = pos;
return pos + 1;
}
{
jjmatchedPos = pos;
}
private final int jjMoveStringLiteralDfa0_0()
{
switch(curChar)
{
case 33:
case 44:
case 45:
case 46:
case 47:
case 61:
case 97:
return jjMoveStringLiteralDfa1_0(0x180L);
case 99:
return jjMoveStringLiteralDfa1_0(0x400L);
case 101:
return jjMoveStringLiteralDfa1_0(0x800L);
case 104:
return jjMoveStringLiteralDfa1_0(0x1000L);
case 105:
return jjMoveStringLiteralDfa1_0(0x500000L);
case 109:
return jjMoveStringLiteralDfa1_0(0x4000L);
case 114:
return jjMoveStringLiteralDfa1_0(0x60000L);
case 116:
return jjMoveStringLiteralDfa1_0(0xa80000L);
case 123:
case 125:
default :
}
}
{
return 1;
}
switch(curChar)
{
case 97:
case 99:
case 101:
case 110:
case 111:
case 114:
default :
break;
}
}
{
return 2;
}
switch(curChar)
{
case 97:
case 99:
case 102:
case 108:
break;
case 109:
case 110:
case 115:
case 116:
default :
break;
}
}
{
return 3;
}
switch(curChar)
{
case 97:
case 100:
case 101:
case 109:
case 111:
case 112:
{
jjmatchedKind = 19;
jjmatchedPos = 3;
}
case 116:
default :
break;
}
}
{
return 4;
}
switch(curChar)
{
case 45:
case 103:
case 114:
case 115:
case 117:
default :
break;
}
}
{
return 5;
}
switch(curChar)
{
case 99:
case 101:
case 109:
{
jjmatchedKind = 20;
jjmatchedPos = 5;
}
case 110:
case 111:
case 112:
case 115:
break;
case 119:
default :
break;
}
}
{
return 6;
}
switch(curChar)
{
case 45:
case 105:
case 110:
case 111:
case 114:
case 117:
default :
break;
}
}
{
return 7;
}
switch(curChar)
{
case 99:
case 105:
case 108:
case 109:
case 115:
break;
case 116:
default :
break;
}
}
{
return 8;
}
switch(curChar)
{
case 105:
case 109:
case 111:
case 115:
case 116:
case 121:
break;
default :
break;
}
}
{
return 9;
}
switch(curChar)
{
case 101:
case 109:
case 117:
default :
break;
}
}
{
return 10;
}
switch(curChar)
{
case 109:
case 110:
case 115:
break;
default :
break;
}
}
{
return 11;
}
switch(curChar)
{
case 105:
case 117:
default :
break;
}
}
{
return 12;
}
switch(curChar)
{
case 110:
case 116:
default :
break;
}
}
{
return 13;
}
switch(curChar)
{
case 105:
case 121:
break;
default :
break;
}
}
{
return 14;
}
switch(curChar)
{
case 116:
default :
break;
}
}
{
return 15;
}
switch(curChar)
{
case 121:
break;
default :
break;
}
}
{
{
}
}
{
do {
}
{
}
{
do {
}
{
}
static final long[] jjbitVec0 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 47;
int i = 1;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 49:
if ((0x3ff200000000000L & l) != 0L)
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
}
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(20);
}
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(19);
}
break;
case 48:
if ((0x3ff200000000000L & l) != 0L)
else if (curChar == 58)
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
}
else if (curChar == 58)
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(20);
}
if ((0x3ff000000000000L & l) != 0L)
if ((0x3ff000000000000L & l) != 0L)
break;
case 47:
if ((0x3ff200000000000L & l) != 0L)
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
}
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(20);
}
break;
case 50:
if ((0x3ff200000000000L & l) != 0L)
else if (curChar == 58)
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
}
else if (curChar == 58)
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(20);
}
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(19);
}
if ((0x3ff000000000000L & l) != 0L)
if ((0x3ff000000000000L & l) != 0L)
break;
case 5:
if ((0x3ff000000000000L & l) != 0L)
else if (curChar == 58)
else if (curChar == 34)
else if (curChar == 35)
else if (curChar == 45)
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
}
if ((0x3fe000000000000L & l) != 0L)
{
if (kind > 24)
kind = 24;
}
else if (curChar == 48)
{
if (kind > 24)
kind = 24;
}
break;
case 51:
if ((0x3ff200000000000L & l) != 0L)
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(19);
}
break;
case 0:
if (curChar == 45)
break;
case 1:
if ((0xffffffffffffdbffL & l) != 0L)
break;
case 2:
kind = 5;
break;
case 3:
kind = 5;
break;
case 4:
if (curChar == 13)
break;
case 6:
if (curChar == 35)
break;
case 7:
if ((0xffffffffffffdbffL & l) != 0L)
break;
case 8:
kind = 6;
break;
case 9:
kind = 6;
break;
case 10:
if (curChar == 13)
break;
case 11:
if ((0x3fe000000000000L & l) == 0L)
break;
if (kind > 24)
kind = 24;
break;
case 12:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 24)
kind = 24;
break;
case 14:
if (curChar == 34)
break;
case 15:
if ((0xfffffffbffffffffL & l) != 0L)
break;
case 16:
kind = 35;
break;
case 17:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 31)
kind = 31;
break;
case 18:
if ((0x3ff200000000000L & l) != 0L)
break;
case 19:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 31)
kind = 31;
jjCheckNAdd(19);
break;
case 20:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 31)
kind = 31;
jjCheckNAdd(20);
break;
case 21:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 31)
kind = 31;
break;
case 22:
if ((0x3ff000000000000L & l) != 0L)
break;
case 23:
if ((0x3ff000000000000L & l) != 0L)
break;
case 24:
if (curChar == 58)
break;
case 25:
case 41:
kind = 28;
break;
case 26:
if ((0x3ff000000000000L & l) != 0L)
break;
case 27:
if (curChar == 58)
break;
case 28:
case 42:
if (curChar == 58)
break;
case 29:
if ((0x3ff000000000000L & l) != 0L)
break;
case 30:
if (curChar == 46)
jjCheckNAdd(31);
break;
case 31:
if ((0x3ff000000000000L & l) != 0L)
break;
case 32:
if (curChar == 46)
jjCheckNAdd(33);
break;
case 33:
if ((0x3ff000000000000L & l) != 0L)
break;
case 34:
if (curChar == 46)
jjCheckNAdd(35);
break;
case 35:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 28)
kind = 28;
jjCheckNAdd(35);
break;
case 36:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 28)
kind = 28;
break;
case 37:
if ((0x3ff000000000000L & l) != 0L)
break;
case 38:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 28)
kind = 28;
jjCheckNAdd(38);
break;
case 39:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 28)
kind = 28;
break;
case 40:
if (curChar == 58)
break;
case 43:
if (curChar != 48)
break;
if (kind > 24)
kind = 24;
break;
case 45:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 24)
kind = 24;
break;
case 46:
if ((0xff000000000000L & l) == 0L)
break;
if (kind > 24)
kind = 24;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 49:
if ((0x7fffffe87fffffeL & l) != 0L)
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
}
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(20);
}
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(19);
}
break;
case 48:
if ((0x7fffffe87fffffeL & l) != 0L)
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
}
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(20);
}
if ((0x7e0000007eL & l) != 0L)
if ((0x7e0000007eL & l) != 0L)
break;
case 47:
if ((0x7fffffe87fffffeL & l) != 0L)
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
}
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(20);
}
break;
case 50:
if ((0x7fffffe87fffffeL & l) != 0L)
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
}
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(20);
}
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(19);
}
if ((0x7e0000007eL & l) != 0L)
if ((0x7e0000007eL & l) != 0L)
break;
case 5:
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
}
if ((0x7e0000007eL & l) != 0L)
break;
case 51:
if ((0x7fffffe87fffffeL & l) != 0L)
if ((0x7fffffe07fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(19);
}
break;
case 1:
break;
case 7:
break;
case 13:
kind = 24;
break;
case 15:
break;
case 17:
if ((0x7fffffe07fffffeL & l) == 0L)
break;
if (kind > 31)
kind = 31;
break;
case 18:
if ((0x7fffffe87fffffeL & l) != 0L)
break;
case 19:
if ((0x7fffffe07fffffeL & l) == 0L)
break;
if (kind > 31)
kind = 31;
jjCheckNAdd(19);
break;
case 20:
if ((0x7fffffe07fffffeL & l) == 0L)
break;
if (kind > 31)
kind = 31;
jjCheckNAdd(20);
break;
case 21:
if ((0x7fffffe07fffffeL & l) == 0L)
break;
if (kind > 31)
kind = 31;
break;
case 22:
if ((0x7e0000007eL & l) != 0L)
break;
case 23:
if ((0x7e0000007eL & l) != 0L)
break;
case 26:
if ((0x7e0000007eL & l) != 0L)
break;
case 36:
if ((0x7e0000007eL & l) == 0L)
break;
if (kind > 28)
kind = 28;
break;
case 37:
if ((0x7e0000007eL & l) != 0L)
break;
case 38:
if ((0x7e0000007eL & l) == 0L)
break;
if (kind > 28)
kind = 28;
jjCheckNAdd(38);
break;
case 39:
if ((0x7e0000007eL & l) == 0L)
break;
if (kind > 28)
kind = 28;
break;
case 44:
if ((0x100000001000000L & l) != 0L)
jjCheckNAdd(45);
break;
case 45:
if ((0x7e0000007eL & l) == 0L)
break;
if (kind > 24)
kind = 24;
break;
default : break;
}
} while(i != startsAt);
}
else
{
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 1:
break;
case 7:
break;
case 15:
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
kind = 0x7fffffff;
}
++curPos;
return curPos;
}
}
static final int[] jjnextStates = {
18, 19, 21, 28, 29, 39, 23, 24, 26, 27, 41, 42, 7, 8, 10, 18,
20, 21, 44, 46, 13, 1, 2, 4, 37, 28, 38, 26, 27, 37, 28, 38,
15, 16,
};
"\141\143\154", "\75", "\143\157\155\155\165\156\151\164\151\145\163",
"\145\156\164\145\162\160\162\151\163\145", "\150\157\163\164\163", "\173", "\155\141\156\141\147\145\162\163", "\55",
"\175", "\162\145\141\144\55\157\156\154\171",
"\162\145\141\144\55\167\162\151\164\145", "\164\162\141\160", "\151\156\146\157\162\155",
"\164\162\141\160\55\143\157\155\155\165\156\151\164\171", "\151\156\146\157\162\155\55\143\157\155\155\165\156\151\164\171",
"\164\162\141\160\55\156\165\155", null, null, null, null, null, null, null, null, null, null, null, null, "\54",
"\56", "\41", "\57", };
"DEFAULT",
};
static final long[] jjtoToken = {
0xf891ffff81L,
};
static final long[] jjtoSkip = {
0x7eL,
};
protected char curChar;
{
throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");
}
{
this(stream);
}
{
ReInitRounds();
}
private final void ReInitRounds()
{
int i;
jjround = 0x80000001;
for (i = 47; i-- > 0;)
jjrounds[i] = 0x80000000;
}
{
}
{
throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE);
else
}
{
t.kind = jjmatchedKind;
return t;
}
int jjnewStateCnt;
int jjround;
int jjmatchedPos;
int jjmatchedKind;
{
int kind;
int curPos = 0;
EOFLoop :
for (;;)
{
try
{
}
{
jjmatchedKind = 0;
matchedToken = jjFillToken();
return matchedToken;
}
}
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
if (jjmatchedKind != 0x7fffffff)
{
{
matchedToken = jjFillToken();
return matchedToken;
}
else
{
continue EOFLoop;
}
}
boolean EOFSeen = false;
EOFSeen = true;
error_line++;
error_column = 0;
}
else
error_column++;
}
if (!EOFSeen) {
}
throw new TokenMgrError(EOFSeen, curLexState, error_line, error_column, error_after, curChar, TokenMgrError.LEXICAL_ERROR);
}
}
}