markovtokenmanager.java
来自「一个用于解决马尔可夫过程的源代码,很适合学习随机过程的同学1」· Java 代码 · 共 440 行
JAVA
440 行
/* Generated By:JavaCC: Do not edit this line. MarkovTokenManager.java */
package net.kashivasi.markov.interpreter;
import java.io.*;
public class MarkovTokenManager implements MarkovConstants
{
public static java.io.PrintStream debugStream = System.out;
public static void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }
private static final int jjStopStringLiteralDfa_0(int pos, long active0){
switch (pos) {
default :
return -1;
}
}
private static final int jjStartNfa_0(int pos, long active0){
return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1);
}
static private final int jjStopAtPos(int pos, int kind)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
return pos + 1;
}
static private final int jjStartNfaWithStates_0(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_0(state, pos + 1);
}
static private final int jjMoveStringLiteralDfa0_0()
{
switch(curChar)
{
case 13:
return jjStartNfaWithStates_0(0, 3, 5);
case 46:
return jjStopAtPos(0, 6);
default :
return jjMoveNfa_0(1, 0);
}
}
static private final void jjCheckNAdd(int state)
{
if (jjrounds[state] != jjround)
{
jjstateSet[jjnewStateCnt++] = state;
jjrounds[state] = jjround;
}
}
static private final void jjAddStates(int start, int end)
{
do {
jjstateSet[jjnewStateCnt++] = jjnextStates[start];
} while (start++ != end);
}
static private final void jjCheckNAddTwoStates(int state1, int state2)
{
jjCheckNAdd(state1);
jjCheckNAdd(state2);
}
static private final void jjCheckNAddStates(int start, int end)
{
do {
jjCheckNAdd(jjnextStates[start]);
} while (start++ != end);
}
static private final void jjCheckNAddStates(int start)
{
jjCheckNAdd(jjnextStates[start]);
jjCheckNAdd(jjnextStates[start + 1]);
}
static final long[] jjbitVec0 = { 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL};
static private final int jjMoveNfa_0(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 24;
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 ((0x2400L & l) != 0L)
{
if (kind > 8)
kind = 8;
}
else if (curChar == 47)
jjAddStates(0, 1);
else if (curChar == 45)
jjCheckNAdd(0);
else if (curChar == 62)
{
if (kind > 7)
kind = 7;
}
else if (curChar == 61)
jjCheckNAdd(0);
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 0:
if (curChar == 62 && kind > 7)
kind = 7;
break;
case 2:
if (curChar == 62 && kind > 7)
kind = 7;
break;
case 3:
if (curChar == 45)
jjCheckNAdd(0);
break;
case 4:
if ((0x2400L & l) != 0L && kind > 8)
kind = 8;
break;
case 5:
if (curChar == 10 && kind > 8)
kind = 8;
break;
case 6:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 9:
if (curChar == 47)
jjAddStates(0, 1);
break;
case 10:
if (curChar == 47)
jjCheckNAddStates(2, 4);
break;
case 11:
if ((0xffffffffffffdbffL & l) != 0L)
jjCheckNAddStates(2, 4);
break;
case 12:
if ((0x2400L & l) != 0L && kind > 4)
kind = 4;
break;
case 13:
if (curChar == 10 && kind > 4)
kind = 4;
break;
case 14:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 13;
break;
case 15:
if (curChar == 42)
jjCheckNAddTwoStates(16, 17);
break;
case 16:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(16, 17);
break;
case 17:
if (curChar == 42)
jjAddStates(5, 6);
break;
case 18:
if ((0xffff7fffffffffffL & l) != 0L)
jjCheckNAddTwoStates(19, 17);
break;
case 19:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(19, 17);
break;
case 20:
if (curChar != 47)
break;
if (kind > 5)
kind = 5;
jjCheckNAddTwoStates(21, 23);
break;
case 21:
if ((0x2400L & l) == 0L)
break;
if (kind > 5)
kind = 5;
jjCheckNAddTwoStates(21, 23);
break;
case 22:
if (curChar != 10)
break;
if (kind > 5)
kind = 5;
jjCheckNAddTwoStates(21, 23);
break;
case 23:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 22;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 1:
if ((0x7fffffeL & l) != 0L)
{
if (kind > 11)
kind = 11;
}
else if ((0x7fffffe00000000L & l) != 0L)
{
if (kind > 9)
kind = 9;
jjCheckNAdd(7);
}
break;
case 7:
if ((0x7fffffe00000000L & l) == 0L)
break;
if (kind > 9)
kind = 9;
jjCheckNAdd(7);
break;
case 8:
if ((0x7fffffeL & l) != 0L && kind > 11)
kind = 11;
break;
case 11:
jjAddStates(2, 4);
break;
case 16:
jjCheckNAddTwoStates(16, 17);
break;
case 18:
case 19:
jjCheckNAddTwoStates(19, 17);
break;
default : break;
}
} while(i != startsAt);
}
else
{
int i2 = (curChar & 0xff) >> 6;
long l2 = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 11:
if ((jjbitVec0[i2] & l2) != 0L)
jjAddStates(2, 4);
break;
case 16:
if ((jjbitVec0[i2] & l2) != 0L)
jjCheckNAddTwoStates(16, 17);
break;
case 18:
case 19:
if ((jjbitVec0[i2] & l2) != 0L)
jjCheckNAddTwoStates(19, 17);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 24 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
static final int[] jjnextStates = { 10, 15, 11, 12, 14, 18, 20, };
public static final String[] jjstrLiteralImages = {
"", null, null, null, null, null, "\56", null, null, null, null, null, };
public static final String[] lexStateNames = {
"DEFAULT",
};
static final long[] jjtoToken = { 0xbc1L, };
static final long[] jjtoSkip = { 0x3eL, };
static protected SimpleCharStream input_stream;
static private final int[] jjrounds = new int[24];
static private final int[] jjstateSet = new int[48];
static protected char curChar;
public MarkovTokenManager(SimpleCharStream stream){
if (input_stream != null)
throw new TokenMgrError("ERROR: Second call to constructor of static lexer. You must use ReInit() to initialize the static variables.", TokenMgrError.STATIC_LEXER_ERROR);
input_stream = stream;
}
public MarkovTokenManager(SimpleCharStream stream, int lexState){
this(stream);
SwitchTo(lexState);
}
static public void ReInit(SimpleCharStream stream)
{
jjmatchedPos = jjnewStateCnt = 0;
curLexState = defaultLexState;
input_stream = stream;
ReInitRounds();
}
static private final void ReInitRounds()
{
int i;
jjround = 0x80000001;
for (i = 24; i-- > 0;)
jjrounds[i] = 0x80000000;
}
static public void ReInit(SimpleCharStream stream, int lexState)
{
ReInit(stream);
SwitchTo(lexState);
}
static public void SwitchTo(int lexState)
{
if (lexState >= 1 || lexState < 0)
throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE);
else
curLexState = lexState;
}
static protected Token jjFillToken()
{
Token t = Token.newToken(jjmatchedKind);
t.kind = jjmatchedKind;
String im = jjstrLiteralImages[jjmatchedKind];
t.image = (im == null) ? input_stream.GetImage() : im;
t.beginLine = input_stream.getBeginLine();
t.beginColumn = input_stream.getBeginColumn();
t.endLine = input_stream.getEndLine();
t.endColumn = input_stream.getEndColumn();
return t;
}
static int curLexState = 0;
static int defaultLexState = 0;
static int jjnewStateCnt;
static int jjround;
static int jjmatchedPos;
static int jjmatchedKind;
public static Token getNextToken()
{
int kind;
Token specialToken = null;
Token matchedToken;
int curPos = 0;
EOFLoop : for (;;)
{
try
{
curChar = input_stream.BeginToken();
}
catch(java.io.IOException e)
{
jjmatchedKind = 0;
matchedToken = jjFillToken();
return matchedToken;
}
try { input_stream.backup(0);
while (curChar <= 32 && (0x100000200L & (1L << curChar)) != 0L)
curChar = input_stream.BeginToken();
}
catch (java.io.IOException e1) { continue EOFLoop; }
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_0();
if (jjmatchedKind != 0x7fffffff)
{
if (jjmatchedPos + 1 < curPos)
input_stream.backup(curPos - jjmatchedPos - 1);
if ((jjtoToken[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
matchedToken = jjFillToken();
return matchedToken;
}
else
{
continue EOFLoop;
}
}
int error_line = input_stream.getEndLine();
int error_column = input_stream.getEndColumn();
String error_after = null;
boolean EOFSeen = false;
try { input_stream.readChar(); input_stream.backup(1); }
catch (java.io.IOException e1) {
EOFSeen = true;
error_after = curPos <= 1 ? "" : input_stream.GetImage();
if (curChar == '\n' || curChar == '\r') {
error_line++;
error_column = 0;
}
else
error_column++;
}
if (!EOFSeen) {
input_stream.backup(1);
error_after = curPos <= 1 ? "" : input_stream.GetImage();
}
throw new TokenMgrError(EOFSeen, curLexState, error_line, error_column, error_after, curChar, TokenMgrError.LEXICAL_ERROR);
}
}
}
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?