in jena-arq/src/main/java/org/apache/jena/cdt/parser/CDTLiteralParserTokenManager.java [253:790]
private 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 startsAt = 0;
jjnewStateCnt = 74;
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 0:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 9)
kind = 9;
{ jjCheckNAddStates(0, 7); }
}
else if ((0x280000000000L & l) != 0L)
{ jjCheckNAddStates(8, 12); }
else if (curChar == 46)
{ jjCheckNAddTwoStates(54, 56); }
else if (curChar == 60)
{ jjCheckNAddTwoStates(37, 38); }
else if (curChar == 34)
jjstateSet[jjnewStateCnt++] = 34;
else if (curChar == 39)
jjstateSet[jjnewStateCnt++] = 22;
if (curChar == 34)
{ jjCheckNAddStates(13, 15); }
else if (curChar == 39)
{ jjCheckNAddStates(16, 18); }
break;
case 1:
if ((0x8400000000L & l) != 0L && kind > 15)
kind = 15;
break;
case 2:
if (curChar == 39)
{ jjCheckNAddStates(16, 18); }
break;
case 3:
if ((0xffffff7fffffdbffL & l) != 0L)
{ jjCheckNAddStates(16, 18); }
break;
case 5:
if ((0x8400000000L & l) != 0L)
{ jjCheckNAddStates(16, 18); }
break;
case 6:
if (curChar == 39 && kind > 16)
kind = 16;
break;
case 7:
if (curChar == 34)
{ jjCheckNAddStates(13, 15); }
break;
case 8:
if ((0xfffffffbffffdbffL & l) != 0L)
{ jjCheckNAddStates(13, 15); }
break;
case 10:
if ((0x8400000000L & l) != 0L)
{ jjCheckNAddStates(13, 15); }
break;
case 11:
if (curChar == 34 && kind > 17)
kind = 17;
break;
case 12:
if (curChar == 39)
{ jjCheckNAddStates(19, 22); }
break;
case 13:
case 17:
if ((0xffffff7fffffffffL & l) != 0L)
{ jjCheckNAddStates(19, 22); }
break;
case 15:
if ((0x8400000000L & l) != 0L)
{ jjCheckNAddStates(19, 22); }
break;
case 16:
case 19:
if (curChar == 39)
{ jjCheckNAdd(17); }
break;
case 18:
if (curChar == 39)
{ jjAddStates(23, 24); }
break;
case 20:
if (curChar == 39 && kind > 18)
kind = 18;
break;
case 21:
if (curChar == 39)
jjstateSet[jjnewStateCnt++] = 20;
break;
case 22:
if (curChar == 39)
jjstateSet[jjnewStateCnt++] = 12;
break;
case 23:
if (curChar == 39)
jjstateSet[jjnewStateCnt++] = 22;
break;
case 24:
if (curChar == 34)
{ jjCheckNAddStates(25, 28); }
break;
case 25:
case 29:
if ((0xfffffffbffffffffL & l) != 0L)
{ jjCheckNAddStates(25, 28); }
break;
case 27:
if ((0x8400000000L & l) != 0L)
{ jjCheckNAddStates(25, 28); }
break;
case 28:
case 31:
if (curChar == 34)
{ jjCheckNAdd(29); }
break;
case 30:
if (curChar == 34)
{ jjAddStates(29, 30); }
break;
case 32:
if (curChar == 34 && kind > 19)
kind = 19;
break;
case 33:
if (curChar == 34)
jjstateSet[jjnewStateCnt++] = 32;
break;
case 34:
if (curChar == 34)
jjstateSet[jjnewStateCnt++] = 24;
break;
case 35:
if (curChar == 34)
jjstateSet[jjnewStateCnt++] = 34;
break;
case 36:
if (curChar == 60)
{ jjCheckNAddTwoStates(37, 38); }
break;
case 37:
if ((0xaffffffa00000000L & l) != 0L)
{ jjCheckNAddTwoStates(37, 38); }
break;
case 38:
if (curChar == 62 && kind > 21)
kind = 21;
break;
case 39:
if (curChar == 58)
jjstateSet[jjnewStateCnt++] = 40;
break;
case 40:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 22)
kind = 22;
{ jjCheckNAddTwoStates(41, 42); }
break;
case 41:
if ((0x3ff600000000000L & l) != 0L)
{ jjCheckNAddTwoStates(41, 42); }
break;
case 42:
if ((0x3ff200000000000L & l) != 0L && kind > 22)
kind = 22;
break;
case 46:
if (curChar == 45)
{ jjCheckNAdd(47); }
break;
case 47:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 23)
kind = 23;
{ jjCheckNAddTwoStates(46, 47); }
break;
case 48:
if ((0x280000000000L & l) != 0L)
{ jjCheckNAddStates(8, 12); }
break;
case 49:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 9)
kind = 9;
{ jjCheckNAdd(49); }
break;
case 50:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(50, 51); }
break;
case 51:
if (curChar != 46)
break;
if (kind > 10)
kind = 10;
{ jjCheckNAdd(52); }
break;
case 52:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 10)
kind = 10;
{ jjCheckNAdd(52); }
break;
case 53:
if (curChar == 46)
{ jjCheckNAdd(54); }
break;
case 54:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 10)
kind = 10;
{ jjCheckNAdd(54); }
break;
case 55:
if (curChar == 46)
{ jjCheckNAdd(56); }
break;
case 56:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(56, 57); }
break;
case 58:
if ((0x280000000000L & l) != 0L)
{ jjCheckNAdd(59); }
break;
case 59:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 11)
kind = 11;
{ jjCheckNAdd(59); }
break;
case 60:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddStates(31, 34); }
break;
case 61:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(61, 62); }
break;
case 62:
if (curChar == 46)
{ jjCheckNAddTwoStates(63, 64); }
break;
case 63:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(63, 64); }
break;
case 65:
if ((0x280000000000L & l) != 0L)
{ jjCheckNAdd(66); }
break;
case 66:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 11)
kind = 11;
{ jjCheckNAdd(66); }
break;
case 67:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(67, 68); }
break;
case 69:
if ((0x280000000000L & l) != 0L)
{ jjCheckNAdd(70); }
break;
case 70:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 11)
kind = 11;
{ jjCheckNAdd(70); }
break;
case 71:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 9)
kind = 9;
{ jjCheckNAddStates(0, 7); }
break;
case 72:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 20)
kind = 20;
{ jjCheckNAdd(72); }
break;
case 73:
if (curChar == 46)
{ jjCheckNAddTwoStates(54, 56); }
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 0:
if (curChar == 64)
{ jjCheckNAdd(45); }
else if (curChar == 95)
jjstateSet[jjnewStateCnt++] = 39;
else if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0x14404410144044L & l) != 0L && kind > 15)
kind = 15;
break;
case 3:
if ((0xffffffffefffffffL & l) != 0L)
{ jjCheckNAddStates(16, 18); }
break;
case 4:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 5:
if ((0x14404410144044L & l) != 0L)
{ jjCheckNAddStates(16, 18); }
break;
case 8:
if ((0xffffffffefffffffL & l) != 0L)
{ jjCheckNAddStates(13, 15); }
break;
case 9:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 10:
if ((0x14404410144044L & l) != 0L)
{ jjCheckNAddStates(13, 15); }
break;
case 13:
if ((0xffffffffefffffffL & l) != 0L)
{ jjCheckNAddStates(19, 22); }
break;
case 14:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 15:
if ((0x14404410144044L & l) != 0L)
{ jjCheckNAddStates(19, 22); }
break;
case 17:
{ jjCheckNAddStates(19, 22); }
break;
case 25:
if ((0xffffffffefffffffL & l) != 0L)
{ jjCheckNAddStates(25, 28); }
break;
case 26:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 27;
break;
case 27:
if ((0x14404410144044L & l) != 0L)
{ jjCheckNAddStates(25, 28); }
break;
case 29:
{ jjCheckNAddStates(25, 28); }
break;
case 37:
if ((0xc7fffffeafffffffL & l) != 0L)
{ jjAddStates(35, 36); }
break;
case 40:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 22)
kind = 22;
{ jjCheckNAddTwoStates(41, 42); }
break;
case 41:
if ((0x7fffffe87fffffeL & l) != 0L)
{ jjCheckNAddTwoStates(41, 42); }
break;
case 42:
if ((0x7fffffe87fffffeL & l) != 0L && kind > 22)
kind = 22;
break;
case 43:
if (curChar == 95)
jjstateSet[jjnewStateCnt++] = 39;
break;
case 44:
if (curChar == 64)
{ jjCheckNAdd(45); }
break;
case 45:
if ((0x7fffffe07fffffeL & l) == 0L)
break;
if (kind > 23)
kind = 23;
{ jjCheckNAddTwoStates(45, 46); }
break;
case 47:
if ((0x7fffffe07fffffeL & l) == 0L)
break;
if (kind > 23)
kind = 23;
{ jjCheckNAddTwoStates(46, 47); }
break;
case 57:
if ((0x2000000020L & l) != 0L)
{ jjAddStates(37, 38); }
break;
case 64:
if ((0x2000000020L & l) != 0L)
{ jjAddStates(39, 40); }
break;
case 68:
if ((0x2000000020L & l) != 0L)
{ jjAddStates(41, 42); }
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 3:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
{ jjAddStates(16, 18); }
break;
case 8:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
{ jjAddStates(13, 15); }
break;
case 13:
case 17:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
{ jjCheckNAddStates(19, 22); }
break;
case 25:
case 29:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
{ jjCheckNAddStates(25, 28); }
break;
case 37:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
{ jjAddStates(35, 36); }
break;
case 40:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 22)
kind = 22;
{ jjCheckNAddTwoStates(41, 42); }
break;
case 41:
if (jjCanMove_2(hiByte, i1, i2, l1, l2))
{ jjCheckNAddTwoStates(41, 42); }
break;
case 42:
if (jjCanMove_2(hiByte, i1, i2, l1, l2) && kind > 22)
kind = 22;
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 = 74 - (jjnewStateCnt = startsAt)))
break;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { break; }
}
if (jjmatchedPos > strPos)
return curPos;
int toRet = Math.max(curPos, seenUpto);
if (curPos < toRet)
for (i = toRet - Math.min(curPos, seenUpto); i-- > 0; )
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { throw new Error("Internal Error : Please send a bug report."); }
if (jjmatchedPos < strPos)
{
jjmatchedKind = strKind;
jjmatchedPos = strPos;
}
else if (jjmatchedPos == strPos && jjmatchedKind > strKind)
jjmatchedKind = strKind;
return toRet;
}