📄 xmlbifv03tokenmanager.java
字号:
jjmatchedPos = 6;
}
break;
case 84:
return jjMoveStringLiteralDfa7_0(active0, 0xc000L);
case 101:
if ((active0 & 0x40000L) != 0L)
{
jjmatchedKind = 18;
jjmatchedPos = 6;
}
return jjMoveStringLiteralDfa7_0(active0, 0x100000L);
case 105:
return jjMoveStringLiteralDfa7_0(active0, 0x200000L);
case 107:
if ((active0 & 0x2000L) != 0L)
{
jjmatchedKind = 13;
jjmatchedPos = 6;
}
break;
case 108:
return jjMoveStringLiteralDfa7_0(active0, 0x80000L);
case 110:
if ((active0 & 0x200L) != 0L)
{
jjmatchedKind = 9;
jjmatchedPos = 6;
}
break;
case 116:
return jjMoveStringLiteralDfa7_0(active0, 0x40c000L);
default :
break;
}
return jjMoveNfa_0(1, 6);
}
private final int jjMoveStringLiteralDfa7_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjMoveNfa_0(1, 6);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
return jjMoveNfa_0(1, 6);
}
switch(curChar)
{
case 34:
if ((active0 & 0x100000L) != 0L)
{
jjmatchedKind = 20;
jjmatchedPos = 7;
}
break;
case 69:
if ((active0 & 0x80000L) != 0L)
{
jjmatchedKind = 19;
jjmatchedPos = 7;
}
break;
case 73:
return jjMoveStringLiteralDfa8_0(active0, 0x4000L);
case 89:
if ((active0 & 0x8000L) != 0L)
{
jjmatchedKind = 15;
jjmatchedPos = 7;
}
break;
case 101:
if ((active0 & 0x80000L) != 0L)
{
jjmatchedKind = 19;
jjmatchedPos = 7;
}
break;
case 105:
return jjMoveStringLiteralDfa8_0(active0, 0x4000L);
case 111:
return jjMoveStringLiteralDfa8_0(active0, 0x200000L);
case 121:
if ((active0 & 0x8000L) != 0L)
{
jjmatchedKind = 15;
jjmatchedPos = 7;
}
return jjMoveStringLiteralDfa8_0(active0, 0x400000L);
default :
break;
}
return jjMoveNfa_0(1, 7);
}
private final int jjMoveStringLiteralDfa8_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjMoveNfa_0(1, 7);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
return jjMoveNfa_0(1, 7);
}
switch(curChar)
{
case 34:
if ((active0 & 0x400000L) != 0L)
{
jjmatchedKind = 22;
jjmatchedPos = 8;
}
break;
case 79:
return jjMoveStringLiteralDfa9_0(active0, 0x4000L);
case 110:
return jjMoveStringLiteralDfa9_0(active0, 0x200000L);
case 111:
return jjMoveStringLiteralDfa9_0(active0, 0x4000L);
default :
break;
}
return jjMoveNfa_0(1, 8);
}
private final int jjMoveStringLiteralDfa9_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjMoveNfa_0(1, 8);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
return jjMoveNfa_0(1, 8);
}
switch(curChar)
{
case 34:
if ((active0 & 0x200000L) != 0L)
{
jjmatchedKind = 21;
jjmatchedPos = 9;
}
break;
case 78:
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 14;
jjmatchedPos = 9;
}
break;
case 110:
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 14;
jjmatchedPos = 9;
}
break;
default :
break;
}
return jjMoveNfa_0(1, 9);
}
private final void jjCheckNAdd(int state)
{
if (jjrounds[state] != jjround)
{
jjstateSet[jjnewStateCnt++] = state;
jjrounds[state] = jjround;
}
}
private final void jjAddStates(int start, int end)
{
do {
jjstateSet[jjnewStateCnt++] = jjnextStates[start];
} while (start++ != end);
}
private final void jjCheckNAddTwoStates(int state1, int state2)
{
jjCheckNAdd(state1);
jjCheckNAdd(state2);
}
private final void jjCheckNAddStates(int start, int end)
{
do {
jjCheckNAdd(jjnextStates[start]);
} while (start++ != end);
}
private final void jjCheckNAddStates(int start)
{
jjCheckNAdd(jjnextStates[start]);
jjCheckNAdd(jjnextStates[start + 1]);
}
static final long[] jjbitVec0 = { 0x1ff00000fffffffeL, 0xffffffffffffc000L, 0xffffffffL, 0x600000000000000L};
static final long[] jjbitVec2 = { 0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL};
static final long[] jjbitVec3 = { 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL};
static final long[] jjbitVec4 = { 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffL, 0x0L};
static final long[] jjbitVec5 = { 0xffffffffffffffffL, 0xffffffffffffffffL, 0x0L, 0x0L};
static final long[] jjbitVec6 = { 0x3fffffffffffL, 0x0L, 0x0L, 0x0L};
static final long[] jjbitVec7 = { 0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL};
static final long[] jjbitVec8 = { 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL};
private final int jjMoveNfa_0(int startState, int curPos)
{
int strKind = jjmatchedKind;
int strPos = jjmatchedPos;
int seenUpto;
input_stream.backup(seenUpto = curPos + 1);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { throw new Error("Internal Error"); }
curPos = 0;
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 35;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 1:
if ((0xefffffffffffffffL & l) != 0L)
{
if (kind > 28)
kind = 28;
}
else if (curChar == 60)
jjAddStates(0, 1);
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 23)
kind = 23;
jjCheckNAddStates(2, 5);
}
else if ((0x100003600L & l) != 0L)
{
if (kind > 1)
kind = 1;
jjCheckNAdd(0);
}
else if (curChar == 34)
jjCheckNAdd(12);
else if (curChar == 36)
{
if (kind > 25)
kind = 25;
jjCheckNAdd(9);
}
else if (curChar == 46)
jjCheckNAdd(4);
if ((0x3fe000000000000L & l) != 0L)
{
if (kind > 23)
kind = 23;
jjCheckNAdd(2);
}
break;
case 0:
if ((0x100003600L & l) == 0L)
break;
if (kind > 1)
kind = 1;
jjCheckNAdd(0);
break;
case 2:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 23)
kind = 23;
jjCheckNAdd(2);
break;
case 3:
if (curChar == 46)
jjCheckNAdd(4);
break;
case 4:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 23)
kind = 23;
jjCheckNAddTwoStates(4, 5);
break;
case 6:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(7);
break;
case 7:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 23)
kind = 23;
jjCheckNAdd(7);
break;
case 8:
if (curChar != 36)
break;
if (kind > 25)
kind = 25;
jjCheckNAdd(9);
break;
case 9:
if ((0x3ff001000000000L & l) == 0L)
break;
if (kind > 25)
kind = 25;
jjCheckNAdd(9);
break;
case 10:
if ((0xefffffffffffffffL & l) != 0L && kind > 28)
kind = 28;
break;
case 11:
if (curChar == 34)
jjCheckNAdd(12);
break;
case 12:
if ((0xfffffffbffffffffL & l) != 0L)
jjCheckNAddTwoStates(12, 13);
break;
case 13:
if (curChar == 34 && kind > 29)
kind = 29;
break;
case 14:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 23)
kind = 23;
jjCheckNAddStates(2, 5);
break;
case 15:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(15, 16);
break;
case 16:
if (curChar != 46)
break;
if (kind > 23)
kind = 23;
jjCheckNAddTwoStates(17, 18);
break;
case 17:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 23)
kind = 23;
jjCheckNAddTwoStates(17, 18);
break;
case 19:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(20);
break;
case 20:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 23)
kind = 23;
jjCheckNAdd(20);
break;
case 21:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 23)
kind = 23;
jjCheckNAddTwoStates(21, 22);
break;
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -