Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
juzu.impl.common.JSONParserTokenManager Maven / Gradle / Ivy
/* Generated By:JavaCC: Do not edit this line. JSONParserTokenManager.java */
package juzu.impl.common;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
/** Token Manager. */
public class JSONParserTokenManager implements JSONParserConstants
{
/** Debug output. */
public java.io.PrintStream debugStream = System.out;
/** Set debug output. */
public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }
private final int jjStopStringLiteralDfa_0(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x1c00L) != 0L)
{
jjmatchedKind = 32;
return 29;
}
if ((active0 & 0x80000L) != 0L)
return 71;
if ((active0 & 0x200000L) != 0L)
return 43;
if ((active0 & 0x100020L) != 0L)
return 29;
return -1;
case 1:
if ((active0 & 0x1c00L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 1;
return 29;
}
return -1;
case 2:
if ((active0 & 0x1c00L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 2;
return 29;
}
return -1;
case 3:
if ((active0 & 0x800L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 3;
return 29;
}
if ((active0 & 0x1400L) != 0L)
return 29;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_0(int pos, long active0)
{
return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1);
}
private int jjStopAtPos(int pos, int kind)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
return pos + 1;
}
private int jjMoveStringLiteralDfa0_0()
{
switch(curChar)
{
case 12:
return jjStartNfaWithStates_0(0, 5, 29);
case 43:
return jjStartNfaWithStates_0(0, 20, 29);
case 44:
return jjStopAtPos(0, 17);
case 45:
return jjStartNfaWithStates_0(0, 21, 43);
case 46:
return jjStartNfaWithStates_0(0, 19, 71);
case 58:
return jjStopAtPos(0, 18);
case 91:
return jjStopAtPos(0, 15);
case 93:
return jjStopAtPos(0, 16);
case 102:
return jjMoveStringLiteralDfa1_0(0x800L);
case 110:
return jjMoveStringLiteralDfa1_0(0x1000L);
case 116:
return jjMoveStringLiteralDfa1_0(0x400L);
case 123:
return jjStopAtPos(0, 13);
case 125:
return jjStopAtPos(0, 14);
default :
return jjMoveNfa_0(0, 0);
}
}
private int jjMoveStringLiteralDfa1_0(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(0, active0);
return 1;
}
switch(curChar)
{
case 97:
return jjMoveStringLiteralDfa2_0(active0, 0x800L);
case 114:
return jjMoveStringLiteralDfa2_0(active0, 0x400L);
case 117:
return jjMoveStringLiteralDfa2_0(active0, 0x1000L);
default :
break;
}
return jjStartNfa_0(0, active0);
}
private int jjMoveStringLiteralDfa2_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(1, active0);
return 2;
}
switch(curChar)
{
case 108:
return jjMoveStringLiteralDfa3_0(active0, 0x1800L);
case 117:
return jjMoveStringLiteralDfa3_0(active0, 0x400L);
default :
break;
}
return jjStartNfa_0(1, active0);
}
private int jjMoveStringLiteralDfa3_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(1, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(2, active0);
return 3;
}
switch(curChar)
{
case 101:
if ((active0 & 0x400L) != 0L)
return jjStartNfaWithStates_0(3, 10, 29);
break;
case 108:
if ((active0 & 0x1000L) != 0L)
return jjStartNfaWithStates_0(3, 12, 29);
break;
case 115:
return jjMoveStringLiteralDfa4_0(active0, 0x800L);
default :
break;
}
return jjStartNfa_0(2, active0);
}
private int jjMoveStringLiteralDfa4_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(2, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(3, active0);
return 4;
}
switch(curChar)
{
case 101:
if ((active0 & 0x800L) != 0L)
return jjStartNfaWithStates_0(4, 11, 29);
break;
default :
break;
}
return jjStartNfa_0(3, active0);
}
private 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 final long[] jjbitVec0 = {
0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
private int jjMoveNfa_0(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 71;
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 71:
if ((0xfbffef7affffd9ffL & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAdd(29);
}
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 27)
kind = 27;
jjCheckNAdd(15);
}
break;
case 43:
if ((0xfbffef7affffd9ffL & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAdd(29);
}
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 26)
kind = 26;
}
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAdd(58);
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAdd(52);
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAdd(47);
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 25)
kind = 25;
}
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAdd(67);
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAdd(64);
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAdd(56);
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAdd(50);
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAdd(45);
break;
case 0:
if ((0xfbffef7affffd9ffL & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAdd(29);
}
else if (curChar == 34)
jjCheckNAddStates(0, 2);
else if (curChar == 39)
jjCheckNAddStates(3, 5);
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 25)
kind = 25;
jjCheckNAddStates(6, 9);
}
else if (curChar == 45)
jjAddStates(10, 19);
else if (curChar == 47)
jjAddStates(20, 21);
else if (curChar == 46)
jjCheckNAdd(15);
else if (curChar == 60)
jjstateSet[jjnewStateCnt++] = 12;
else if (curChar == 35)
jjCheckNAddStates(22, 24);
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAddStates(25, 29);
break;
case 1:
if ((0xffffffffffffdbffL & l) != 0L)
jjCheckNAddStates(22, 24);
break;
case 2:
if ((0x2400L & l) != 0L && kind > 7)
kind = 7;
break;
case 3:
if (curChar == 10 && kind > 7)
kind = 7;
break;
case 4:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 3;
break;
case 5:
if (curChar == 45)
jjCheckNAddTwoStates(6, 7);
break;
case 6:
if ((0xffffdfffffffffffL & l) != 0L)
jjCheckNAddTwoStates(6, 7);
break;
case 7:
if (curChar == 45)
jjCheckNAddStates(30, 32);
break;
case 8:
if ((0xbfffdfffffffffffL & l) != 0L)
jjCheckNAddTwoStates(9, 7);
break;
case 9:
if ((0xffffdfffffffffffL & l) != 0L)
jjCheckNAddTwoStates(9, 7);
break;
case 10:
if (curChar == 62 && kind > 9)
kind = 9;
break;
case 11:
if (curChar == 45)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 12:
if (curChar == 33)
jjstateSet[jjnewStateCnt++] = 11;
break;
case 13:
if (curChar == 60)
jjstateSet[jjnewStateCnt++] = 12;
break;
case 14:
if (curChar == 46)
jjCheckNAdd(15);
break;
case 15:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 27)
kind = 27;
jjCheckNAdd(15);
break;
case 17:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(18);
break;
case 18:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 28)
kind = 28;
jjCheckNAdd(18);
break;
case 19:
case 21:
if (curChar == 39)
jjCheckNAddStates(3, 5);
break;
case 20:
if ((0xffffff7fffffffffL & l) != 0L)
jjCheckNAddStates(3, 5);
break;
case 23:
if (curChar == 39 && kind > 30)
kind = 30;
break;
case 24:
case 26:
if (curChar == 34)
jjCheckNAddStates(0, 2);
break;
case 25:
if ((0xfffffffbffffffffL & l) != 0L)
jjCheckNAddStates(0, 2);
break;
case 28:
if (curChar == 34 && kind > 31)
kind = 31;
break;
case 29:
if ((0xfbffef7affffd9ffL & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAdd(29);
break;
case 30:
if (curChar == 47)
jjAddStates(20, 21);
break;
case 31:
if (curChar == 47)
jjCheckNAddStates(33, 35);
break;
case 32:
if ((0xffffffffffffdbffL & l) != 0L)
jjCheckNAddStates(33, 35);
break;
case 33:
if ((0x2400L & l) != 0L && kind > 6)
kind = 6;
break;
case 34:
if (curChar == 10 && kind > 6)
kind = 6;
break;
case 35:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 34;
break;
case 36:
if (curChar == 42)
jjCheckNAddTwoStates(37, 38);
break;
case 37:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(37, 38);
break;
case 38:
if (curChar == 42)
jjCheckNAddStates(36, 38);
break;
case 39:
if ((0xffff7bffffffffffL & l) != 0L)
jjCheckNAddTwoStates(40, 38);
break;
case 40:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(40, 38);
break;
case 41:
if (curChar == 47 && kind > 8)
kind = 8;
break;
case 42:
if (curChar == 45)
jjAddStates(10, 19);
break;
case 44:
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAdd(45);
break;
case 45:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 25)
kind = 25;
jjCheckNAdd(45);
break;
case 46:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAdd(47);
break;
case 47:
if (curChar == 46)
jjCheckNAdd(48);
break;
case 48:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 25)
kind = 25;
jjCheckNAdd(48);
break;
case 49:
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAdd(50);
break;
case 50:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(50, 47);
break;
case 51:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAdd(52);
break;
case 53:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(54);
break;
case 54:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 25)
kind = 25;
jjCheckNAdd(54);
break;
case 55:
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAdd(56);
break;
case 56:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(56, 52);
break;
case 57:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAdd(58);
break;
case 58:
if (curChar == 46)
jjCheckNAdd(59);
break;
case 59:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(59, 60);
break;
case 61:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(62);
break;
case 62:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 25)
kind = 25;
jjCheckNAdd(62);
break;
case 63:
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAdd(64);
break;
case 64:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(64, 58);
break;
case 65:
if ((0x3ff000000000000L & l) != 0L && kind > 26)
kind = 26;
break;
case 66:
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAdd(67);
break;
case 67:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 26)
kind = 26;
jjCheckNAdd(67);
break;
case 68:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 25)
kind = 25;
jjCheckNAddStates(6, 9);
break;
case 69:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 29)
kind = 29;
jjCheckNAdd(69);
break;
case 70:
if ((0x3fe000000000000L & l) != 0L)
jjCheckNAddStates(25, 29);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 71:
case 29:
if ((0xd7ffffffd7ffffffL & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAdd(29);
break;
case 43:
if ((0xd7ffffffd7ffffffL & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAdd(29);
break;
case 0:
if ((0xd7ffffffd7ffffffL & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAdd(29);
}
if ((0x2000000020L & l) != 0L)
jjAddStates(39, 40);
break;
case 1:
jjAddStates(22, 24);
break;
case 6:
jjCheckNAddTwoStates(6, 7);
break;
case 8:
case 9:
jjCheckNAddTwoStates(9, 7);
break;
case 16:
if ((0x2000000020L & l) != 0L)
jjAddStates(39, 40);
break;
case 20:
jjAddStates(3, 5);
break;
case 22:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 21;
break;
case 25:
jjAddStates(0, 2);
break;
case 27:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 26;
break;
case 32:
jjAddStates(33, 35);
break;
case 37:
jjCheckNAddTwoStates(37, 38);
break;
case 39:
case 40:
jjCheckNAddTwoStates(40, 38);
break;
case 52:
if ((0x2000000020L & l) != 0L)
jjAddStates(41, 42);
break;
case 60:
if ((0x2000000020L & l) != 0L)
jjAddStates(43, 44);
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);
do
{
switch(jjstateSet[--i])
{
case 71:
case 29:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 32)
kind = 32;
jjCheckNAdd(29);
break;
case 43:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 32)
kind = 32;
jjCheckNAdd(29);
break;
case 0:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 32)
kind = 32;
jjCheckNAdd(29);
break;
case 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(22, 24);
break;
case 6:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(6, 7);
break;
case 8:
case 9:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(9, 7);
break;
case 20:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(3, 5);
break;
case 25:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(0, 2);
break;
case 32:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(33, 35);
break;
case 37:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(37, 38);
break;
case 39:
case 40:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(40, 38);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 71 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
static final int[] jjnextStates = {
25, 27, 28, 20, 22, 23, 47, 52, 58, 69, 43, 44, 46, 49, 51, 55,
57, 63, 65, 66, 31, 36, 1, 2, 4, 45, 50, 56, 64, 67, 7, 8,
10, 32, 33, 35, 38, 39, 41, 17, 18, 53, 54, 61, 62,
};
private static final boolean jjCanMove_0(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 0:
return ((jjbitVec2[i2] & l2) != 0L);
default :
if ((jjbitVec0[i1] & l1) != 0L)
return true;
return false;
}
}
/** Token literal values. */
public static final String[] jjstrLiteralImages = {
"", null, null, null, null, null, null, null, null, null, "\164\162\165\145",
"\146\141\154\163\145", "\156\165\154\154", "\173", "\175", "\133", "\135", "\54", "\72", "\56",
"\53", "\55", null, null, null, null, null, null, null, null, null, null, null, };
/** Lexer state names. */
public static final String[] lexStateNames = {
"DEFAULT",
};
static final long[] jjtoToken = {
0x1fe3ffc01L,
};
static final long[] jjtoSkip = {
0x3feL,
};
protected JavaCharStream input_stream;
private final int[] jjrounds = new int[71];
private final int[] jjstateSet = new int[142];
protected char curChar;
/** Constructor. */
public JSONParserTokenManager(JavaCharStream stream){
if (JavaCharStream.staticFlag)
throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");
input_stream = stream;
}
/** Constructor. */
public JSONParserTokenManager(JavaCharStream stream, int lexState){
this(stream);
SwitchTo(lexState);
}
/** Reinitialise parser. */
public void ReInit(JavaCharStream stream)
{
jjmatchedPos = jjnewStateCnt = 0;
curLexState = defaultLexState;
input_stream = stream;
ReInitRounds();
}
private void ReInitRounds()
{
int i;
jjround = 0x80000001;
for (i = 71; i-- > 0;)
jjrounds[i] = 0x80000000;
}
/** Reinitialise parser. */
public void ReInit(JavaCharStream stream, int lexState)
{
ReInit(stream);
SwitchTo(lexState);
}
/** Switch to specified lex state. */
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;
}
protected Token jjFillToken()
{
final Token t;
final String curTokenImage;
final int beginLine;
final int endLine;
final int beginColumn;
final int endColumn;
String im = jjstrLiteralImages[jjmatchedKind];
curTokenImage = (im == null) ? input_stream.GetImage() : im;
beginLine = input_stream.getBeginLine();
beginColumn = input_stream.getBeginColumn();
endLine = input_stream.getEndLine();
endColumn = input_stream.getEndColumn();
t = Token.newToken(jjmatchedKind, curTokenImage);
t.beginLine = beginLine;
t.endLine = endLine;
t.beginColumn = beginColumn;
t.endColumn = endColumn;
return t;
}
int curLexState = 0;
int defaultLexState = 0;
int jjnewStateCnt;
int jjround;
int jjmatchedPos;
int jjmatchedKind;
/** Get the next Token. */
public Token getNextToken()
{
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 && (0x100002600L & (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);
}
}
private void jjCheckNAdd(int state)
{
if (jjrounds[state] != jjround)
{
jjstateSet[jjnewStateCnt++] = state;
jjrounds[state] = jjround;
}
}
private void jjAddStates(int start, int end)
{
do {
jjstateSet[jjnewStateCnt++] = jjnextStates[start];
} while (start++ != end);
}
private void jjCheckNAddTwoStates(int state1, int state2)
{
jjCheckNAdd(state1);
jjCheckNAdd(state2);
}
private void jjCheckNAddStates(int start, int end)
{
do {
jjCheckNAdd(jjnextStates[start]);
} while (start++ != end);
}
}
