org.mariuszgromada.math.mxparser.syntaxchecker.SyntaxCheckerTokenManager Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of MathParser.org-mXparser Show documentation
Show all versions of MathParser.org-mXparser Show documentation
mXparser is a super easy, rich, fast and highly flexible math expression parser library (parser and evaluator of mathematical expressions / formulas provided as plain text / string). Software delivers easy to use API for JAVA, Android and C# .NET/MONO (Common Language Specification compliant: F#, Visual Basic, C++/CLI). *** If you find the software useful donation or purchase is something you might consider: https://mathparser.org/donate/ *** Online store: https://payhip.com/INFIMA *** Scalar Scientific Calculator, Charts and Scripts, Scalar Lite: https://play.google.com/store/apps/details?id=org.mathparser.scalar.lite *** Scalar Pro: https://play.google.com/store/apps/details?id=org.mathparser.scalar.pro *** ScalarMath.org: https://scalarmath.org/ *** MathSpace.pl: https://mathspace.pl/ ***
/* SyntaxCheckerTokenManager.java */
/* Generated By:JavaCC: Do not edit this line. SyntaxCheckerTokenManager.java */
package org.mariuszgromada.math.mxparser.syntaxchecker;
/** Token Manager. */
public class SyntaxCheckerTokenManager implements SyntaxCheckerConstants {
/** Debug output. */
public java.io.PrintStream debugStream = System.out;
/** Set debug output. */
public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }
private final int jjStopStringLiteralDfa_0(int pos, long active0, long active1, long active2){
switch (pos)
{
case 0:
if ((active1 & 0x40000000L) != 0L)
return 268;
if ((active1 & 0x2000000L) != 0L)
return 46;
if ((active1 & 0x40000000000L) != 0L)
return 24;
if ((active1 & 0x20000000L) != 0L)
return 279;
if ((active1 & 0x1000000000000L) != 0L)
{
jjmatchedKind = 125;
return 73;
}
if ((active1 & 0x10000000000L) != 0L)
return 247;
if ((active1 & 0x1000000000L) != 0L)
return 19;
return -1;
case 1:
if ((active1 & 0x1000000000000L) != 0L)
return 280;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_0(int pos, long active0, long active1, long active2){
return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0, active1, active2), pos + 1);
}
private int jjStopAtPos(int pos, int kind)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
return pos + 1;
}
private int jjMoveStringLiteralDfa0_0(){
switch(curChar)
{
case 33:
return jjStartNfaWithStates_0(0, 100, 19);
case 35:
return jjStopAtPos(0, 99);
case 37:
return jjStopAtPos(0, 101);
case 40:
return jjStartNfaWithStates_0(0, 89, 46);
case 41:
return jjStopAtPos(0, 90);
case 43:
return jjStartNfaWithStates_0(0, 93, 279);
case 44:
return jjStopAtPos(0, 91);
case 45:
return jjStartNfaWithStates_0(0, 94, 268);
case 59:
return jjStopAtPos(0, 92);
case 60:
return jjStartNfaWithStates_0(0, 104, 247);
case 62:
return jjStartNfaWithStates_0(0, 106, 24);
case 64:
return jjMoveStringLiteralDfa1_0(0x1000000000000L);
case 91:
jjmatchedKind = 128;
return jjMoveStringLiteralDfa1_0(0xc000000000000000L);
case 93:
return jjStopAtPos(0, 129);
case 94:
jjmatchedKind = 97;
return jjMoveStringLiteralDfa1_0(0x400000000L);
default :
return jjMoveNfa_0(5, 0);
}
}
private int jjMoveStringLiteralDfa1_0(long active1){
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(0, 0L, active1, 0L);
return 1;
}
switch(curChar)
{
case 37:
return jjMoveStringLiteralDfa2_0(active1, 0xc000000000000000L);
case 94:
if ((active1 & 0x400000000L) != 0L)
return jjStopAtPos(1, 98);
break;
case 126:
if ((active1 & 0x1000000000000L) != 0L)
return jjStartNfaWithStates_0(1, 112, 280);
break;
default :
break;
}
return jjStartNfa_0(0, 0L, active1, 0L);
}
private int jjMoveStringLiteralDfa2_0(long old1, long active1){
if (((active1 &= old1)) == 0L)
return jjStartNfa_0(0, 0L, old1, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(1, 0L, active1, 0L);
return 2;
}
switch(curChar)
{
case 37:
return jjMoveStringLiteralDfa3_0(active1, 0x8000000000000000L);
case 93:
if ((active1 & 0x4000000000000000L) != 0L)
return jjStopAtPos(2, 126);
break;
default :
break;
}
return jjStartNfa_0(1, 0L, active1, 0L);
}
private int jjMoveStringLiteralDfa3_0(long old1, long active1){
if (((active1 &= old1)) == 0L)
return jjStartNfa_0(1, 0L, old1, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(2, 0L, active1, 0L);
return 3;
}
switch(curChar)
{
case 93:
if ((active1 & 0x8000000000000000L) != 0L)
return jjStopAtPos(3, 127);
break;
default :
break;
}
return jjStartNfa_0(2, 0L, active1, 0L);
}
private int jjStartNfaWithStates_0(int pos, int kind, int state)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return pos + 1; }
return jjMoveNfa_0(state, pos + 1);
}
static final long[] jjbitVec0 = {
0x0L, 0x0L, 0x0L, 0x800000L
};
static final long[] jjbitVec1 = {
0x2000000L, 0x0L, 0x0L, 0x0L
};
static final long[] jjbitVec2 = {
0x200L, 0x0L, 0x0L, 0x0L
};
static final long[] jjbitVec3 = {
0x0L, 0x0L, 0x0L, 0x80000000000000L
};
static final long[] jjbitVec4 = {
0x0L, 0x100000000L, 0x0L, 0x0L
};
static final long[] jjbitVec5 = {
0x0L, 0x1000000000L, 0x0L, 0x10000000L
};
static final long[] jjbitVec6 = {
0x0L, 0x2000000000L, 0x0L, 0x20000000L
};
static final long[] jjbitVec7 = {
0x10000000000L, 0x0L, 0x0L, 0x0L
};
static final long[] jjbitVec8 = {
0x8000000000L, 0x0L, 0x0L, 0x0L
};
static final long[] jjbitVec9 = {
0x1c000000L, 0x0L, 0x0L, 0x0L
};
static final long[] jjbitVec10 = {
0x0L, 0x0L, 0x0L, 0x40000L
};
static final long[] jjbitVec11 = {
0x0L, 0x0L, 0x0L, 0x10000L
};
static final long[] jjbitVec12 = {
0x0L, 0x0L, 0x0L, 0x8000L
};
static final long[] jjbitVec13 = {
0x0L, 0x0L, 0x0L, 0x2000L
};
static final long[] jjbitVec14 = {
0x0L, 0x0L, 0x1000000000000000L, 0x0L
};
static final long[] jjbitVec15 = {
0x0L, 0x0L, 0x0L, 0x100000L
};
static final long[] jjbitVec16 = {
0x0L, 0x0L, 0x2000000000000000L, 0x0L
};
static final long[] jjbitVec17 = {
0x0L, 0x0L, 0x800000000000000L, 0x0L
};
static final long[] jjbitVec18 = {
0x0L, 0x0L, 0xfffe03fbfffe0000L, 0x3ffL
};
static final long[] jjbitVec19 = {
0x9000800000000080L, 0x80L, 0x0L, 0x0L
};
static final long[] jjbitVec20 = {
0x800000280c4L, 0x0L, 0x0L, 0x0L
};
static final long[] jjbitVec21 = {
0x4L, 0x0L, 0x0L, 0x0L
};
static final long[] jjbitVec22 = {
0x0L, 0x0L, 0x100000000000L, 0x0L
};
private int jjMoveNfa_0(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 279;
int i = 1;
jjstateSet[0] = startState;
int kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
do
{
switch(jjstateSet[--i])
{
case 280:
case 72:
if (curChar == 38 && kind > 120)
kind = 120;
break;
case 73:
if (curChar == 62)
jjstateSet[jjnewStateCnt++] = 80;
else if (curChar == 60)
jjstateSet[jjnewStateCnt++] = 78;
else if (curChar == 38)
{
if (kind > 120)
kind = 120;
}
break;
case 5:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 48)
kind = 48;
{ jjCheckNAddStates(0, 7); }
}
else if ((0x8c00c09800000000L & l) != 0L)
{
if (kind > 125)
kind = 125;
}
else if (curChar == 45)
{ jjAddStates(8, 9); }
else if (curChar == 60)
{ jjAddStates(10, 14); }
else if (curChar == 43)
{ jjCheckNAddStates(15, 18); }
else if (curChar == 40)
jjstateSet[jjnewStateCnt++] = 46;
else if (curChar == 38)
jjstateSet[jjnewStateCnt++] = 33;
else if (curChar == 62)
jjstateSet[jjnewStateCnt++] = 24;
else if (curChar == 33)
jjstateSet[jjnewStateCnt++] = 19;
else if (curChar == 61)
jjstateSet[jjnewStateCnt++] = 17;
else if (curChar == 42)
{
if (kind > 95)
kind = 95;
}
if ((0x400800000000000L & l) != 0L)
{
if (kind > 96)
kind = 96;
}
else if (curChar == 45)
{ jjCheckNAddStates(19, 22); }
else if (curChar == 38)
{
if (kind > 109)
kind = 109;
}
else if (curChar == 61)
{
if (kind > 102)
kind = 102;
}
else if (curChar == 46)
{ jjCheckNAdd(1); }
if (curChar == 47)
jjstateSet[jjnewStateCnt++] = 35;
break;
case 279:
if ((0x100002600L & l) != 0L)
{ jjCheckNAddTwoStates(58, 59); }
else if (curChar == 45)
{
if (kind > 130)
kind = 130;
}
else if (curChar == 43)
{
if (kind > 130)
kind = 130;
}
if ((0x100002600L & l) != 0L)
{ jjCheckNAddTwoStates(56, 57); }
break;
case 268:
if ((0x100002600L & l) != 0L)
{ jjCheckNAddTwoStates(62, 57); }
else if (curChar == 43)
{
if (kind > 130)
kind = 130;
}
else if (curChar == 45)
{
if (kind > 130)
kind = 130;
}
else if (curChar == 47)
jjstateSet[jjnewStateCnt++] = 269;
if ((0x100002600L & l) != 0L)
{ jjCheckNAddTwoStates(61, 59); }
else if (curChar == 45)
jjstateSet[jjnewStateCnt++] = 267;
break;
case 247:
if (curChar == 45)
jjstateSet[jjnewStateCnt++] = 253;
else if (curChar == 47)
jjstateSet[jjnewStateCnt++] = 251;
else if (curChar == 61)
{
if (kind > 105)
kind = 105;
}
else if (curChar == 62)
{
if (kind > 103)
kind = 103;
}
if (curChar == 45)
jjstateSet[jjnewStateCnt++] = 249;
break;
case 0:
if (curChar == 46)
{ jjCheckNAdd(1); }
break;
case 1:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 48)
kind = 48;
{ jjCheckNAddTwoStates(1, 2); }
break;
case 3:
if ((0x280000000000L & l) != 0L)
{ jjCheckNAdd(4); }
break;
case 4:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 48)
kind = 48;
{ jjCheckNAdd(4); }
break;
case 6:
if (curChar == 46)
{ jjCheckNAdd(7); }
break;
case 7:
if ((0x3000000000000L & l) == 0L)
break;
if (kind > 85)
kind = 85;
{ jjCheckNAdd(7); }
break;
case 9:
if (curChar == 46)
{ jjCheckNAdd(10); }
break;
case 10:
if ((0xff000000000000L & l) == 0L)
break;
if (kind > 86)
kind = 86;
{ jjCheckNAdd(10); }
break;
case 12:
if (curChar == 46)
{ jjCheckNAdd(13); }
break;
case 13:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 87)
kind = 87;
{ jjCheckNAdd(13); }
break;
case 14:
if (curChar == 42)
kind = 95;
break;
case 15:
if ((0x400800000000000L & l) != 0L && kind > 96)
kind = 96;
break;
case 16:
case 17:
if (curChar == 61 && kind > 102)
kind = 102;
break;
case 18:
if (curChar == 61)
jjstateSet[jjnewStateCnt++] = 17;
break;
case 19:
if (curChar == 61 && kind > 103)
kind = 103;
break;
case 20:
if (curChar == 33)
jjstateSet[jjnewStateCnt++] = 19;
break;
case 24:
if (curChar == 61 && kind > 107)
kind = 107;
break;
case 25:
if (curChar == 62)
jjstateSet[jjnewStateCnt++] = 24;
break;
case 30:
if (curChar == 47 && kind > 108)
kind = 108;
break;
case 32:
case 33:
if (curChar == 38 && kind > 109)
kind = 109;
break;
case 34:
if (curChar == 38)
jjstateSet[jjnewStateCnt++] = 33;
break;
case 36:
if (curChar == 47)
jjstateSet[jjnewStateCnt++] = 35;
break;
case 45:
if (curChar == 41)
kind = 121;
break;
case 46:
if (curChar == 43)
jjstateSet[jjnewStateCnt++] = 45;
break;
case 47:
if (curChar == 40)
jjstateSet[jjnewStateCnt++] = 46;
break;
case 50:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 122)
kind = 122;
{ jjAddStates(23, 24); }
break;
case 54:
if ((0x8c00c09800000000L & l) != 0L && kind > 125)
kind = 125;
break;
case 55:
if (curChar == 43)
{ jjCheckNAddStates(15, 18); }
break;
case 56:
if ((0x100002600L & l) != 0L)
{ jjCheckNAddTwoStates(56, 57); }
break;
case 57:
if (curChar == 43 && kind > 130)
kind = 130;
break;
case 58:
if ((0x100002600L & l) != 0L)
{ jjCheckNAddTwoStates(58, 59); }
break;
case 59:
if (curChar == 45 && kind > 130)
kind = 130;
break;
case 60:
if (curChar == 45)
{ jjCheckNAddStates(19, 22); }
break;
case 61:
if ((0x100002600L & l) != 0L)
{ jjCheckNAddTwoStates(61, 59); }
break;
case 62:
if ((0x100002600L & l) != 0L)
{ jjCheckNAddTwoStates(62, 57); }
break;
case 64:
if (curChar == 43 && kind > 123)
kind = 123;
break;
case 67:
if (curChar == 45 && kind > 123)
kind = 123;
break;
case 78:
if (curChar == 60 && kind > 120)
kind = 120;
break;
case 79:
if (curChar == 60)
jjstateSet[jjnewStateCnt++] = 78;
break;
case 80:
if (curChar == 62 && kind > 120)
kind = 120;
break;
case 81:
if (curChar == 62)
jjstateSet[jjnewStateCnt++] = 80;
break;
case 83:
if (curChar == 49)
jjstateSet[jjnewStateCnt++] = 84;
break;
case 84:
if (curChar != 46)
break;
if (kind > 49)
kind = 49;
{ jjCheckNAdd(85); }
break;
case 85:
if (curChar != 49)
break;
if (kind > 49)
kind = 49;
{ jjCheckNAdd(85); }
break;
case 86:
if (curChar == 50)
jjstateSet[jjnewStateCnt++] = 87;
break;
case 87:
if (curChar == 46)
{ jjCheckNAdd(88); }
break;
case 88:
if ((0x3000000000000L & l) == 0L)
break;
if (kind > 50)
kind = 50;
{ jjCheckNAdd(88); }
break;
case 89:
if (curChar == 51)
jjstateSet[jjnewStateCnt++] = 90;
break;
case 90:
if (curChar == 46)
{ jjCheckNAdd(91); }
break;
case 91:
if ((0x7000000000000L & l) == 0L)
break;
if (kind > 51)
kind = 51;
{ jjCheckNAdd(91); }
break;
case 92:
if (curChar == 52)
jjstateSet[jjnewStateCnt++] = 93;
break;
case 93:
if (curChar == 46)
{ jjCheckNAdd(94); }
break;
case 94:
if ((0xf000000000000L & l) == 0L)
break;
if (kind > 52)
kind = 52;
{ jjCheckNAdd(94); }
break;
case 95:
if (curChar == 53)
jjstateSet[jjnewStateCnt++] = 96;
break;
case 96:
if (curChar == 46)
{ jjCheckNAdd(97); }
break;
case 97:
if ((0x1f000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
{ jjCheckNAdd(97); }
break;
case 98:
if (curChar == 54)
jjstateSet[jjnewStateCnt++] = 99;
break;
case 99:
if (curChar == 46)
{ jjCheckNAdd(100); }
break;
case 100:
if ((0x3f000000000000L & l) == 0L)
break;
if (kind > 54)
kind = 54;
{ jjCheckNAdd(100); }
break;
case 101:
if (curChar == 55)
jjstateSet[jjnewStateCnt++] = 102;
break;
case 102:
if (curChar == 46)
{ jjCheckNAdd(103); }
break;
case 103:
if ((0x7f000000000000L & l) == 0L)
break;
if (kind > 55)
kind = 55;
{ jjCheckNAdd(103); }
break;
case 104:
if (curChar == 56)
jjstateSet[jjnewStateCnt++] = 105;
break;
case 105:
if (curChar == 46)
{ jjCheckNAdd(106); }
break;
case 106:
if ((0xff000000000000L & l) == 0L)
break;
if (kind > 56)
kind = 56;
{ jjCheckNAdd(106); }
break;
case 107:
if (curChar == 57)
jjstateSet[jjnewStateCnt++] = 108;
break;
case 108:
if (curChar == 46)
{ jjCheckNAdd(109); }
break;
case 109:
if ((0x1ff000000000000L & l) == 0L)
break;
if (kind > 57)
kind = 57;
{ jjCheckNAdd(109); }
break;
case 110:
if (curChar == 48)
jjstateSet[jjnewStateCnt++] = 111;
break;
case 111:
if (curChar == 46)
{ jjCheckNAdd(112); }
break;
case 112:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 58)
kind = 58;
{ jjCheckNAdd(112); }
break;
case 113:
case 219:
if (curChar == 49)
{ jjCheckNAdd(110); }
break;
case 114:
if (curChar == 49)
jjstateSet[jjnewStateCnt++] = 115;
break;
case 115:
if (curChar == 46)
{ jjCheckNAdd(116); }
break;
case 116:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
{ jjCheckNAdd(116); }
break;
case 117:
case 220:
if (curChar == 49)
{ jjCheckNAdd(114); }
break;
case 118:
if (curChar == 50)
jjstateSet[jjnewStateCnt++] = 119;
break;
case 119:
if (curChar == 46)
{ jjCheckNAdd(120); }
break;
case 120:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 60)
kind = 60;
{ jjCheckNAdd(120); }
break;
case 121:
case 221:
if (curChar == 49)
{ jjCheckNAdd(118); }
break;
case 122:
if (curChar == 51)
jjstateSet[jjnewStateCnt++] = 123;
break;
case 123:
if (curChar == 46)
{ jjCheckNAdd(124); }
break;
case 124:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 61)
kind = 61;
{ jjCheckNAdd(124); }
break;
case 125:
case 222:
if (curChar == 49)
{ jjCheckNAdd(122); }
break;
case 126:
if (curChar == 52)
jjstateSet[jjnewStateCnt++] = 127;
break;
case 127:
if (curChar == 46)
{ jjCheckNAdd(128); }
break;
case 128:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 62)
kind = 62;
{ jjCheckNAdd(128); }
break;
case 129:
case 223:
if (curChar == 49)
{ jjCheckNAdd(126); }
break;
case 130:
if (curChar == 53)
jjstateSet[jjnewStateCnt++] = 131;
break;
case 131:
if (curChar == 46)
{ jjCheckNAdd(132); }
break;
case 132:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 63)
kind = 63;
{ jjCheckNAdd(132); }
break;
case 133:
case 224:
if (curChar == 49)
{ jjCheckNAdd(130); }
break;
case 134:
if (curChar == 54)
jjstateSet[jjnewStateCnt++] = 135;
break;
case 135:
if (curChar == 46)
{ jjCheckNAdd(136); }
break;
case 136:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 64)
kind = 64;
{ jjCheckNAdd(136); }
break;
case 137:
case 225:
if (curChar == 49)
{ jjCheckNAdd(134); }
break;
case 138:
if (curChar == 55)
jjstateSet[jjnewStateCnt++] = 139;
break;
case 139:
if (curChar == 46)
{ jjCheckNAdd(140); }
break;
case 140:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 65)
kind = 65;
{ jjCheckNAdd(140); }
break;
case 141:
case 226:
if (curChar == 49)
{ jjCheckNAdd(138); }
break;
case 142:
if (curChar == 56)
jjstateSet[jjnewStateCnt++] = 143;
break;
case 143:
if (curChar == 46)
{ jjCheckNAdd(144); }
break;
case 144:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 66)
kind = 66;
{ jjCheckNAdd(144); }
break;
case 145:
case 227:
if (curChar == 49)
{ jjCheckNAdd(142); }
break;
case 146:
if (curChar == 57)
jjstateSet[jjnewStateCnt++] = 147;
break;
case 147:
if (curChar == 46)
{ jjCheckNAdd(148); }
break;
case 148:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 67)
kind = 67;
{ jjCheckNAdd(148); }
break;
case 149:
case 228:
if (curChar == 49)
{ jjCheckNAdd(146); }
break;
case 150:
if (curChar == 48)
jjstateSet[jjnewStateCnt++] = 151;
break;
case 151:
if (curChar == 46)
{ jjCheckNAdd(152); }
break;
case 152:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 68)
kind = 68;
{ jjCheckNAdd(152); }
break;
case 153:
case 229:
if (curChar == 50)
{ jjCheckNAdd(150); }
break;
case 154:
if (curChar == 49)
jjstateSet[jjnewStateCnt++] = 155;
break;
case 155:
if (curChar == 46)
{ jjCheckNAdd(156); }
break;
case 156:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 69)
kind = 69;
{ jjCheckNAdd(156); }
break;
case 157:
case 230:
if (curChar == 50)
{ jjCheckNAdd(154); }
break;
case 158:
if (curChar == 50)
jjstateSet[jjnewStateCnt++] = 159;
break;
case 159:
if (curChar == 46)
{ jjCheckNAdd(160); }
break;
case 160:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 70)
kind = 70;
{ jjCheckNAdd(160); }
break;
case 161:
case 231:
if (curChar == 50)
{ jjCheckNAdd(158); }
break;
case 162:
if (curChar == 51)
jjstateSet[jjnewStateCnt++] = 163;
break;
case 163:
if (curChar == 46)
{ jjCheckNAdd(164); }
break;
case 164:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 71)
kind = 71;
{ jjCheckNAdd(164); }
break;
case 165:
case 232:
if (curChar == 50)
{ jjCheckNAdd(162); }
break;
case 166:
if (curChar == 52)
jjstateSet[jjnewStateCnt++] = 167;
break;
case 167:
if (curChar == 46)
{ jjCheckNAdd(168); }
break;
case 168:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 72)
kind = 72;
{ jjCheckNAdd(168); }
break;
case 169:
case 233:
if (curChar == 50)
{ jjCheckNAdd(166); }
break;
case 170:
if (curChar == 53)
jjstateSet[jjnewStateCnt++] = 171;
break;
case 171:
if (curChar == 46)
{ jjCheckNAdd(172); }
break;
case 172:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 73)
kind = 73;
{ jjCheckNAdd(172); }
break;
case 173:
case 234:
if (curChar == 50)
{ jjCheckNAdd(170); }
break;
case 174:
if (curChar == 54)
jjstateSet[jjnewStateCnt++] = 175;
break;
case 175:
if (curChar == 46)
{ jjCheckNAdd(176); }
break;
case 176:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 74)
kind = 74;
{ jjCheckNAdd(176); }
break;
case 177:
case 235:
if (curChar == 50)
{ jjCheckNAdd(174); }
break;
case 178:
if (curChar == 55)
jjstateSet[jjnewStateCnt++] = 179;
break;
case 179:
if (curChar == 46)
{ jjCheckNAdd(180); }
break;
case 180:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 75)
kind = 75;
{ jjCheckNAdd(180); }
break;
case 181:
case 236:
if (curChar == 50)
{ jjCheckNAdd(178); }
break;
case 182:
if (curChar == 56)
jjstateSet[jjnewStateCnt++] = 183;
break;
case 183:
if (curChar == 46)
{ jjCheckNAdd(184); }
break;
case 184:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 76)
kind = 76;
{ jjCheckNAdd(184); }
break;
case 185:
case 237:
if (curChar == 50)
{ jjCheckNAdd(182); }
break;
case 186:
if (curChar == 57)
jjstateSet[jjnewStateCnt++] = 187;
break;
case 187:
if (curChar == 46)
{ jjCheckNAdd(188); }
break;
case 188:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 77)
kind = 77;
{ jjCheckNAdd(188); }
break;
case 189:
case 238:
if (curChar == 50)
{ jjCheckNAdd(186); }
break;
case 190:
if (curChar == 48)
jjstateSet[jjnewStateCnt++] = 191;
break;
case 191:
if (curChar == 46)
{ jjCheckNAdd(192); }
break;
case 192:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 78)
kind = 78;
{ jjCheckNAdd(192); }
break;
case 193:
case 239:
if (curChar == 51)
{ jjCheckNAdd(190); }
break;
case 194:
if (curChar == 49)
jjstateSet[jjnewStateCnt++] = 195;
break;
case 195:
if (curChar == 46)
{ jjCheckNAdd(196); }
break;
case 196:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 79)
kind = 79;
{ jjCheckNAdd(196); }
break;
case 197:
case 240:
if (curChar == 51)
{ jjCheckNAdd(194); }
break;
case 198:
if (curChar == 50)
jjstateSet[jjnewStateCnt++] = 199;
break;
case 199:
if (curChar == 46)
{ jjCheckNAdd(200); }
break;
case 200:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 80)
kind = 80;
{ jjCheckNAdd(200); }
break;
case 201:
case 241:
if (curChar == 51)
{ jjCheckNAdd(198); }
break;
case 202:
if (curChar == 51)
jjstateSet[jjnewStateCnt++] = 203;
break;
case 203:
if (curChar == 46)
{ jjCheckNAdd(204); }
break;
case 204:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 81)
kind = 81;
{ jjCheckNAdd(204); }
break;
case 205:
case 242:
if (curChar == 51)
{ jjCheckNAdd(202); }
break;
case 206:
if (curChar == 52)
jjstateSet[jjnewStateCnt++] = 207;
break;
case 207:
if (curChar == 46)
{ jjCheckNAdd(208); }
break;
case 208:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 82)
kind = 82;
{ jjCheckNAdd(208); }
break;
case 209:
case 243:
if (curChar == 51)
{ jjCheckNAdd(206); }
break;
case 210:
if (curChar == 53)
jjstateSet[jjnewStateCnt++] = 211;
break;
case 211:
if (curChar == 46)
{ jjCheckNAdd(212); }
break;
case 212:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 83)
kind = 83;
{ jjCheckNAdd(212); }
break;
case 213:
case 244:
if (curChar == 51)
{ jjCheckNAdd(210); }
break;
case 214:
if (curChar == 54)
jjstateSet[jjnewStateCnt++] = 215;
break;
case 215:
if (curChar == 46)
{ jjCheckNAdd(216); }
break;
case 216:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 84)
kind = 84;
{ jjCheckNAdd(216); }
break;
case 217:
case 245:
if (curChar == 51)
{ jjCheckNAdd(214); }
break;
case 246:
if (curChar == 60)
{ jjAddStates(10, 14); }
break;
case 248:
if (curChar == 61 && kind > 105)
kind = 105;
break;
case 249:
if (curChar == 45 && kind > 114)
kind = 114;
break;
case 250:
if (curChar == 45)
jjstateSet[jjnewStateCnt++] = 249;
break;
case 251:
if (curChar == 45 && kind > 116)
kind = 116;
break;
case 252:
if (curChar == 47)
jjstateSet[jjnewStateCnt++] = 251;
break;
case 253:
if (curChar == 62 && kind > 118)
kind = 118;
break;
case 254:
if (curChar == 45)
jjstateSet[jjnewStateCnt++] = 253;
break;
case 256:
case 257:
if (curChar == 38 && kind > 117)
kind = 117;
break;
case 258:
if (curChar == 38)
jjstateSet[jjnewStateCnt++] = 257;
break;
case 260:
if (curChar == 47)
jjstateSet[jjnewStateCnt++] = 259;
break;
case 264:
if (curChar == 47 && kind > 119)
kind = 119;
break;
case 266:
if (curChar == 45)
{ jjAddStates(8, 9); }
break;
case 267:
if (curChar == 62 && kind > 113)
kind = 113;
break;
case 269:
if (curChar == 62 && kind > 115)
kind = 115;
break;
case 270:
if (curChar == 47)
jjstateSet[jjnewStateCnt++] = 269;
break;
case 271:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 48)
kind = 48;
{ jjCheckNAddStates(0, 7); }
break;
case 272:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(272, 0); }
break;
case 273:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 48)
kind = 48;
{ jjCheckNAddTwoStates(273, 2); }
break;
case 274:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(274, 275); }
break;
case 276:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(276, 277); }
break;
case 278:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 88)
kind = 88;
jjstateSet[jjnewStateCnt++] = 278;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 280:
if (curChar == 124)
{
if (kind > 120)
kind = 120;
}
else if (curChar == 94)
{
if (kind > 120)
kind = 120;
}
break;
case 73:
if (curChar == 126)
{ jjCheckNAdd(76); }
else if (curChar == 124)
{
if (kind > 120)
kind = 120;
}
else if (curChar == 94)
{
if (kind > 120)
kind = 120;
}
if (curChar == 126)
{ jjCheckNAdd(74); }
if (curChar == 126)
{ jjCheckNAdd(72); }
break;
case 5:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 122)
kind = 122;
{ jjCheckNAddTwoStates(50, 52); }
}
else if ((0x110000001L & l) != 0L)
{
if (kind > 125)
kind = 125;
}
else if (curChar == 126)
{
if (kind > 110)
kind = 110;
{ jjAddStates(25, 30); }
}
else if (curChar == 124)
jjstateSet[jjnewStateCnt++] = 28;
if ((0x10000000100L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 12;
else if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 9;
else if ((0x400000004L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 6;
else if (curChar == 64)
{ jjCheckNAddStates(31, 38); }
else if (curChar == 100)
{ jjAddStates(39, 40); }
else if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 30;
else if (curChar == 124)
{
if (kind > 108)
kind = 108;
}
else if (curChar == 126)
jjstateSet[jjnewStateCnt++] = 19;
if (curChar == 66)
{ jjCheckNAddStates(41, 76); }
else if (curChar == 98)
{ jjCheckNAddStates(77, 112); }
else if (curChar == 92)
{
if (kind > 96)
kind = 96;
}
break;
case 2:
if ((0x2000000020L & l) != 0L)
{ jjAddStates(113, 114); }
break;
case 8:
if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 11:
if ((0x10000000100L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 12;
break;
case 13:
if ((0x7e0000007eL & l) == 0L)
break;
if (kind > 87)
kind = 87;
jjstateSet[jjnewStateCnt++] = 13;
break;
case 15:
if (curChar == 92 && kind > 96)
kind = 96;
break;
case 21:
if (curChar == 126)
jjstateSet[jjnewStateCnt++] = 19;
break;
case 27:
case 28:
if (curChar == 124 && kind > 108)
kind = 108;
break;
case 29:
if (curChar == 124)
jjstateSet[jjnewStateCnt++] = 28;
break;
case 31:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 30;
break;
case 35:
if (curChar == 92 && kind > 109)
kind = 109;
break;
case 49:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 122)
kind = 122;
{ jjCheckNAddTwoStates(50, 52); }
break;
case 51:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 122)
kind = 122;
{ jjCheckNAddTwoStates(50, 51); }
break;
case 52:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 122)
kind = 122;
{ jjCheckNAddStates(115, 117); }
break;
case 54:
if ((0x110000001L & l) != 0L && kind > 125)
kind = 125;
break;
case 63:
if (curChar == 100)
{ jjAddStates(39, 40); }
break;
case 65:
if (curChar == 114)
jjstateSet[jjnewStateCnt++] = 64;
break;
case 66:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 65;
break;
case 68:
if (curChar == 114)
jjstateSet[jjnewStateCnt++] = 67;
break;
case 69:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 68;
break;
case 71:
if (curChar == 64)
{ jjCheckNAddStates(31, 38); }
break;
case 74:
if (curChar == 94)
kind = 120;
break;
case 75:
if (curChar == 126)
{ jjCheckNAdd(74); }
break;
case 76:
if (curChar == 124 && kind > 120)
kind = 120;
break;
case 77:
if (curChar == 126)
{ jjCheckNAdd(76); }
break;
case 82:
if (curChar == 98)
{ jjCheckNAddStates(77, 112); }
break;
case 116:
if ((0x200000002L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjstateSet[jjnewStateCnt++] = 116;
break;
case 120:
if ((0x600000006L & l) == 0L)
break;
if (kind > 60)
kind = 60;
jjstateSet[jjnewStateCnt++] = 120;
break;
case 124:
if ((0xe0000000eL & l) == 0L)
break;
if (kind > 61)
kind = 61;
jjstateSet[jjnewStateCnt++] = 124;
break;
case 128:
if ((0x1e0000001eL & l) == 0L)
break;
if (kind > 62)
kind = 62;
jjstateSet[jjnewStateCnt++] = 128;
break;
case 132:
if ((0x3e0000003eL & l) == 0L)
break;
if (kind > 63)
kind = 63;
jjstateSet[jjnewStateCnt++] = 132;
break;
case 136:
if ((0x7e0000007eL & l) == 0L)
break;
if (kind > 64)
kind = 64;
jjstateSet[jjnewStateCnt++] = 136;
break;
case 140:
if ((0xfe000000feL & l) == 0L)
break;
if (kind > 65)
kind = 65;
jjstateSet[jjnewStateCnt++] = 140;
break;
case 144:
if ((0x1fe000001feL & l) == 0L)
break;
if (kind > 66)
kind = 66;
jjstateSet[jjnewStateCnt++] = 144;
break;
case 148:
if ((0x3fe000003feL & l) == 0L)
break;
if (kind > 67)
kind = 67;
jjstateSet[jjnewStateCnt++] = 148;
break;
case 152:
if ((0x7fe000007feL & l) == 0L)
break;
if (kind > 68)
kind = 68;
jjstateSet[jjnewStateCnt++] = 152;
break;
case 156:
if ((0xffe00000ffeL & l) == 0L)
break;
if (kind > 69)
kind = 69;
jjstateSet[jjnewStateCnt++] = 156;
break;
case 160:
if ((0x1ffe00001ffeL & l) == 0L)
break;
if (kind > 70)
kind = 70;
jjstateSet[jjnewStateCnt++] = 160;
break;
case 164:
if ((0x3ffe00003ffeL & l) == 0L)
break;
if (kind > 71)
kind = 71;
jjstateSet[jjnewStateCnt++] = 164;
break;
case 168:
if ((0x7ffe00007ffeL & l) == 0L)
break;
if (kind > 72)
kind = 72;
jjstateSet[jjnewStateCnt++] = 168;
break;
case 172:
if ((0xfffe0000fffeL & l) == 0L)
break;
if (kind > 73)
kind = 73;
jjstateSet[jjnewStateCnt++] = 172;
break;
case 176:
if ((0x1fffe0001fffeL & l) == 0L)
break;
if (kind > 74)
kind = 74;
jjstateSet[jjnewStateCnt++] = 176;
break;
case 180:
if ((0x3fffe0003fffeL & l) == 0L)
break;
if (kind > 75)
kind = 75;
jjstateSet[jjnewStateCnt++] = 180;
break;
case 184:
if ((0x7fffe0007fffeL & l) == 0L)
break;
if (kind > 76)
kind = 76;
jjstateSet[jjnewStateCnt++] = 184;
break;
case 188:
if ((0xffffe000ffffeL & l) == 0L)
break;
if (kind > 77)
kind = 77;
jjstateSet[jjnewStateCnt++] = 188;
break;
case 192:
if ((0x1ffffe001ffffeL & l) == 0L)
break;
if (kind > 78)
kind = 78;
jjstateSet[jjnewStateCnt++] = 192;
break;
case 196:
if ((0x3ffffe003ffffeL & l) == 0L)
break;
if (kind > 79)
kind = 79;
jjstateSet[jjnewStateCnt++] = 196;
break;
case 200:
if ((0x7ffffe007ffffeL & l) == 0L)
break;
if (kind > 80)
kind = 80;
jjstateSet[jjnewStateCnt++] = 200;
break;
case 204:
if ((0xfffffe00fffffeL & l) == 0L)
break;
if (kind > 81)
kind = 81;
jjstateSet[jjnewStateCnt++] = 204;
break;
case 208:
if ((0x1fffffe01fffffeL & l) == 0L)
break;
if (kind > 82)
kind = 82;
jjstateSet[jjnewStateCnt++] = 208;
break;
case 212:
if ((0x3fffffe03fffffeL & l) == 0L)
break;
if (kind > 83)
kind = 83;
jjstateSet[jjnewStateCnt++] = 212;
break;
case 216:
if ((0x7fffffe07fffffeL & l) == 0L)
break;
if (kind > 84)
kind = 84;
jjstateSet[jjnewStateCnt++] = 216;
break;
case 218:
if (curChar == 66)
{ jjCheckNAddStates(41, 76); }
break;
case 255:
if (curChar != 126)
break;
if (kind > 110)
kind = 110;
{ jjAddStates(25, 30); }
break;
case 259:
if (curChar == 92 && kind > 117)
kind = 117;
break;
case 261:
case 262:
if (curChar == 124 && kind > 119)
kind = 119;
break;
case 263:
if (curChar == 124)
jjstateSet[jjnewStateCnt++] = 262;
break;
case 265:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 264;
break;
case 275:
if (curChar == 95)
jjstateSet[jjnewStateCnt++] = 276;
break;
case 277:
if (curChar == 95)
jjstateSet[jjnewStateCnt++] = 278;
break;
default : break;
}
} while(i != startsAt);
}
else
{
int hiByte = (curChar >> 8);
int i1 = hiByte >> 6;
long l1 = 1L << (hiByte & 077);
int i2 = (curChar & 0xff) >> 6;
long l2 = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 5:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
{
if (kind > 95)
kind = 95;
}
if (jjCanMove_1(hiByte, i1, i2, l1, l2))
{
if (kind > 96)
kind = 96;
}
if (jjCanMove_2(hiByte, i1, i2, l1, l2))
{
if (kind > 103)
kind = 103;
}
if (jjCanMove_3(hiByte, i1, i2, l1, l2))
{
if (kind > 105)
kind = 105;
}
if (jjCanMove_4(hiByte, i1, i2, l1, l2))
{
if (kind > 107)
kind = 107;
}
if (jjCanMove_5(hiByte, i1, i2, l1, l2))
{
if (kind > 108)
kind = 108;
}
if (jjCanMove_6(hiByte, i1, i2, l1, l2))
{
if (kind > 109)
kind = 109;
}
if (jjCanMove_7(hiByte, i1, i2, l1, l2))
{
if (kind > 111)
kind = 111;
}
if (jjCanMove_8(hiByte, i1, i2, l1, l2))
{
if (kind > 113)
kind = 113;
}
if (jjCanMove_9(hiByte, i1, i2, l1, l2))
{
if (kind > 114)
kind = 114;
}
if (jjCanMove_10(hiByte, i1, i2, l1, l2))
{
if (kind > 115)
kind = 115;
}
if (jjCanMove_11(hiByte, i1, i2, l1, l2))
{
if (kind > 116)
kind = 116;
}
if (jjCanMove_12(hiByte, i1, i2, l1, l2))
{
if (kind > 117)
kind = 117;
}
if (jjCanMove_13(hiByte, i1, i2, l1, l2))
{
if (kind > 118)
kind = 118;
}
if (jjCanMove_14(hiByte, i1, i2, l1, l2))
{
if (kind > 119)
kind = 119;
}
if (jjCanMove_15(hiByte, i1, i2, l1, l2))
{
if (kind > 121)
kind = 121;
}
if (jjCanMove_16(hiByte, i1, i2, l1, l2))
{
if (kind > 124)
kind = 124;
}
if (jjCanMove_17(hiByte, i1, i2, l1, l2))
{ jjAddStates(118, 119); }
if (jjCanMove_18(hiByte, i1, i2, l1, l2))
{
if (kind > 110)
kind = 110;
{ jjAddStates(25, 30); }
}
break;
case 14:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 95)
kind = 95;
break;
case 15:
if (jjCanMove_1(hiByte, i1, i2, l1, l2) && kind > 96)
kind = 96;
break;
case 22:
if (jjCanMove_2(hiByte, i1, i2, l1, l2) && kind > 103)
kind = 103;
break;
case 23:
if (jjCanMove_3(hiByte, i1, i2, l1, l2) && kind > 105)
kind = 105;
break;
case 26:
if (jjCanMove_4(hiByte, i1, i2, l1, l2) && kind > 107)
kind = 107;
break;
case 27:
if (jjCanMove_5(hiByte, i1, i2, l1, l2) && kind > 108)
kind = 108;
break;
case 32:
if (jjCanMove_6(hiByte, i1, i2, l1, l2) && kind > 109)
kind = 109;
break;
case 37:
if (jjCanMove_7(hiByte, i1, i2, l1, l2) && kind > 111)
kind = 111;
break;
case 38:
if (jjCanMove_8(hiByte, i1, i2, l1, l2) && kind > 113)
kind = 113;
break;
case 39:
if (jjCanMove_9(hiByte, i1, i2, l1, l2) && kind > 114)
kind = 114;
break;
case 40:
if (jjCanMove_10(hiByte, i1, i2, l1, l2) && kind > 115)
kind = 115;
break;
case 41:
if (jjCanMove_11(hiByte, i1, i2, l1, l2) && kind > 116)
kind = 116;
break;
case 42:
if (jjCanMove_12(hiByte, i1, i2, l1, l2) && kind > 117)
kind = 117;
break;
case 43:
if (jjCanMove_13(hiByte, i1, i2, l1, l2) && kind > 118)
kind = 118;
break;
case 44:
if (jjCanMove_14(hiByte, i1, i2, l1, l2) && kind > 119)
kind = 119;
break;
case 48:
if (jjCanMove_15(hiByte, i1, i2, l1, l2) && kind > 121)
kind = 121;
break;
case 53:
if (jjCanMove_16(hiByte, i1, i2, l1, l2) && kind > 124)
kind = 124;
break;
case 70:
if (jjCanMove_17(hiByte, i1, i2, l1, l2))
{ jjAddStates(118, 119); }
break;
case 255:
if (!jjCanMove_18(hiByte, i1, i2, l1, l2))
break;
if (kind > 110)
kind = 110;
{ jjAddStates(25, 30); }
break;
case 256:
if (jjCanMove_6(hiByte, i1, i2, l1, l2) && kind > 117)
kind = 117;
break;
case 261:
if (jjCanMove_5(hiByte, i1, i2, l1, l2) && kind > 119)
kind = 119;
break;
default : if (i1 == 0 || l1 == 0 || i2 == 0 || l2 == 0) break; else break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 279 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
/** Token literal values. */
public static final String[] jjstrLiteralImages = {
"", null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, "\50", "\51", "\54", "\73", "\53", "\55", null,
null, "\136", "\136\136", "\43", "\41", "\45", null, null, "\74", null, "\76", null,
null, null, null, null, "\100\176", null, null, null, null, null, null, null, null,
null, null, null, null, null, "\133\45\135", "\133\45\45\135", "\133", "\135", null,
null, };
protected Token jjFillToken()
{
final Token t;
final String curTokenImage;
final int beginLine;
final int endLine;
final int beginColumn;
final int endColumn;
String im = jjstrLiteralImages[jjmatchedKind];
curTokenImage = (im == null) ? input_stream.GetImage() : im;
beginLine = input_stream.getBeginLine();
beginColumn = input_stream.getBeginColumn();
endLine = input_stream.getEndLine();
endColumn = input_stream.getEndColumn();
t = Token.newToken(jjmatchedKind, curTokenImage);
t.beginLine = beginLine;
t.endLine = endLine;
t.beginColumn = beginColumn;
t.endColumn = endColumn;
return t;
}
static final int[] jjnextStates = {
272, 0, 273, 2, 274, 275, 276, 277, 268, 270, 247, 248, 250, 252, 254, 56,
57, 58, 59, 61, 59, 62, 57, 51, 50, 256, 258, 260, 261, 263, 265, 72,
73, 74, 75, 76, 77, 79, 81, 66, 69, 83, 86, 89, 92, 95, 98, 101,
104, 107, 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, 83, 86, 89,
92, 95, 98, 101, 104, 107, 113, 117, 121, 125, 129, 133, 137, 141, 145, 149,
153, 157, 161, 165, 169, 173, 177, 181, 185, 189, 193, 197, 201, 205, 209, 213,
217, 3, 4, 50, 51, 52, 64, 67,
};
private static final boolean jjCanMove_0(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 0:
return ((jjbitVec0[i2] & l2) != 0L);
case 34:
return ((jjbitVec1[i2] & l2) != 0L);
case 42:
return ((jjbitVec2[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_1(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 0:
return ((jjbitVec3[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_2(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 34:
return ((jjbitVec4[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_3(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 34:
return ((jjbitVec5[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_4(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 34:
return ((jjbitVec6[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_5(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 34:
return ((jjbitVec7[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_6(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 34:
return ((jjbitVec8[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_7(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 34:
return ((jjbitVec9[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_8(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 33:
return ((jjbitVec10[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_9(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 33:
return ((jjbitVec11[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_10(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 33:
return ((jjbitVec12[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_11(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 33:
return ((jjbitVec13[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_12(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 34:
return ((jjbitVec14[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_13(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 33:
return ((jjbitVec15[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_14(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 34:
return ((jjbitVec16[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_15(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 34:
return ((jjbitVec17[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_16(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 3:
return ((jjbitVec18[i2] & l2) != 0L);
case 33:
return ((jjbitVec19[i2] & l2) != 0L);
case 34:
return ((jjbitVec20[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_17(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 34:
return ((jjbitVec21[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_18(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 0:
return ((jjbitVec22[i2] & l2) != 0L);
default :
return false;
}
}
int curLexState = 0;
int defaultLexState = 0;
int jjnewStateCnt;
int jjround;
int jjmatchedPos;
int jjmatchedKind;
/** Get the next Token. */
public Token getNextToken()
{
Token matchedToken;
int curPos = 0;
EOFLoop :
for (;;)
{
try
{
curChar = input_stream.BeginToken();
}
catch(Exception e)
{
jjmatchedKind = 0;
jjmatchedPos = -1;
matchedToken = jjFillToken();
return matchedToken;
}
try { input_stream.backup(0);
while (curChar <= 32 && (0x100002600L & (1L << curChar)) != 0L)
curChar = input_stream.BeginToken();
}
catch (java.io.IOException e1) { continue EOFLoop; }
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_0();
if (jjmatchedPos == 0 && jjmatchedKind > 131)
{
jjmatchedKind = 131;
}
if (jjmatchedKind != 0x7fffffff)
{
if (jjmatchedPos + 1 < curPos)
input_stream.backup(curPos - jjmatchedPos - 1);
if ((jjtoToken[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
matchedToken = jjFillToken();
return matchedToken;
}
else
{
continue EOFLoop;
}
}
int error_line = input_stream.getEndLine();
int error_column = input_stream.getEndColumn();
String error_after = null;
boolean EOFSeen = false;
try { input_stream.readChar(); input_stream.backup(1); }
catch (java.io.IOException e1) {
EOFSeen = true;
error_after = curPos <= 1 ? "" : input_stream.GetImage();
if (curChar == '\n' || curChar == '\r') {
error_line++;
error_column = 0;
}
else
error_column++;
}
if (!EOFSeen) {
input_stream.backup(1);
error_after = curPos <= 1 ? "" : input_stream.GetImage();
}
throw new TokenMgrError(EOFSeen, curLexState, error_line, error_column, error_after, curChar, TokenMgrError.LEXICAL_ERROR);
}
}
void SkipLexicalActions(Token matchedToken)
{
switch(jjmatchedKind)
{
default :
break;
}
}
void MoreLexicalActions()
{
jjimageLen += (lengthOfMatch = jjmatchedPos + 1);
switch(jjmatchedKind)
{
default :
break;
}
}
void TokenLexicalActions(Token matchedToken)
{
switch(jjmatchedKind)
{
default :
break;
}
}
private void jjCheckNAdd(int state)
{
if (jjrounds[state] != jjround)
{
jjstateSet[jjnewStateCnt++] = state;
jjrounds[state] = jjround;
}
}
private void jjAddStates(int start, int end)
{
do {
jjstateSet[jjnewStateCnt++] = jjnextStates[start];
} while (start++ != end);
}
private void jjCheckNAddTwoStates(int state1, int state2)
{
jjCheckNAdd(state1);
jjCheckNAdd(state2);
}
private void jjCheckNAddStates(int start, int end)
{
do {
jjCheckNAdd(jjnextStates[start]);
} while (start++ != end);
}
/** Constructor. */
public SyntaxCheckerTokenManager(SimpleCharStream stream){
if (SimpleCharStream.staticFlag)
throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");
input_stream = stream;
}
/** Constructor. */
public SyntaxCheckerTokenManager (SimpleCharStream stream, int lexState){
ReInit(stream);
SwitchTo(lexState);
}
/** Reinitialise parser. */
public void ReInit(SimpleCharStream stream)
{
jjmatchedPos =
jjnewStateCnt =
0;
curLexState = defaultLexState;
input_stream = stream;
ReInitRounds();
}
private void ReInitRounds()
{
int i;
jjround = 0x80000001;
for (i = 279; i-- > 0;)
jjrounds[i] = 0x80000000;
}
/** Reinitialise parser. */
public void ReInit(SimpleCharStream stream, int lexState)
{
ReInit(stream);
SwitchTo(lexState);
}
/** Switch to specified lex state. */
public void SwitchTo(int lexState)
{
if (lexState >= 1 || lexState < 0)
throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE);
else
curLexState = lexState;
}
/** Lexer state names. */
public static final String[] lexStateNames = {
"DEFAULT",
};
/** Lex State array. */
public static final int[] jjnewLexState = {
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1,
};
static final long[] jjtoToken = {
0xffff000000000001L, 0xffffffffffffffffL, 0xfL,
};
static final long[] jjtoSkip = {
0x1eL, 0x0L, 0x0L,
};
static final long[] jjtoSpecial = {
0x0L, 0x0L, 0x0L,
};
static final long[] jjtoMore = {
0x0L, 0x0L, 0x0L,
};
protected SimpleCharStream input_stream;
private final int[] jjrounds = new int[279];
private final int[] jjstateSet = new int[2 * 279];
private final StringBuilder jjimage = new StringBuilder();
private StringBuilder image = jjimage;
private int jjimageLen;
private int lengthOfMatch;
protected int curChar;
}