in ide/xml.text/src/org/netbeans/modules/xml/text/syntax/javacc/DTDSyntaxTokenManager.java [2718:3099]
private final int jjMoveNfa_8(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 61;
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 ((0x7ff7f18fffff9ffL & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAdd(32);
}
else if ((0x2800000200000000L & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAdd(33);
}
else if ((0x100000200L & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAdd(31);
}
else if (curChar == 60)
{
if (kind > 50)
kind = 50;
jjCheckNAdd(0);
}
if (curChar == 35)
jjAddStates(5, 7);
break;
case 0:
if (curChar != 60)
break;
kind = 50;
jjCheckNAdd(0);
break;
case 31:
if ((0x100000200L & l) == 0L)
break;
kind = 52;
jjCheckNAdd(31);
break;
case 32:
if ((0x7ff7f18fffff9ffL & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAdd(32);
break;
case 33:
if ((0x2800000200000000L & l) == 0L)
break;
kind = 52;
jjCheckNAdd(33);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 1:
if ((0xffffffffd7ffffffL & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAdd(32);
}
else if ((0x28000000L & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAdd(33);
}
if (curChar == 78)
jjAddStates(8, 9);
else if (curChar == 69)
jjAddStates(10, 11);
else if (curChar == 67)
jjstateSet[jjnewStateCnt++] = 29;
else if (curChar == 73)
jjstateSet[jjnewStateCnt++] = 20;
break;
case 2:
if (curChar == 68 && kind > 51)
kind = 51;
break;
case 3:
case 10:
case 16:
if (curChar == 69)
jjCheckNAdd(2);
break;
case 4:
if (curChar == 82)
jjstateSet[jjnewStateCnt++] = 3;
break;
case 5:
if (curChar == 73)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 6:
if (curChar == 85)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 7:
if (curChar == 81)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 8:
if (curChar == 69)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if (curChar == 82)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 11:
if (curChar == 73)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 12:
if (curChar == 76)
jjstateSet[jjnewStateCnt++] = 11;
break;
case 13:
if (curChar == 80)
jjstateSet[jjnewStateCnt++] = 12;
break;
case 14:
if (curChar == 77)
jjstateSet[jjnewStateCnt++] = 13;
break;
case 15:
if (curChar == 73)
jjstateSet[jjnewStateCnt++] = 14;
break;
case 17:
if (curChar == 88)
jjstateSet[jjnewStateCnt++] = 16;
break;
case 18:
if (curChar == 73)
jjstateSet[jjnewStateCnt++] = 17;
break;
case 19:
if (curChar == 70)
jjstateSet[jjnewStateCnt++] = 18;
break;
case 20:
if (curChar != 68)
break;
if (kind > 51)
kind = 51;
jjCheckNAddTwoStates(24, 22);
break;
case 21:
if (curChar != 70)
break;
if (kind > 51)
kind = 51;
jjCheckNAdd(22);
break;
case 22:
case 40:
if (curChar == 83 && kind > 51)
kind = 51;
break;
case 23:
if (curChar == 69)
jjstateSet[jjnewStateCnt++] = 21;
break;
case 24:
if (curChar == 82)
jjstateSet[jjnewStateCnt++] = 23;
break;
case 25:
if (curChar == 73)
jjstateSet[jjnewStateCnt++] = 20;
break;
case 26:
if (curChar == 65 && kind > 51)
kind = 51;
break;
case 27:
if (curChar == 84)
jjstateSet[jjnewStateCnt++] = 26;
break;
case 28:
if (curChar == 65)
jjstateSet[jjnewStateCnt++] = 27;
break;
case 29:
if (curChar == 68)
jjstateSet[jjnewStateCnt++] = 28;
break;
case 30:
if (curChar == 67)
jjstateSet[jjnewStateCnt++] = 29;
break;
case 32:
if ((0xffffffffd7ffffffL & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAdd(32);
break;
case 33:
if ((0x28000000L & l) == 0L)
break;
kind = 52;
jjCheckNAdd(33);
break;
case 34:
if (curChar == 69)
jjAddStates(10, 11);
break;
case 35:
if (curChar == 89 && kind > 51)
kind = 51;
break;
case 36:
if (curChar == 84)
jjstateSet[jjnewStateCnt++] = 35;
break;
case 37:
if (curChar == 73)
jjstateSet[jjnewStateCnt++] = 36;
break;
case 38:
if (curChar == 84)
jjstateSet[jjnewStateCnt++] = 37;
break;
case 39:
if (curChar == 78)
jjstateSet[jjnewStateCnt++] = 38;
break;
case 41:
if (curChar == 69)
jjstateSet[jjnewStateCnt++] = 40;
break;
case 42:
if (curChar == 73)
jjstateSet[jjnewStateCnt++] = 41;
break;
case 43:
if (curChar == 84)
jjstateSet[jjnewStateCnt++] = 42;
break;
case 44:
if (curChar == 73)
jjstateSet[jjnewStateCnt++] = 43;
break;
case 45:
if (curChar == 84)
jjstateSet[jjnewStateCnt++] = 44;
break;
case 46:
if (curChar == 78)
jjstateSet[jjnewStateCnt++] = 45;
break;
case 47:
if (curChar == 78)
jjAddStates(8, 9);
break;
case 48:
if (curChar != 78)
break;
if (kind > 51)
kind = 51;
jjCheckNAdd(22);
break;
case 49:
if (curChar == 69)
jjstateSet[jjnewStateCnt++] = 48;
break;
case 50:
if (curChar == 75)
jjstateSet[jjnewStateCnt++] = 49;
break;
case 51:
if (curChar == 79)
jjstateSet[jjnewStateCnt++] = 50;
break;
case 52:
if (curChar == 84)
jjstateSet[jjnewStateCnt++] = 51;
break;
case 53:
if (curChar == 77)
jjstateSet[jjnewStateCnt++] = 52;
break;
case 54:
if (curChar == 78 && kind > 51)
kind = 51;
break;
case 55:
if (curChar == 79)
jjstateSet[jjnewStateCnt++] = 54;
break;
case 56:
if (curChar == 73)
jjstateSet[jjnewStateCnt++] = 55;
break;
case 57:
if (curChar == 84)
jjstateSet[jjnewStateCnt++] = 56;
break;
case 58:
if (curChar == 65)
jjstateSet[jjnewStateCnt++] = 57;
break;
case 59:
if (curChar == 84)
jjstateSet[jjnewStateCnt++] = 58;
break;
case 60:
if (curChar == 79)
jjstateSet[jjnewStateCnt++] = 59;
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 1:
case 32:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 52)
kind = 52;
jjCheckNAdd(32);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 61 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}