📄 cstandardtokenizertokenmanager.java
字号:
/* Generated By:JavaCC: Do not edit this line. CStandardTokenizerTokenManager.java */
package org.apache.lucene.analysis.cw;
import java.io.*;
import org.apache.lucene.analysis.standard.FastCharStream;
import org.apache.lucene.analysis.standard.CharStream;
import org.apache.lucene.analysis.standard.ParseException;
public class CStandardTokenizerTokenManager implements CStandardTokenizerConstants
{
public java.io.PrintStream debugStream = System.out;
public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }
private final int jjMoveStringLiteralDfa0_0()
{
return jjMoveNfa_0(0, 0);
}
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 = {
0xfffffffeL, 0x0L, 0x0L, 0x0L
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL
};
static final long[] jjbitVec3 = {
0x1600L, 0x0L, 0x0L, 0x0L
};
static final long[] jjbitVec4 = {
0x0L, 0xffc000000000L, 0x0L, 0xffc000000000L
};
static final long[] jjbitVec5 = {
0x0L, 0x3ff00000000L, 0x0L, 0x3ff000000000000L
};
static final long[] jjbitVec6 = {
0x0L, 0xffc000000000L, 0x0L, 0xff8000000000L
};
static final long[] jjbitVec7 = {
0x0L, 0xffc000000000L, 0x0L, 0x0L
};
static final long[] jjbitVec8 = {
0x0L, 0x3ff0000L, 0x0L, 0x3ff0000L
};
static final long[] jjbitVec9 = {
0x0L, 0x3ffL, 0x0L, 0x0L
};
static final long[] jjbitVec10 = {
0x1ff00000fffffffeL, 0xffffffffffffc000L, 0xffffffffL, 0x600000000000000L
};
static final long[] jjbitVec11 = {
0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec12 = {
0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffL, 0x0L
};
static final long[] jjbitVec13 = {
0xffffffffffffffffL, 0xffffffffffffffffL, 0x0L, 0x0L
};
static final long[] jjbitVec14 = {
0x3fffffffffffL, 0x0L, 0x0L, 0x0L
};
private final int jjMoveNfa_0(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 73;
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 0:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 1)
kind = 1;
jjCheckNAddStates(0, 11);
}
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(12, 17);
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(18, 23);
break;
case 1:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(1, 2);
break;
case 2:
case 3:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(3, 4);
break;
case 4:
if ((0xf00000000000L & l) != 0L)
jjCheckNAdd(5);
break;
case 5:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAdd(5);
break;
case 6:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(6, 7);
break;
case 7:
case 8:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(8, 9);
break;
case 9:
if ((0xf00000000000L & l) != 0L)
jjCheckNAdd(10);
break;
case 10:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(10, 11);
break;
case 11:
if ((0xf00000000000L & l) != 0L)
jjCheckNAddTwoStates(12, 13);
break;
case 12:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(12, 13);
break;
case 13:
case 14:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAddTwoStates(9, 14);
break;
case 15:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(15, 16);
break;
case 16:
case 17:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(17, 18);
break;
case 18:
if ((0xf00000000000L & l) != 0L)
jjCheckNAdd(19);
break;
case 19:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(19, 20);
break;
case 20:
if ((0xf00000000000L & l) != 0L)
jjCheckNAddTwoStates(21, 22);
break;
case 21:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(21, 22);
break;
case 22:
case 23:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(23, 24);
break;
case 24:
if ((0xf00000000000L & l) != 0L)
jjCheckNAdd(25);
break;
case 25:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAddTwoStates(20, 25);
break;
case 26:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(12, 17);
break;
case 27:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 1)
kind = 1;
jjCheckNAddStates(0, 11);
break;
case 28:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 1)
kind = 1;
jjCheckNAdd(28);
break;
case 29:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(24, 26);
break;
case 30:
if ((0x600000000000L & l) != 0L)
jjCheckNAdd(31);
break;
case 31:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(27, 29);
break;
case 33:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(33, 34);
break;
case 34:
if ((0x600000000000L & l) != 0L)
jjCheckNAdd(35);
break;
case 35:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 5)
kind = 5;
jjCheckNAddTwoStates(34, 35);
break;
case 36:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(36, 37);
break;
case 37:
if (curChar == 46)
jjCheckNAdd(38);
break;
case 38:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 6)
kind = 6;
jjCheckNAddTwoStates(37, 38);
break;
case 39:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(39, 40);
break;
case 40:
if ((0xf00000000000L & l) != 0L)
jjCheckNAddTwoStates(41, 42);
break;
case 41:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(41, 42);
break;
case 42:
case 43:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAdd(43);
break;
case 44:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(44, 45);
break;
case 45:
if ((0xf00000000000L & l) != 0L)
jjCheckNAddTwoStates(46, 47);
break;
case 46:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(46, 47);
break;
case 47:
case 48:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(48, 49);
break;
case 49:
if ((0xf00000000000L & l) != 0L)
jjCheckNAdd(50);
break;
case 50:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAddTwoStates(45, 50);
break;
case 51:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(51, 52);
break;
case 52:
if ((0xf00000000000L & l) != 0L)
jjCheckNAddTwoStates(53, 54);
break;
case 53:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(53, 54);
break;
case 54:
case 55:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(55, 56);
break;
case 56:
if ((0xf00000000000L & l) != 0L)
jjCheckNAdd(57);
break;
case 57:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(57, 58);
break;
case 58:
if ((0xf00000000000L & l) != 0L)
jjCheckNAddTwoStates(59, 60);
break;
case 59:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(59, 60);
break;
case 60:
case 61:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAddTwoStates(56, 61);
break;
case 64:
if (curChar == 39)
jjstateSet[jjnewStateCnt++] = 65;
break;
case 67:
if (curChar == 46)
jjCheckNAdd(68);
break;
case 69:
if (curChar != 46)
break;
if (kind > 3)
kind = 3;
jjCheckNAdd(68);
break;
case 71:
if (curChar == 38)
jjstateSet[jjnewStateCnt++] = 72;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -