📄 parsertokenmanager.java
字号:
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 49)
kind = 49;
jjCheckNAdd(31);
}
else if ((0x2400L & l) != 0L)
{
if (kind > 27)
kind = 27;
}
else if ((0x100000200L & l) != 0L)
{
if (kind > 23)
kind = 23;
jjCheckNAdd(9);
}
else if (curChar == 36)
{
if (kind > 10)
kind = 10;
jjCheckNAddTwoStates(39, 40);
}
else if (curChar == 45)
jjCheckNAdd(31);
else if (curChar == 39)
jjCheckNAddStates(0, 2);
else if (curChar == 34)
jjCheckNAddStates(3, 5);
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 7;
else if (curChar == 41)
{
if (kind > 6)
kind = 6;
jjCheckNAddStates(6, 8);
}
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 28;
break;
case 1:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(6, 8);
break;
case 2:
if ((0x2400L & l) != 0L && kind > 6)
kind = 6;
break;
case 3:
if (curChar == 10 && kind > 6)
kind = 6;
break;
case 4:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 3;
break;
case 5:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 6:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 13)
kind = 13;
break;
case 7:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 8:
if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if ((0x100000200L & l) == 0L)
break;
if (kind > 23)
kind = 23;
jjCheckNAdd(9);
break;
case 10:
if (curChar == 34)
jjCheckNAddStates(3, 5);
break;
case 11:
if ((0xfffffffbffffdbffL & l) != 0L)
jjCheckNAddStates(3, 5);
break;
case 12:
if (curChar == 34 && kind > 24)
kind = 24;
break;
case 14:
if ((0x8400000000L & l) != 0L)
jjCheckNAddStates(3, 5);
break;
case 15:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(9, 12);
break;
case 16:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(3, 5);
break;
case 17:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 18;
break;
case 18:
if ((0xff000000000000L & l) != 0L)
jjCheckNAdd(16);
break;
case 19:
if (curChar == 32)
jjAddStates(13, 14);
break;
case 20:
if (curChar == 10)
jjCheckNAddStates(3, 5);
break;
case 21:
if (curChar == 39)
jjCheckNAddStates(0, 2);
break;
case 22:
if ((0xffffff7fffffdbffL & l) != 0L)
jjCheckNAddStates(0, 2);
break;
case 24:
if (curChar == 32)
jjAddStates(15, 16);
break;
case 25:
if (curChar == 10)
jjCheckNAddStates(0, 2);
break;
case 26:
if (curChar == 39 && kind > 24)
kind = 24;
break;
case 27:
if ((0x2400L & l) != 0L && kind > 27)
kind = 27;
break;
case 28:
if (curChar == 10 && kind > 27)
kind = 27;
break;
case 29:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 28;
break;
case 30:
if (curChar == 45)
jjCheckNAdd(31);
break;
case 31:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 49)
kind = 49;
jjCheckNAdd(31);
break;
case 33:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjstateSet[jjnewStateCnt++] = 33;
break;
case 36:
if (curChar == 36 && kind > 10)
kind = 10;
break;
case 38:
if (curChar == 36)
jjCheckNAddTwoStates(39, 40);
break;
case 40:
if (curChar == 33 && kind > 11)
kind = 11;
break;
case 41:
if (curChar != 36)
break;
if (kind > 10)
kind = 10;
jjCheckNAddTwoStates(39, 40);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAdd(33);
}
else if (curChar == 92)
jjCheckNAddStates(17, 20);
break;
case 6:
if (kind > 13)
kind = 13;
break;
case 11:
if ((0xffffffffefffffffL & l) != 0L)
jjCheckNAddStates(3, 5);
break;
case 13:
if (curChar == 92)
jjAddStates(21, 25);
break;
case 14:
if ((0x14404410000000L & l) != 0L)
jjCheckNAddStates(3, 5);
break;
case 22:
jjAddStates(0, 2);
break;
case 23:
if (curChar == 92)
jjAddStates(15, 16);
break;
case 32:
case 33:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAdd(33);
break;
case 34:
if (curChar == 92)
jjCheckNAddStates(17, 20);
break;
case 35:
if (curChar == 92)
jjCheckNAddTwoStates(35, 36);
break;
case 37:
if (curChar == 92)
jjCheckNAddTwoStates(37, 38);
break;
case 39:
if (curChar == 92)
jjAddStates(26, 27);
break;
default : break;
}
} while(i != startsAt);
}
else
{
int hiByte = (int)(curChar >> 8);
int i1 = hiByte >> 6;
long l1 = 1L << (hiByte & 077);
int i2 = (curChar & 0xff) >> 6;
long l2 = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 6:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 13)
kind = 13;
break;
case 11:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(3, 5);
break;
case 22:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(0, 2);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 42 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_6(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0xd000L) != 0L)
return 2;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_6(int pos, long active0)
{
return jjMoveNfa_6(jjStopStringLiteralDfa_6(pos, active0), pos + 1);
}
private final int jjStartNfaWithStates_6(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_6(state, pos + 1);
}
private final int jjMoveStringLiteralDfa0_6()
{
switch(curChar)
{
case 35:
jjmatchedKind = 15;
return jjMoveStringLiteralDfa1_6(0x5000L);
case 42:
return jjMoveStringLiteralDfa1_6(0x200000L);
default :
return jjMoveNfa_6(3, 0);
}
}
private final int jjMoveStringLiteralDfa1_6(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_6(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x1000L) != 0L)
return jjStopAtPos(1, 12);
else if ((active0 & 0x200000L) != 0L)
return jjStopAtPos(1, 21);
break;
case 42:
if ((active0 & 0x4000L) != 0L)
return jjStartNfaWithStates_6(1, 14, 0);
break;
default :
break;
}
return jjStartNfa_6(0, active0);
}
private final int jjMoveNfa_6(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 12;
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 3:
if (curChar == 36)
{
if (kind > 10)
kind = 10;
jjCheckNAddTwoStates(9, 10);
}
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 13)
kind = 13;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 6:
if (curChar == 36 && kind > 10)
kind = 10;
break;
case 8:
if (curChar == 36)
jjCheckNAddTwoStates(9, 10);
break;
case 10:
if (curChar == 33 && kind > 11)
kind = 11;
break;
case 11:
if (curChar != 36)
break;
if (kind > 10)
kind = 10;
jjCheckNAddTwoStates(9, 10);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -