/*
* 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.
*/
/*
* This source code is provided to illustrate the usage of a given feature
* or technique and has been deliberately simplified. Additional steps
* required for a production-quality application, such as security checks,
* input validation and proper error handling, might not be present in
* this sample code.
*/
/* Generated By:JavaCC: Do not edit this line. ExpressionParserTokenManager.java */
{
{
switch (pos)
{
case 0:
return 4;
}
{
jjmatchedKind = 67;
return 28;
}
return 49;
}
return -1;
case 1:
{
if (jjmatchedPos != 1)
{
jjmatchedKind = 67;
jjmatchedPos = 1;
}
return 28;
}
return 28;
}
return -1;
case 2:
{
if (jjmatchedPos != 2)
{
jjmatchedKind = 67;
jjmatchedPos = 2;
}
return 28;
}
return 28;
}
return -1;
case 3:
{
jjmatchedKind = 67;
jjmatchedPos = 3;
return 28;
}
return 28;
}
return -1;
case 4:
{
if (jjmatchedPos != 4)
{
jjmatchedKind = 67;
jjmatchedPos = 4;
}
return 28;
}
return 28;
}
return -1;
case 5:
{
jjmatchedKind = 67;
jjmatchedPos = 5;
return 28;
}
return 28;
}
return -1;
case 6:
{
jjmatchedKind = 67;
jjmatchedPos = 6;
return 28;
}
return 28;
}
return -1;
case 7:
{
jjmatchedKind = 67;
jjmatchedPos = 7;
return 28;
}
return 28;
}
return -1;
case 8:
{
jjmatchedKind = 67;
jjmatchedPos = 8;
return 28;
}
return 28;
}
return -1;
case 9:
{
jjmatchedKind = 67;
jjmatchedPos = 9;
return 28;
}
return 28;
}
return -1;
case 10:
{
jjmatchedKind = 67;
jjmatchedPos = 10;
return 28;
}
return -1;
default :
return -1;
}
}
{
}
{
jjmatchedPos = pos;
return pos + 1;
}
{
jjmatchedPos = pos;
}
private final int jjMoveStringLiteralDfa0_0()
{
switch(curChar)
{
case 33:
jjmatchedKind = 82;
case 37:
jjmatchedKind = 101;
case 38:
jjmatchedKind = 98;
case 40:
case 41:
case 42:
jjmatchedKind = 96;
case 43:
jjmatchedKind = 94;
case 44:
case 45:
jjmatchedKind = 95;
case 46:
case 47:
jjmatchedKind = 97;
case 58:
case 59:
case 60:
jjmatchedKind = 81;
case 61:
jjmatchedKind = 79;
case 62:
jjmatchedKind = 80;
case 63:
case 91:
case 93:
case 94:
jjmatchedKind = 100;
case 97:
case 98:
case 99:
case 100:
case 101:
case 102:
case 103:
case 105:
case 108:
case 110:
case 112:
case 114:
case 115:
case 116:
case 118:
case 119:
case 123:
case 124:
jjmatchedKind = 99;
case 125:
case 126:
default :
}
}
{
return 1;
}
switch(curChar)
{
case 38:
}
break;
case 43:
}
break;
case 45:
}
break;
case 60:
{
jjmatchedKind = 102;
jjmatchedPos = 1;
}
case 61:
}
break;
case 62:
{
jjmatchedKind = 103;
jjmatchedPos = 1;
}
case 97:
case 98:
case 101:
case 102:
}
break;
case 104:
case 105:
case 108:
case 109:
case 110:
case 111:
{
jjmatchedKind = 20;
jjmatchedPos = 1;
}
case 114:
case 116:
case 117:
case 119:
case 120:
case 121:
case 124:
}
break;
default :
break;
}
}
{
}
return 2;
}
switch(curChar)
{
case 61:
}
break;
case 62:
{
jjmatchedKind = 104;
jjmatchedPos = 2;
}
case 97:
case 98:
case 99:
case 101:
case 102:
case 105:
case 108:
case 110:
case 111:
case 112:
case 114:
}
case 115:
case 116:
{
jjmatchedKind = 34;
jjmatchedPos = 2;
}
case 117:
case 119:
}
break;
case 121:
}
break;
default :
break;
}
}
{
}
return 3;
}
switch(curChar)
{
case 61:
}
break;
case 97:
case 98:
case 99:
case 100:
}
break;
case 101:
}
case 103:
}
break;
case 105:
case 107:
case 108:
}
case 110:
case 111:
}
case 114:
}
case 115:
}
case 116:
case 117:
case 118:
default :
break;
}
}
{
}
return 4;
}
switch(curChar)
{
case 97:
case 99:
case 101:
}
case 104:
}
case 105:
case 107:
}
break;
case 108:
{
jjmatchedKind = 25;
jjmatchedPos = 4;
}
case 110:
case 114:
}
case 115:
}
case 116:
}
case 117:
case 118:
case 119:
{
jjmatchedKind = 51;
jjmatchedPos = 4;
}
default :
break;
}
}
{
}
return 5;
}
switch(curChar)
{
case 97:
case 99:
}
case 100:
case 101:
}
break;
case 102:
case 103:
case 104:
}
break;
case 105:
case 108:
case 109:
case 110:
}
case 114:
case 115:
}
break;
case 116:
}
default :
break;
}
}
{
}
return 6;
}
switch(curChar)
{
case 97:
case 99:
case 101:
}
case 108:
case 110:
}
break;
case 111:
case 115:
}
break;
case 116:
}
case 117:
case 121:
}
break;
default :
break;
}
}
{
}
return 7;
}
switch(curChar)
{
case 99:
case 101:
}
case 110:
case 116:
}
break;
default :
break;
}
}
{
}
return 8;
}
switch(curChar)
{
case 100:
}
break;
case 101:
}
break;
case 105:
case 111:
case 116:
}
default :
break;
}
}
{
}
return 9;
}
switch(curChar)
{
case 102:
}
break;
case 115:
}
break;
case 122:
default :
break;
}
}
{
}
return 10;
}
switch(curChar)
{
case 101:
default :
break;
}
}
{
}
return 11;
}
switch(curChar)
{
case 100:
}
break;
default :
break;
}
}
{
{
}
}
{
do {
}
{
}
{
do {
}
{
}
static final long[] jjbitVec0 = {
0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec3 = {
0x1ff00000fffffffeL, 0xffffffffffffc000L, 0xffffffffL, 0x600000000000000L
};
static final long[] jjbitVec4 = {
0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL
};
static final long[] jjbitVec5 = {
0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec6 = {
0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffL, 0x0L
};
static final long[] jjbitVec7 = {
0xffffffffffffffffL, 0xffffffffffffffffL, 0x0L, 0x0L
};
static final long[] jjbitVec8 = {
0x3fffffffffffL, 0x0L, 0x0L, 0x0L
};
{
int startsAt = 0;
jjnewStateCnt = 67;
int i = 1;
int kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff) {
ReInitRounds();
}
if (curChar < 64)
{
long l = 1L << curChar;
//MatchLoop
do
{
switch(jjstateSet[--i])
{
case 0:
if ((0x3ff000000000000L & l) != 0L) {
} else if (curChar == 47) {
} else if (curChar == 36)
{
if (kind > 67) {
kind = 67;
}
jjCheckNAdd(28);
}
else if (curChar == 34) {
} else if (curChar == 39) {
} else if (curChar == 46) {
jjCheckNAdd(4);
}
if ((0x3fe000000000000L & l) != 0L)
{
if (kind > 59) {
kind = 59;
}
}
else if (curChar == 48)
{
if (kind > 59) {
kind = 59;
}
}
break;
case 49:
if (curChar == 42) {
} else if (curChar == 47) {
}
if (curChar == 42) {
}
break;
case 1:
if ((0x3ff000000000000L & l) == 0L) {
break;
}
if (kind > 59) {
kind = 59;
}
break;
case 3:
if (curChar == 46) {
jjCheckNAdd(4);
}
break;
case 4:
if ((0x3ff000000000000L & l) == 0L) {
break;
}
if (kind > 63) {
kind = 63;
}
break;
case 6:
if ((0x280000000000L & l) != 0L) {
jjCheckNAdd(7);
}
break;
case 7:
if ((0x3ff000000000000L & l) == 0L) {
break;
}
if (kind > 63) {
kind = 63;
}
break;
case 9:
if (curChar == 39) {
}
break;
case 10:
if ((0xffffff7fffffdbffL & l) != 0L) {
jjCheckNAdd(11);
}
break;
case 11:
kind = 65;
}
break;
case 13:
if ((0x8400000000L & l) != 0L) {
jjCheckNAdd(11);
}
break;
case 14:
if ((0xff000000000000L & l) != 0L) {
}
break;
case 15:
if ((0xff000000000000L & l) != 0L) {
jjCheckNAdd(11);
}
break;
case 16:
if ((0xf000000000000L & l) != 0L) {
}
break;
case 17:
if ((0xff000000000000L & l) != 0L) {
jjCheckNAdd(15);
}
break;
case 18:
if (curChar == 34) {
}
break;
case 19:
if ((0xfffffffbffffdbffL & l) != 0L) {
}
break;
case 21:
if ((0x8400000000L & l) != 0L) {
}
break;
case 22:
kind = 66;
}
break;
case 23:
if ((0xff000000000000L & l) != 0L) {
}
break;
case 24:
if ((0xff000000000000L & l) != 0L) {
}
break;
case 25:
if ((0xf000000000000L & l) != 0L) {
}
break;
case 26:
if ((0xff000000000000L & l) != 0L) {
jjCheckNAdd(24);
}
break;
case 27:
if (curChar != 36) {
break;
}
if (kind > 67) {
kind = 67;
}
jjCheckNAdd(28);
break;
case 28:
if ((0x3ff001000000000L & l) == 0L) {
break;
}
if (kind > 67) {
kind = 67;
}
jjCheckNAdd(28);
break;
case 29:
if ((0x3ff000000000000L & l) != 0L) {
}
break;
case 30:
if ((0x3ff000000000000L & l) != 0L) {
}
break;
case 31:
if (curChar != 46) {
break;
}
if (kind > 63) {
kind = 63;
}
break;
case 32:
if ((0x3ff000000000000L & l) == 0L) {
break;
}
if (kind > 63) {
kind = 63;
}
break;
case 34:
if ((0x280000000000L & l) != 0L) {
jjCheckNAdd(35);
}
break;
case 35:
if ((0x3ff000000000000L & l) == 0L) {
break;
}
if (kind > 63) {
kind = 63;
}
break;
case 36:
if ((0x3ff000000000000L & l) != 0L) {
}
break;
case 38:
if ((0x280000000000L & l) != 0L) {
jjCheckNAdd(39);
}
break;
case 39:
if ((0x3ff000000000000L & l) == 0L) {
break;
}
if (kind > 63) {
kind = 63;
}
break;
case 40:
if ((0x3ff000000000000L & l) != 0L) {
}
break;
case 42:
if ((0x280000000000L & l) != 0L) {
jjCheckNAdd(43);
}
break;
case 43:
if ((0x3ff000000000000L & l) != 0L) {
}
break;
case 44:
if (curChar != 48) {
break;
}
if (kind > 59) {
kind = 59;
}
break;
case 46:
if ((0x3ff000000000000L & l) == 0L) {
break;
}
if (kind > 59) {
kind = 59;
}
break;
case 47:
if ((0xff000000000000L & l) == 0L) {
break;
}
if (kind > 59) {
kind = 59;
}
break;
case 48:
if (curChar == 47) {
}
break;
case 50:
if ((0xffffffffffffdbffL & l) != 0L) {
}
break;
case 51:
kind = 6;
}
break;
case 52:
kind = 6;
}
break;
case 53:
if (curChar == 13) {
}
break;
case 54:
if (curChar == 42) {
}
break;
case 55:
if ((0xfffffbffffffffffL & l) != 0L) {
}
break;
case 56:
if (curChar == 42) {
}
break;
case 57:
if ((0xffff7bffffffffffL & l) != 0L) {
}
break;
case 58:
if ((0xfffffbffffffffffL & l) != 0L) {
}
break;
case 59:
kind = 7;
}
break;
case 60:
if (curChar == 42) {
}
break;
case 61:
if (curChar == 42) {
}
break;
case 62:
if ((0xfffffbffffffffffL & l) != 0L) {
}
break;
case 63:
if (curChar == 42) {
}
break;
case 64:
if ((0xffff7bffffffffffL & l) != 0L) {
}
break;
case 65:
if ((0xfffffbffffffffffL & l) != 0L) {
}
break;
case 66:
kind = 8;
}
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
//MatchLoop
do
{
switch(jjstateSet[--i])
{
case 0:
case 28:
if ((0x7fffffe87fffffeL & l) == 0L) {
break;
}
if (kind > 67) {
kind = 67;
}
jjCheckNAdd(28);
break;
case 2:
kind = 59;
}
break;
case 5:
if ((0x2000000020L & l) != 0L) {
}
break;
case 8:
kind = 63;
}
break;
case 10:
if ((0xffffffffefffffffL & l) != 0L) {
jjCheckNAdd(11);
}
break;
case 12:
if (curChar == 92) {
}
break;
case 13:
if ((0x14404410000000L & l) != 0L) {
jjCheckNAdd(11);
}
break;
case 19:
if ((0xffffffffefffffffL & l) != 0L) {
}
break;
case 20:
if (curChar == 92) {
}
break;
case 21:
if ((0x14404410000000L & l) != 0L) {
}
break;
case 33:
if ((0x2000000020L & l) != 0L) {
}
break;
case 37:
if ((0x2000000020L & l) != 0L) {
}
break;
case 41:
if ((0x2000000020L & l) != 0L) {
}
break;
case 45:
if ((0x100000001000000L & l) != 0L) {
jjCheckNAdd(46);
}
break;
case 46:
if ((0x7e0000007eL & l) == 0L) {
break;
}
if (kind > 59) {
kind = 59;
}
break;
case 50:
break;
case 55:
break;
case 57:
case 58:
break;
case 62:
break;
case 64:
case 65:
break;
default : break;
}
} while(i != startsAt);
}
else
{
//MatchLoop
do
{
switch(jjstateSet[--i])
{
case 0:
case 28:
break;
}
if (kind > 67) {
kind = 67;
}
jjCheckNAdd(28);
break;
case 10:
}
break;
case 19:
}
break;
case 50:
}
break;
case 55:
}
break;
case 57:
case 58:
}
break;
case 62:
}
break;
case 64:
case 65:
}
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
kind = 0x7fffffff;
}
++curPos;
return curPos;
}
}
}
static final int[] jjnextStates = {
30, 31, 36, 37, 40, 41, 8, 49, 60, 61, 19, 20, 22, 10, 12, 45,
47, 2, 50, 51, 53, 4, 5, 8, 19, 20, 24, 22, 32, 33, 8, 40,
41, 8, 56, 57, 59, 63, 64, 66, 6, 7, 13, 14, 16, 21, 23, 25,
34, 35, 38, 39, 42, 43,
};
{
switch(hiByte)
{
case 0:
default :
return true;
}
return false;
}
}
{
switch(hiByte)
{
case 0:
case 48:
case 49:
case 51:
case 61:
default :
return true;
}
return false;
}
}
"\141\142\163\164\162\141\143\164", "\142\157\157\154\145\141\156", "\142\162\145\141\153", "\142\171\164\145",
"\143\141\163\145", "\143\141\164\143\150", "\143\150\141\162", "\143\154\141\163\163",
"\143\157\156\163\164", "\143\157\156\164\151\156\165\145", "\144\145\146\141\165\154\164",
"\144\157", "\144\157\165\142\154\145", "\145\154\163\145",
"\145\170\164\145\156\144\163", "\146\141\154\163\145", "\146\151\156\141\154",
"\146\151\156\141\154\154\171", "\146\154\157\141\164", "\146\157\162", "\147\157\164\157", "\151\146",
"\151\155\160\154\145\155\145\156\164\163", "\151\155\160\157\162\164", "\151\156\163\164\141\156\143\145\157\146",
"\151\156\164", "\151\156\164\145\162\146\141\143\145", "\154\157\156\147",
"\156\141\164\151\166\145", "\156\145\167", "\156\165\154\154", "\160\141\143\153\141\147\145",
"\160\162\151\166\141\164\145", "\160\162\157\164\145\143\164\145\144", "\160\165\142\154\151\143",
"\162\145\164\165\162\156", "\163\150\157\162\164", "\163\164\141\164\151\143", "\163\165\160\145\162",
"\163\167\151\164\143\150", "\163\171\156\143\150\162\157\156\151\172\145\144", "\164\150\151\163",
"\164\150\162\157\167", "\164\150\162\157\167\163", "\164\162\141\156\163\151\145\156\164",
"\164\162\165\145", "\164\162\171", "\166\157\151\144", "\166\157\154\141\164\151\154\145",
"\51", "\173", "\175", "\133", "\135", "\73", "\54", "\56", "\75", "\76", "\74",
"\41", "\176", "\77", "\72", "\75\75", "\74\75", "\76\75", "\41\75", "\174\174",
"\46\46", "\53\53", "\55\55", "\53", "\55", "\52", "\57", "\46", "\174", "\136", "\45",
"\74\74", "\76\76", "\76\76\76", "\53\75", "\55\75", "\52\75", "\57\75", "\46\75",
"\174\75", "\136\75", "\45\75", "\74\74\75", "\76\76\75", "\76\76\76\75", };
"DEFAULT",
};
static final long[] jjtoToken = {
0x8ffffffffffffe01L, 0xfffffffffffceL,
};
static final long[] jjtoSkip = {
0x1feL, 0x0L,
};
static final long[] jjtoSpecial = {
0x1c0L, 0x0L,
};
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 = 67; 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 curPos = 0;
EOFLoop :
for (;;)
{
try
{
}
{
jjmatchedKind = 0;
matchedToken = jjFillToken();
return matchedToken;
}
try {
}
}
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
if (jjmatchedKind != 0x7fffffff)
{
}
{
matchedToken = jjFillToken();
return matchedToken;
}
else
{
{
matchedToken = jjFillToken();
if (specialToken == null) {
} 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);
}
}
}