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.
net.sourceforge.pmd.lang.velocity.ast.VtlParserImplTokenManager Maven / Gradle / Ivy
/* Generated By:JJTree&JavaCC: Do not edit this line. VtlParserImplTokenManager.java */
package net.sourceforge.pmd.lang.velocity.ast;
import static net.sourceforge.pmd.lang.velocity.ast.VtlTokenKinds.*;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import org.apache.commons.lang3.StringUtils;
import net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken;
/** net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken Manager. */
@net.sourceforge.pmd.annotation.Generated("org.javacc.javacc")
class VtlParserImplTokenManager extends net.sourceforge.pmd.lang.ast.impl.javacc.AbstractTokenManager
{
private int fileDepth = 0;
private int lparen = 0;
private int rparen = 0;
List stateStack = new ArrayList(50);
public boolean debugPrint = false;
private boolean inReference;
public boolean inDirective;
private boolean inComment;
public boolean inSet;
/**
* pushes the current state onto the 'state stack',
* and maintains the parens counts
* public because we need it in PD & VM handling
*
* @return boolean : success. It can fail if the state machine
* gets messed up (do don't mess it up :)
*/
public boolean stateStackPop()
{
ParserState s;
try
{
s = (ParserState) stateStack.remove(stateStack.size() - 1); // stack.pop
}
catch(IndexOutOfBoundsException e)
{
// empty stack
lparen=0;
SwitchTo(DEFAULT);
return false;
}
if( debugPrint )
System.out.println(
" stack pop (" + stateStack.size() + ") : lparen=" +
s.lparen +
" newstate=" + s.lexstate );
lparen = s.lparen;
rparen = s.rparen;
SwitchTo(s.lexstate);
return true;
}
/**
* pops a state off the stack, and restores paren counts
*
* @return boolean : success of operation
*/
public boolean stateStackPush()
{
if( debugPrint )
System.out.println(" (" + stateStack.size() + ") pushing cur state : " +
curLexState );
ParserState s = new ParserState();
s.lparen = lparen;
s.rparen = rparen;
s.lexstate = curLexState;
lparen = 0;
stateStack.add(s); // stack.push
return true;
}
/**
* Clears all state variables, resets to
* start values, clears stateStack. Call
* before parsing.
*/
public void clearStateVars()
{
stateStack.clear();
lparen = 0;
rparen = 0;
inReference = false;
inDirective = false;
inComment = false;
inSet = false;
return;
}
/**
* Holds the state of the parsing process.
*/
private static class ParserState
{
int lparen;
int rparen;
int lexstate;
}
/**
* handles the dropdown logic when encountering a RPAREN
*/
private void RPARENHandler()
{
/*
* Ultimately, we want to drop down to the state below
* the one that has an open (if we hit bottom (DEFAULT),
* that's fine. It's just text schmoo.
*/
boolean closed = false;
if (inComment)
closed = true;
while( !closed )
{
/*
* look at current state. If we haven't seen a lparen
* in this state then we drop a state, because this
* lparen clearly closes our state
*/
if( lparen > 0)
{
/*
* if rparen + 1 == lparen, then this state is closed.
* Otherwise, increment and keep parsing
*/
if( lparen == rparen + 1)
{
stateStackPop();
}
else
{
rparen++;
}
closed = true;
}
else
{
/*
* now, drop a state
*/
if(!stateStackPop())
break;
}
}
}
/** 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_3(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x2000000000L) != 0L)
return 105;
if ((active0 & 0x200L) != 0L)
return 69;
if ((active0 & 0xc00000080L) != 0L)
{
jjmatchedKind = 63;
return 67;
}
if ((active0 & 0x40L) != 0L)
return 62;
if ((active0 & 0x8000000000000L) != 0L)
return 54;
if ((active0 & 0x740000L) != 0L)
return 7;
return -1;
case 1:
if ((active0 & 0x80L) != 0L)
return 67;
if ((active0 & 0x100000L) != 0L)
return 5;
if ((active0 & 0xc00000000L) != 0L)
{
jjmatchedKind = 63;
jjmatchedPos = 1;
return 67;
}
return -1;
case 2:
if ((active0 & 0xc00000000L) != 0L)
{
jjmatchedKind = 63;
jjmatchedPos = 2;
return 67;
}
return -1;
case 3:
if ((active0 & 0x400000000L) != 0L)
return 67;
if ((active0 & 0x800000000L) != 0L)
{
jjmatchedKind = 63;
jjmatchedPos = 3;
return 67;
}
return -1;
default :
return -1;
}
}
private final int jjStartNfa_3(int pos, long active0)
{
return jjMoveNfa_3(jjStopStringLiteralDfa_3(pos, active0), pos + 1);
}
private int jjStopAtPos(int pos, int kind)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
return pos + 1;
}
private int jjMoveStringLiteralDfa0_3()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_3(0x540000L);
case 37:
return jjStopAtPos(0, 41);
case 40:
return jjStopAtPos(0, 11);
case 42:
return jjStopAtPos(0, 39);
case 43:
return jjStopAtPos(0, 38);
case 44:
return jjStopAtPos(0, 5);
case 45:
return jjStartNfaWithStates_3(0, 37, 105);
case 46:
return jjMoveStringLiteralDfa1_3(0x40L);
case 47:
return jjStopAtPos(0, 40);
case 58:
return jjStopAtPos(0, 8);
case 61:
return jjStartNfaWithStates_3(0, 51, 54);
case 91:
return jjStopAtPos(0, 3);
case 93:
return jjStopAtPos(0, 4);
case 70:
case 102:
return jjMoveStringLiteralDfa1_3(0x800000000L);
case 73:
case 105:
return jjMoveStringLiteralDfa1_3(0x80L);
case 84:
case 116:
return jjMoveStringLiteralDfa1_3(0x400000000L);
case 123:
return jjStartNfaWithStates_3(0, 9, 69);
case 125:
return jjStopAtPos(0, 10);
default :
return jjMoveNfa_3(0, 0);
}
}
private int jjMoveStringLiteralDfa1_3(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_3(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x400000L) != 0L)
return jjStopAtPos(1, 22);
break;
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_3(1, 20, 5);
break;
case 46:
if ((active0 & 0x40L) != 0L)
return jjStopAtPos(1, 6);
break;
case 91:
return jjMoveStringLiteralDfa2_3(active0, 0x40000L);
case 65:
case 97:
return jjMoveStringLiteralDfa2_3(active0, 0x800000000L);
case 78:
case 110:
if ((active0 & 0x80L) != 0L)
return jjStartNfaWithStates_3(1, 7, 67);
break;
case 82:
case 114:
return jjMoveStringLiteralDfa2_3(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_3(0, active0);
}
private int jjMoveStringLiteralDfa2_3(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_3(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_3(1, active0);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
case 76:
case 108:
return jjMoveStringLiteralDfa3_3(active0, 0x800000000L);
case 85:
case 117:
return jjMoveStringLiteralDfa3_3(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_3(1, active0);
}
private int jjMoveStringLiteralDfa3_3(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_3(1, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_3(2, active0);
return 3;
}
switch(curChar)
{
case 69:
case 101:
if ((active0 & 0x400000000L) != 0L)
return jjStartNfaWithStates_3(3, 34, 67);
break;
case 83:
case 115:
return jjMoveStringLiteralDfa4_3(active0, 0x800000000L);
default :
break;
}
return jjStartNfa_3(2, active0);
}
private int jjMoveStringLiteralDfa4_3(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_3(2, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_3(3, active0);
return 4;
}
switch(curChar)
{
case 69:
case 101:
if ((active0 & 0x800000000L) != 0L)
return jjStartNfaWithStates_3(4, 35, 67);
break;
default :
break;
}
return jjStartNfa_3(3, active0);
}
private int jjStartNfaWithStates_3(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_3(state, pos + 1);
}
static final long[] jjbitVec0 = {
0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
private int jjMoveNfa_3(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 105;
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 105:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(100, 101);
else if (curChar == 46)
jjCheckNAdd(62);
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(94, 95);
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 58)
kind = 58;
jjCheckNAddTwoStates(91, 93);
}
break;
case 0:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 58)
kind = 58;
jjCheckNAddStates(0, 5);
}
else if ((0x100002600L & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAdd(9);
}
else if (curChar == 45)
jjCheckNAddStates(6, 9);
else if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(77, 78);
}
else if (curChar == 46)
jjCheckNAdd(62);
else if (curChar == 33)
{
if (kind > 50)
kind = 50;
}
else if (curChar == 61)
jjstateSet[jjnewStateCnt++] = 54;
else if (curChar == 62)
jjstateSet[jjnewStateCnt++] = 52;
else if (curChar == 60)
jjstateSet[jjnewStateCnt++] = 49;
else if (curChar == 38)
jjstateSet[jjnewStateCnt++] = 39;
else if (curChar == 39)
jjCheckNAddStates(10, 13);
else if (curChar == 34)
jjCheckNAddStates(14, 17);
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 7;
else if (curChar == 41)
{
if (kind > 12)
kind = 12;
jjCheckNAddStates(18, 20);
}
if ((0x2400L & l) != 0L)
{
if (kind > 36)
kind = 36;
}
else if (curChar == 33)
jjstateSet[jjnewStateCnt++] = 58;
else if (curChar == 62)
{
if (kind > 46)
kind = 46;
}
else if (curChar == 60)
{
if (kind > 44)
kind = 44;
}
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 37;
break;
case 1:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(18, 20);
break;
case 2:
if ((0x2400L & l) != 0L && kind > 12)
kind = 12;
break;
case 3:
if (curChar == 10 && kind > 12)
kind = 12;
break;
case 4:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 3;
break;
case 5:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 6:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
case 7:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 8:
if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if ((0x100002600L & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAdd(9);
break;
case 10:
case 12:
if (curChar == 34)
jjCheckNAddStates(14, 17);
break;
case 11:
if ((0xfffffffbffffffffL & l) != 0L)
jjCheckNAddStates(14, 17);
break;
case 13:
if (curChar == 34)
jjstateSet[jjnewStateCnt++] = 12;
break;
case 14:
if (curChar == 34 && kind > 33)
kind = 33;
break;
case 17:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(21, 25);
break;
case 18:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(14, 17);
break;
case 19:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 20;
break;
case 20:
if ((0xff000000000000L & l) != 0L)
jjCheckNAdd(18);
break;
case 22:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 23;
break;
case 23:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 24;
break;
case 24:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 25;
break;
case 25:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(14, 17);
break;
case 26:
if (curChar == 32)
jjAddStates(26, 27);
break;
case 27:
if (curChar == 10)
jjCheckNAddStates(14, 17);
break;
case 28:
case 30:
if (curChar == 39)
jjCheckNAddStates(10, 13);
break;
case 29:
if ((0xffffff7fffffffffL & l) != 0L)
jjCheckNAddStates(10, 13);
break;
case 31:
if (curChar == 39)
jjstateSet[jjnewStateCnt++] = 30;
break;
case 33:
if (curChar == 32)
jjAddStates(28, 29);
break;
case 34:
if (curChar == 10)
jjCheckNAddStates(10, 13);
break;
case 35:
if (curChar == 39 && kind > 33)
kind = 33;
break;
case 36:
if ((0x2400L & l) != 0L && kind > 36)
kind = 36;
break;
case 37:
if (curChar == 10 && kind > 36)
kind = 36;
break;
case 38:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 37;
break;
case 39:
if (curChar == 38 && kind > 42)
kind = 42;
break;
case 40:
if (curChar == 38)
jjstateSet[jjnewStateCnt++] = 39;
break;
case 48:
if (curChar == 60 && kind > 44)
kind = 44;
break;
case 49:
if (curChar == 61 && kind > 45)
kind = 45;
break;
case 50:
if (curChar == 60)
jjstateSet[jjnewStateCnt++] = 49;
break;
case 51:
if (curChar == 62 && kind > 46)
kind = 46;
break;
case 52:
if (curChar == 61 && kind > 47)
kind = 47;
break;
case 53:
if (curChar == 62)
jjstateSet[jjnewStateCnt++] = 52;
break;
case 54:
if (curChar == 61 && kind > 48)
kind = 48;
break;
case 55:
if (curChar == 61)
jjstateSet[jjnewStateCnt++] = 54;
break;
case 58:
if (curChar == 61 && kind > 49)
kind = 49;
break;
case 59:
if (curChar == 33)
jjstateSet[jjnewStateCnt++] = 58;
break;
case 60:
if (curChar == 33 && kind > 50)
kind = 50;
break;
case 61:
if (curChar == 46)
jjCheckNAdd(62);
break;
case 62:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(62, 63);
break;
case 64:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(65);
break;
case 65:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(65);
break;
case 67:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 63)
kind = 63;
jjstateSet[jjnewStateCnt++] = 67;
break;
case 70:
if ((0x3ff000000000000L & l) != 0L)
jjAddStates(30, 31);
break;
case 74:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 76:
if (curChar == 36)
jjCheckNAddTwoStates(77, 78);
break;
case 78:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 79:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(77, 78);
break;
case 90:
if (curChar == 45)
jjCheckNAddStates(6, 9);
break;
case 91:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 58)
kind = 58;
jjCheckNAddTwoStates(91, 93);
break;
case 92:
if (curChar == 46 && kind > 58)
kind = 58;
break;
case 93:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 92;
break;
case 94:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(94, 95);
break;
case 95:
if (curChar != 46)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(96, 97);
break;
case 96:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(96, 97);
break;
case 98:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(99);
break;
case 99:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(99);
break;
case 100:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(100, 101);
break;
case 102:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(103);
break;
case 103:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(103);
break;
case 104:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 58)
kind = 58;
jjCheckNAddStates(0, 5);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 0:
if ((0x7fffffe87ffffffL & l) != 0L)
{
if (kind > 63)
kind = 63;
jjCheckNAdd(67);
}
else if (curChar == 92)
jjCheckNAddStates(32, 35);
else if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 69;
else if (curChar == 124)
jjstateSet[jjnewStateCnt++] = 44;
if ((0x400000004000L & l) != 0L)
jjAddStates(36, 37);
else if ((0x8000000080L & l) != 0L)
jjAddStates(38, 39);
else if ((0x100000001000L & l) != 0L)
jjAddStates(40, 41);
else if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 56;
else if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 46;
else if ((0x200000002L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 42;
break;
case 6:
if (kind > 19)
kind = 19;
break;
case 11:
jjCheckNAddStates(14, 17);
break;
case 15:
if (curChar == 92)
jjAddStates(42, 47);
break;
case 16:
if ((0x14404400144044L & l) != 0L)
jjCheckNAddStates(14, 17);
break;
case 21:
if ((0x20000000200000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 22;
break;
case 22:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 23;
break;
case 23:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 24;
break;
case 24:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 25;
break;
case 25:
if ((0x7e0000007eL & l) != 0L)
jjCheckNAddStates(14, 17);
break;
case 29:
jjAddStates(10, 13);
break;
case 32:
if (curChar == 92)
jjAddStates(28, 29);
break;
case 41:
if ((0x1000000010L & l) != 0L && kind > 42)
kind = 42;
break;
case 42:
if ((0x400000004000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 41;
break;
case 43:
if ((0x200000002L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 42;
break;
case 44:
if (curChar == 124 && kind > 43)
kind = 43;
break;
case 45:
if (curChar == 124)
jjstateSet[jjnewStateCnt++] = 44;
break;
case 46:
if ((0x4000000040000L & l) != 0L && kind > 43)
kind = 43;
break;
case 47:
if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 46;
break;
case 56:
if ((0x2000000020000L & l) != 0L && kind > 48)
kind = 48;
break;
case 57:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 56;
break;
case 63:
if ((0x2000000020L & l) != 0L)
jjAddStates(48, 49);
break;
case 66:
case 67:
if ((0x7fffffe87ffffffL & l) == 0L)
break;
if (kind > 63)
kind = 63;
jjCheckNAdd(67);
break;
case 68:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 69;
break;
case 69:
if ((0x7fffffe87fffffeL & l) != 0L)
jjCheckNAddTwoStates(70, 71);
break;
case 70:
if ((0x7fffffe87ffffffL & l) != 0L)
jjCheckNAddTwoStates(70, 71);
break;
case 71:
if (curChar == 125 && kind > 64)
kind = 64;
break;
case 72:
if (curChar == 92)
jjCheckNAddStates(32, 35);
break;
case 73:
if (curChar == 92)
jjCheckNAddTwoStates(73, 74);
break;
case 75:
if (curChar == 92)
jjCheckNAddTwoStates(75, 76);
break;
case 77:
if (curChar == 92)
jjAddStates(50, 51);
break;
case 80:
if ((0x100000001000L & l) != 0L)
jjAddStates(40, 41);
break;
case 81:
if ((0x10000000100000L & l) != 0L && kind > 44)
kind = 44;
break;
case 82:
if ((0x2000000020L & l) != 0L && kind > 45)
kind = 45;
break;
case 83:
if ((0x8000000080L & l) != 0L)
jjAddStates(38, 39);
break;
case 84:
if ((0x10000000100000L & l) != 0L && kind > 46)
kind = 46;
break;
case 85:
if ((0x2000000020L & l) != 0L && kind > 47)
kind = 47;
break;
case 86:
if ((0x400000004000L & l) != 0L)
jjAddStates(36, 37);
break;
case 87:
if ((0x2000000020L & l) != 0L && kind > 49)
kind = 49;
break;
case 88:
if ((0x10000000100000L & l) != 0L && kind > 50)
kind = 50;
break;
case 89:
if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 88;
break;
case 97:
if ((0x2000000020L & l) != 0L)
jjAddStates(52, 53);
break;
case 101:
if ((0x2000000020L & l) != 0L)
jjAddStates(54, 55);
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 6:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
case 11:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(14, 17);
break;
case 29:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(10, 13);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 105 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_11(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x740000L) != 0L)
return 2;
return -1;
case 1:
if ((active0 & 0x100000L) != 0L)
return 0;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_11(int pos, long active0)
{
return jjMoveNfa_11(jjStopStringLiteralDfa_11(pos, active0), pos + 1);
}
private int jjMoveStringLiteralDfa0_11()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_11(0x540000L);
default :
return jjMoveNfa_11(3, 0);
}
}
private int jjMoveStringLiteralDfa1_11(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_11(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x400000L) != 0L)
return jjStopAtPos(1, 22);
break;
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_11(1, 20, 0);
break;
case 91:
return jjMoveStringLiteralDfa2_11(active0, 0x40000L);
default :
break;
}
return jjStartNfa_11(0, active0);
}
private int jjMoveStringLiteralDfa2_11(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_11(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_11(1, active0);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
default :
break;
}
return jjStartNfa_11(1, active0);
}
private int jjStartNfaWithStates_11(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_11(state, pos + 1);
}
private int jjMoveNfa_11(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 98;
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 3:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 58)
kind = 58;
jjCheckNAddStates(56, 61);
}
else if (curChar == 45)
jjCheckNAddStates(62, 65);
else if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(29, 30);
}
else if (curChar == 46)
jjCheckNAdd(14);
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 13:
if (curChar == 46)
jjCheckNAdd(14);
break;
case 14:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(14, 15);
break;
case 16:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(17);
break;
case 17:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(17);
break;
case 19:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 63)
kind = 63;
jjstateSet[jjnewStateCnt++] = 19;
break;
case 22:
if ((0x3ff000000000000L & l) != 0L)
jjAddStates(66, 67);
break;
case 26:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 28:
if (curChar == 36)
jjCheckNAddTwoStates(29, 30);
break;
case 30:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 31:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(29, 30);
break;
case 34:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(68, 70);
break;
case 35:
if ((0x2400L & l) != 0L && kind > 52)
kind = 52;
break;
case 36:
if (curChar == 10 && kind > 52)
kind = 52;
break;
case 37:
case 54:
if (curChar == 13)
jjCheckNAdd(36);
break;
case 45:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(71, 73);
break;
case 46:
if ((0x2400L & l) != 0L && kind > 56)
kind = 56;
break;
case 47:
if (curChar == 10 && kind > 56)
kind = 56;
break;
case 48:
case 78:
if (curChar == 13)
jjCheckNAdd(47);
break;
case 53:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(74, 76);
break;
case 77:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(77, 79);
break;
case 83:
if (curChar == 45)
jjCheckNAddStates(62, 65);
break;
case 84:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 58)
kind = 58;
jjCheckNAddTwoStates(84, 86);
break;
case 85:
if (curChar == 46 && kind > 58)
kind = 58;
break;
case 86:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 85;
break;
case 87:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(87, 88);
break;
case 88:
if (curChar != 46)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(89, 90);
break;
case 89:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(89, 90);
break;
case 91:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(92);
break;
case 92:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(92);
break;
case 93:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(93, 94);
break;
case 95:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(96);
break;
case 96:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(96);
break;
case 97:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 58)
kind = 58;
jjCheckNAddStates(56, 61);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 3:
if ((0x7fffffe87ffffffL & l) != 0L)
{
if (kind > 63)
kind = 63;
jjCheckNAdd(19);
}
else if (curChar == 123)
jjAddStates(80, 84);
else if (curChar == 92)
jjCheckNAddStates(85, 88);
if ((0x2000000020L & l) != 0L)
jjAddStates(89, 91);
else if ((0x20000000200L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 11;
else if ((0x4000000040L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 9;
else if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 21;
break;
case 1:
if (kind > 19)
kind = 19;
break;
case 4:
if ((0x10000000100L & l) != 0L && kind > 53)
kind = 53;
break;
case 5:
if ((0x800000008L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 6:
if ((0x200000002L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 7:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 8:
if ((0x4000000040000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 10:
if ((0x4000000040L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 11:
if ((0x4000000040L & l) != 0L && kind > 54)
kind = 54;
break;
case 12:
if ((0x20000000200L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 11;
break;
case 15:
if ((0x2000000020L & l) != 0L)
jjAddStates(92, 93);
break;
case 18:
case 19:
if ((0x7fffffe87ffffffL & l) == 0L)
break;
if (kind > 63)
kind = 63;
jjCheckNAdd(19);
break;
case 20:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 21;
break;
case 21:
if ((0x7fffffe87fffffeL & l) != 0L)
jjCheckNAddTwoStates(22, 23);
break;
case 22:
if ((0x7fffffe87ffffffL & l) != 0L)
jjCheckNAddTwoStates(22, 23);
break;
case 23:
if (curChar == 125 && kind > 64)
kind = 64;
break;
case 24:
if (curChar == 92)
jjCheckNAddStates(85, 88);
break;
case 25:
if (curChar == 92)
jjCheckNAddTwoStates(25, 26);
break;
case 27:
if (curChar == 92)
jjCheckNAddTwoStates(27, 28);
break;
case 29:
if (curChar == 92)
jjAddStates(94, 95);
break;
case 32:
if ((0x2000000020L & l) != 0L)
jjAddStates(89, 91);
break;
case 33:
if ((0x1000000010L & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAddStates(68, 70);
break;
case 38:
if ((0x400000004000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 33;
break;
case 39:
if ((0x4000000040L & l) != 0L && kind > 55)
kind = 55;
break;
case 40:
if ((0x20000000200L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 39;
break;
case 41:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 40;
break;
case 42:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 41;
break;
case 43:
if ((0x100000001000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 42;
break;
case 44:
if ((0x2000000020L & l) == 0L)
break;
if (kind > 56)
kind = 56;
jjCheckNAddStates(71, 73);
break;
case 49:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 44;
break;
case 50:
if ((0x100000001000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 49;
break;
case 51:
if (curChar == 123)
jjAddStates(80, 84);
break;
case 52:
if (curChar != 125)
break;
if (kind > 52)
kind = 52;
jjCheckNAddStates(74, 76);
break;
case 55:
if ((0x1000000010L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 52;
break;
case 56:
if ((0x400000004000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 55;
break;
case 57:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 56;
break;
case 58:
if (curChar == 125 && kind > 53)
kind = 53;
break;
case 59:
if ((0x10000000100L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 58;
break;
case 60:
if ((0x800000008L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 59;
break;
case 61:
if ((0x200000002L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 60;
break;
case 62:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 61;
break;
case 63:
if ((0x4000000040000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 62;
break;
case 64:
if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 63;
break;
case 65:
if ((0x4000000040L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 64;
break;
case 66:
if (curChar == 125 && kind > 54)
kind = 54;
break;
case 67:
if ((0x4000000040L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 66;
break;
case 68:
if ((0x20000000200L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 67;
break;
case 69:
if (curChar == 125 && kind > 55)
kind = 55;
break;
case 70:
if ((0x4000000040L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 69;
break;
case 71:
if ((0x20000000200L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 70;
break;
case 72:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 71;
break;
case 73:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 72;
break;
case 74:
if ((0x100000001000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 73;
break;
case 75:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 74;
break;
case 76:
if (curChar != 125)
break;
if (kind > 56)
kind = 56;
jjCheckNAddStates(77, 79);
break;
case 79:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 76;
break;
case 80:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 79;
break;
case 81:
if ((0x100000001000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 80;
break;
case 82:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 81;
break;
case 90:
if ((0x2000000020L & l) != 0L)
jjAddStates(96, 97);
break;
case 94:
if ((0x2000000020L & l) != 0L)
jjAddStates(98, 99);
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 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 98 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_8(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x340000L) != 0L)
return 2;
return -1;
case 1:
if ((active0 & 0x100000L) != 0L)
return 0;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_8(int pos, long active0)
{
return jjMoveNfa_8(jjStopStringLiteralDfa_8(pos, active0), pos + 1);
}
private int jjMoveStringLiteralDfa0_8()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_8(0x140000L);
case 42:
return jjMoveStringLiteralDfa1_8(0x10000000L);
default :
return jjMoveNfa_8(3, 0);
}
}
private int jjMoveStringLiteralDfa1_8(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_8(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x10000000L) != 0L)
return jjStopAtPos(1, 28);
break;
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_8(1, 20, 0);
break;
case 91:
return jjMoveStringLiteralDfa2_8(active0, 0x40000L);
default :
break;
}
return jjStartNfa_8(0, active0);
}
private int jjMoveStringLiteralDfa2_8(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_8(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_8(1, active0);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
default :
break;
}
return jjStartNfa_8(1, active0);
}
private int jjStartNfaWithStates_8(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_8(state, pos + 1);
}
private int jjMoveNfa_8(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 12;
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 3:
if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(9, 10);
}
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 6:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 8:
if (curChar == 36)
jjCheckNAddTwoStates(9, 10);
break;
case 10:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 11:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(9, 10);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 92)
jjCheckNAddStates(100, 103);
break;
case 1:
if (kind > 19)
kind = 19;
break;
case 5:
if (curChar == 92)
jjCheckNAddTwoStates(5, 6);
break;
case 7:
if (curChar == 92)
jjCheckNAddTwoStates(7, 8);
break;
case 9:
if (curChar == 92)
jjAddStates(104, 105);
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 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 12 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_6(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x340000L) != 0L)
return 2;
return -1;
case 1:
if ((active0 & 0x100000L) != 0L)
return 0;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_6(int pos, long active0)
{
return jjMoveNfa_6(jjStopStringLiteralDfa_6(pos, active0), pos + 1);
}
private int jjMoveStringLiteralDfa0_6()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_6(0x140000L);
default :
return jjMoveNfa_6(3, 0);
}
}
private int jjMoveStringLiteralDfa1_6(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_6(0, active0);
return 1;
}
switch(curChar)
{
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_6(1, 20, 0);
break;
case 91:
return jjMoveStringLiteralDfa2_6(active0, 0x40000L);
default :
break;
}
return jjStartNfa_6(0, active0);
}
private int jjMoveStringLiteralDfa2_6(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_6(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_6(1, active0);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
default :
break;
}
return jjStartNfa_6(1, active0);
}
private int jjStartNfaWithStates_6(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_6(state, pos + 1);
}
private int jjMoveNfa_6(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 12;
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 3:
if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(9, 10);
}
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 6:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 8:
if (curChar == 36)
jjCheckNAddTwoStates(9, 10);
break;
case 10:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 11:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(9, 10);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 92)
jjCheckNAddStates(100, 103);
break;
case 1:
if (kind > 19)
kind = 19;
break;
case 5:
if (curChar == 92)
jjCheckNAddTwoStates(5, 6);
break;
case 7:
if (curChar == 92)
jjCheckNAddTwoStates(7, 8);
break;
case 9:
if (curChar == 92)
jjAddStates(104, 105);
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 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 12 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_5(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x1800000L) != 0L)
return 20;
if ((active0 & 0x740000L) != 0L)
return 39;
return -1;
case 1:
if ((active0 & 0x800000L) != 0L)
return 40;
if ((active0 & 0x100000L) != 0L)
return 37;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_5(int pos, long active0)
{
return jjMoveNfa_5(jjStopStringLiteralDfa_5(pos, active0), pos + 1);
}
private int jjMoveStringLiteralDfa0_5()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_5(0x540000L);
case 92:
jjmatchedKind = 24;
return jjMoveStringLiteralDfa1_5(0x800000L);
default :
return jjMoveNfa_5(13, 0);
}
}
private int jjMoveStringLiteralDfa1_5(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_5(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x400000L) != 0L)
return jjStopAtPos(1, 22);
break;
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_5(1, 20, 37);
break;
case 91:
return jjMoveStringLiteralDfa2_5(active0, 0x40000L);
case 92:
if ((active0 & 0x800000L) != 0L)
return jjStartNfaWithStates_5(1, 23, 40);
break;
default :
break;
}
return jjStartNfa_5(0, active0);
}
private int jjMoveStringLiteralDfa2_5(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_5(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_5(1, active0);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
default :
break;
}
return jjStartNfa_5(1, active0);
}
private int jjStartNfaWithStates_5(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_5(state, pos + 1);
}
private int jjMoveNfa_5(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 40;
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 39:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 37;
break;
case 40:
if (curChar == 36)
jjCheckNAddTwoStates(33, 34);
if (curChar == 36)
{
if (kind > 16)
kind = 16;
}
break;
case 13:
if ((0xffffffe7ffffffffL & l) != 0L)
{
if (kind > 25)
kind = 25;
jjCheckNAdd(12);
}
else if (curChar == 35)
jjCheckNAddStates(106, 108);
else if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(33, 34);
}
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 1);
else if (curChar == 36)
jjCheckNAddStates(109, 112);
break;
case 20:
if (curChar == 36)
jjCheckNAddTwoStates(33, 34);
else if (curChar == 35)
jjAddStates(113, 114);
if (curChar == 36)
{
if (kind > 16)
kind = 16;
}
break;
case 0:
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 1);
break;
case 1:
if (curChar == 35)
jjCheckNAddTwoStates(6, 11);
break;
case 3:
if (curChar == 32)
jjAddStates(115, 116);
break;
case 4:
if (curChar == 40 && kind > 15)
kind = 15;
break;
case 12:
if ((0xffffffe7ffffffffL & l) == 0L)
break;
if (kind > 25)
kind = 25;
jjCheckNAdd(12);
break;
case 15:
case 16:
if (curChar == 33)
jjCheckNAdd(14);
break;
case 18:
if (curChar == 46 && kind > 74)
kind = 74;
break;
case 21:
if (curChar == 35)
jjAddStates(113, 114);
break;
case 23:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 14)
kind = 14;
jjstateSet[jjnewStateCnt++] = 23;
break;
case 26:
if ((0x3ff000000000000L & l) != 0L)
jjAddStates(26, 27);
break;
case 30:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 32:
if (curChar == 36)
jjCheckNAddTwoStates(33, 34);
break;
case 34:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 35:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(33, 34);
break;
case 36:
if (curChar == 35)
jjCheckNAddStates(106, 108);
break;
case 37:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 38;
break;
case 38:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 39:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 5;
else if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 40:
if (curChar == 92)
jjAddStates(117, 118);
if (curChar == 92)
jjCheckNAddTwoStates(31, 32);
if (curChar == 92)
jjCheckNAddTwoStates(29, 30);
break;
case 13:
if ((0xffffffffefffffffL & l) != 0L)
{
if (kind > 25)
kind = 25;
jjCheckNAdd(12);
}
else if (curChar == 92)
jjCheckNAddStates(119, 122);
if (curChar == 92)
jjAddStates(117, 118);
break;
case 20:
if (curChar == 92)
jjCheckNAddTwoStates(31, 32);
if (curChar == 92)
jjCheckNAddTwoStates(29, 30);
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 19;
break;
case 2:
if ((0x10000000100000L & l) != 0L)
jjCheckNAddTwoStates(3, 4);
break;
case 5:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 6:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 7:
if (curChar == 125)
jjCheckNAddTwoStates(3, 4);
break;
case 8:
if ((0x10000000100000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 10:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 11:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 12:
if ((0xffffffffefffffffL & l) == 0L)
break;
if (kind > 25)
kind = 25;
jjCheckNAdd(12);
break;
case 14:
if (curChar == 91 && kind > 74)
kind = 74;
break;
case 17:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 16;
break;
case 19:
if (curChar == 92)
jjAddStates(117, 118);
break;
case 22:
case 23:
if ((0x7fffffe87ffffffL & l) == 0L)
break;
if (kind > 14)
kind = 14;
jjCheckNAdd(23);
break;
case 24:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 25;
break;
case 25:
if ((0x7fffffe87fffffeL & l) != 0L)
jjCheckNAddTwoStates(26, 27);
break;
case 26:
if ((0x7fffffe87ffffffL & l) != 0L)
jjCheckNAddTwoStates(26, 27);
break;
case 27:
if (curChar == 125 && kind > 14)
kind = 14;
break;
case 28:
if (curChar == 92)
jjCheckNAddStates(119, 122);
break;
case 29:
if (curChar == 92)
jjCheckNAddTwoStates(29, 30);
break;
case 31:
if (curChar == 92)
jjCheckNAddTwoStates(31, 32);
break;
case 33:
if (curChar == 92)
jjAddStates(28, 29);
break;
case 38:
if (kind > 19)
kind = 19;
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 13:
case 12:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 25)
kind = 25;
jjCheckNAdd(12);
break;
case 38:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 40 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_9(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x340000L) != 0L)
return 2;
return -1;
case 1:
if ((active0 & 0x100000L) != 0L)
return 0;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_9(int pos, long active0)
{
return jjMoveNfa_9(jjStopStringLiteralDfa_9(pos, active0), pos + 1);
}
private int jjMoveStringLiteralDfa0_9()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_9(0x140000L);
case 42:
return jjMoveStringLiteralDfa1_9(0x8000000L);
default :
return jjMoveNfa_9(3, 0);
}
}
private int jjMoveStringLiteralDfa1_9(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_9(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x8000000L) != 0L)
return jjStopAtPos(1, 27);
break;
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_9(1, 20, 0);
break;
case 91:
return jjMoveStringLiteralDfa2_9(active0, 0x40000L);
default :
break;
}
return jjStartNfa_9(0, active0);
}
private int jjMoveStringLiteralDfa2_9(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_9(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_9(1, active0);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
default :
break;
}
return jjStartNfa_9(1, active0);
}
private int jjStartNfaWithStates_9(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_9(state, pos + 1);
}
private int jjMoveNfa_9(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 12;
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 3:
if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(9, 10);
}
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 6:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 8:
if (curChar == 36)
jjCheckNAddTwoStates(9, 10);
break;
case 10:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 11:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(9, 10);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 92)
jjCheckNAddStates(100, 103);
break;
case 1:
if (kind > 19)
kind = 19;
break;
case 5:
if (curChar == 92)
jjCheckNAddTwoStates(5, 6);
break;
case 7:
if (curChar == 92)
jjCheckNAddTwoStates(7, 8);
break;
case 9:
if (curChar == 92)
jjAddStates(104, 105);
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 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 12 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_2(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x340000L) != 0L)
return 2;
return -1;
case 1:
if ((active0 & 0x100000L) != 0L)
return 0;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_2(int pos, long active0)
{
return jjMoveNfa_2(jjStopStringLiteralDfa_2(pos, active0), pos + 1);
}
private int jjMoveStringLiteralDfa0_2()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_2(0x140000L);
case 93:
return jjStopAtPos(0, 2);
case 70:
case 102:
return jjMoveStringLiteralDfa1_2(0x800000000L);
case 84:
case 116:
return jjMoveStringLiteralDfa1_2(0x400000000L);
default :
return jjMoveNfa_2(3, 0);
}
}
private int jjMoveStringLiteralDfa1_2(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_2(0, active0);
return 1;
}
switch(curChar)
{
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_2(1, 20, 0);
break;
case 91:
return jjMoveStringLiteralDfa2_2(active0, 0x40000L);
case 65:
case 97:
return jjMoveStringLiteralDfa2_2(active0, 0x800000000L);
case 82:
case 114:
return jjMoveStringLiteralDfa2_2(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_2(0, active0);
}
private int jjMoveStringLiteralDfa2_2(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_2(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_2(1, active0);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
case 76:
case 108:
return jjMoveStringLiteralDfa3_2(active0, 0x800000000L);
case 85:
case 117:
return jjMoveStringLiteralDfa3_2(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_2(1, active0);
}
private int jjMoveStringLiteralDfa3_2(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_2(1, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_2(2, active0);
return 3;
}
switch(curChar)
{
case 69:
case 101:
if ((active0 & 0x400000000L) != 0L)
return jjStopAtPos(3, 34);
break;
case 83:
case 115:
return jjMoveStringLiteralDfa4_2(active0, 0x800000000L);
default :
break;
}
return jjStartNfa_2(2, active0);
}
private int jjMoveStringLiteralDfa4_2(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_2(2, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_2(3, active0);
return 4;
}
switch(curChar)
{
case 69:
case 101:
if ((active0 & 0x800000000L) != 0L)
return jjStopAtPos(4, 35);
break;
default :
break;
}
return jjStartNfa_2(3, active0);
}
private int jjStartNfaWithStates_2(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_2(state, pos + 1);
}
private int jjMoveNfa_2(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 59;
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 3:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 58)
kind = 58;
jjCheckNAddStates(123, 128);
}
else if ((0x100002600L & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAdd(4);
}
else if (curChar == 45)
jjCheckNAddStates(129, 132);
else if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(41, 42);
}
else if (curChar == 46)
jjCheckNAdd(32);
else if (curChar == 39)
jjCheckNAddStates(133, 136);
else if (curChar == 34)
jjCheckNAddStates(137, 140);
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 4:
if ((0x100002600L & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAdd(4);
break;
case 5:
case 7:
if (curChar == 34)
jjCheckNAddStates(137, 140);
break;
case 6:
if ((0xfffffffbffffffffL & l) != 0L)
jjCheckNAddStates(137, 140);
break;
case 8:
if (curChar == 34)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if (curChar == 34 && kind > 33)
kind = 33;
break;
case 12:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(141, 145);
break;
case 13:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(137, 140);
break;
case 14:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 15:
if ((0xff000000000000L & l) != 0L)
jjCheckNAdd(13);
break;
case 17:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 18;
break;
case 18:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 19;
break;
case 19:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 20;
break;
case 20:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(137, 140);
break;
case 21:
if (curChar == 32)
jjAddStates(146, 147);
break;
case 22:
if (curChar == 10)
jjCheckNAddStates(137, 140);
break;
case 23:
case 25:
if (curChar == 39)
jjCheckNAddStates(133, 136);
break;
case 24:
if ((0xffffff7fffffffffL & l) != 0L)
jjCheckNAddStates(133, 136);
break;
case 26:
if (curChar == 39)
jjstateSet[jjnewStateCnt++] = 25;
break;
case 28:
if (curChar == 32)
jjAddStates(148, 149);
break;
case 29:
if (curChar == 10)
jjCheckNAddStates(133, 136);
break;
case 30:
if (curChar == 39 && kind > 33)
kind = 33;
break;
case 31:
if (curChar == 46)
jjCheckNAdd(32);
break;
case 32:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(32, 33);
break;
case 34:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(35);
break;
case 35:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(35);
break;
case 38:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 40:
if (curChar == 36)
jjCheckNAddTwoStates(41, 42);
break;
case 42:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 43:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(41, 42);
break;
case 44:
if (curChar == 45)
jjCheckNAddStates(129, 132);
break;
case 45:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 58)
kind = 58;
jjCheckNAddTwoStates(45, 47);
break;
case 46:
if (curChar == 46 && kind > 58)
kind = 58;
break;
case 47:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 46;
break;
case 48:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(48, 49);
break;
case 49:
if (curChar != 46)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(50, 51);
break;
case 50:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(50, 51);
break;
case 52:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(53);
break;
case 53:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(53);
break;
case 54:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(54, 55);
break;
case 56:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(57);
break;
case 57:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(57);
break;
case 58:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 58)
kind = 58;
jjCheckNAddStates(123, 128);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 92)
jjCheckNAddStates(150, 153);
break;
case 1:
if (kind > 19)
kind = 19;
break;
case 6:
jjCheckNAddStates(137, 140);
break;
case 10:
if (curChar == 92)
jjAddStates(154, 159);
break;
case 11:
if ((0x14404400144044L & l) != 0L)
jjCheckNAddStates(137, 140);
break;
case 16:
if ((0x20000000200000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 17;
break;
case 17:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 18;
break;
case 18:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 19;
break;
case 19:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 20;
break;
case 20:
if ((0x7e0000007eL & l) != 0L)
jjCheckNAddStates(137, 140);
break;
case 24:
jjAddStates(133, 136);
break;
case 27:
if (curChar == 92)
jjAddStates(148, 149);
break;
case 33:
if ((0x2000000020L & l) != 0L)
jjAddStates(160, 161);
break;
case 37:
if (curChar == 92)
jjCheckNAddTwoStates(37, 38);
break;
case 39:
if (curChar == 92)
jjCheckNAddTwoStates(39, 40);
break;
case 41:
if (curChar == 92)
jjAddStates(162, 163);
break;
case 51:
if ((0x2000000020L & l) != 0L)
jjAddStates(164, 165);
break;
case 55:
if ((0x2000000020L & l) != 0L)
jjAddStates(166, 167);
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 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
case 6:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(137, 140);
break;
case 24:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(133, 136);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 59 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_10(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x340000L) != 0L)
return 2;
return -1;
case 1:
if ((active0 & 0x100000L) != 0L)
return 0;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_10(int pos, long active0)
{
return jjMoveNfa_10(jjStopStringLiteralDfa_10(pos, active0), pos + 1);
}
private int jjMoveStringLiteralDfa0_10()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_10(0x140000L);
default :
return jjMoveNfa_10(3, 0);
}
}
private int jjMoveStringLiteralDfa1_10(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_10(0, active0);
return 1;
}
switch(curChar)
{
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_10(1, 20, 0);
break;
case 91:
return jjMoveStringLiteralDfa2_10(active0, 0x40000L);
default :
break;
}
return jjStartNfa_10(0, active0);
}
private int jjMoveStringLiteralDfa2_10(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_10(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_10(1, active0);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
default :
break;
}
return jjStartNfa_10(1, active0);
}
private int jjStartNfaWithStates_10(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_10(state, pos + 1);
}
private int jjMoveNfa_10(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 15;
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 3:
if ((0x2400L & l) != 0L)
{
if (kind > 26)
kind = 26;
}
else if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(12, 13);
}
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 4:
if ((0x2400L & l) != 0L && kind > 26)
kind = 26;
break;
case 5:
if (curChar == 10 && kind > 26)
kind = 26;
break;
case 6:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 9:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 11:
if (curChar == 36)
jjCheckNAddTwoStates(12, 13);
break;
case 13:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 14:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(12, 13);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 92)
jjCheckNAddStates(168, 171);
break;
case 1:
if (kind > 19)
kind = 19;
break;
case 8:
if (curChar == 92)
jjCheckNAddTwoStates(8, 9);
break;
case 10:
if (curChar == 92)
jjCheckNAddTwoStates(10, 11);
break;
case 12:
if (curChar == 92)
jjAddStates(172, 173);
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 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 15 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_0(int pos, long active0, long active1)
{
switch (pos)
{
case 0:
if ((active0 & 0x740000L) != 0L)
return 33;
if ((active0 & 0xc00000000L) != 0L)
{
jjmatchedKind = 68;
return 13;
}
return -1;
case 1:
if ((active0 & 0xc00000000L) != 0L)
{
jjmatchedKind = 68;
jjmatchedPos = 1;
return 13;
}
if ((active0 & 0x100000L) != 0L)
return 31;
return -1;
case 2:
if ((active0 & 0xc00000000L) != 0L)
{
jjmatchedKind = 68;
jjmatchedPos = 2;
return 13;
}
return -1;
case 3:
if ((active0 & 0x800000000L) != 0L)
{
jjmatchedKind = 68;
jjmatchedPos = 3;
return 13;
}
if ((active0 & 0x400000000L) != 0L)
return 13;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_0(int pos, long active0, long active1)
{
return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0, active1), pos + 1);
}
private int jjMoveStringLiteralDfa0_0()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_0(0x540000L);
case 91:
return jjStopAtPos(0, 1);
case 70:
case 102:
return jjMoveStringLiteralDfa1_0(0x800000000L);
case 84:
case 116:
return jjMoveStringLiteralDfa1_0(0x400000000L);
case 123:
return jjStopAtPos(0, 70);
case 125:
return jjStopAtPos(0, 71);
default :
return jjMoveNfa_0(12, 0);
}
}
private int jjMoveStringLiteralDfa1_0(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(0, active0, 0L);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x400000L) != 0L)
return jjStopAtPos(1, 22);
break;
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_0(1, 20, 31);
break;
case 91:
return jjMoveStringLiteralDfa2_0(active0, 0x40000L);
case 65:
case 97:
return jjMoveStringLiteralDfa2_0(active0, 0x800000000L);
case 82:
case 114:
return jjMoveStringLiteralDfa2_0(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_0(0, active0, 0L);
}
private int jjMoveStringLiteralDfa2_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(0, old0, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(1, active0, 0L);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
case 76:
case 108:
return jjMoveStringLiteralDfa3_0(active0, 0x800000000L);
case 85:
case 117:
return jjMoveStringLiteralDfa3_0(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_0(1, active0, 0L);
}
private int jjMoveStringLiteralDfa3_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(1, old0, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(2, active0, 0L);
return 3;
}
switch(curChar)
{
case 69:
case 101:
if ((active0 & 0x400000000L) != 0L)
return jjStartNfaWithStates_0(3, 34, 13);
break;
case 83:
case 115:
return jjMoveStringLiteralDfa4_0(active0, 0x800000000L);
default :
break;
}
return jjStartNfa_0(2, active0, 0L);
}
private int jjMoveStringLiteralDfa4_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(2, old0, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(3, active0, 0L);
return 4;
}
switch(curChar)
{
case 69:
case 101:
if ((active0 & 0x800000000L) != 0L)
return jjStartNfaWithStates_0(4, 35, 13);
break;
default :
break;
}
return jjStartNfa_0(3, active0, 0L);
}
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);
}
private int jjMoveNfa_0(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 34;
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 12:
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 1);
else if (curChar == 35)
jjCheckNAddStates(174, 176);
else if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(27, 28);
}
else if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 15;
if (curChar == 36)
jjCheckNAddStates(177, 180);
break;
case 33:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 31;
break;
case 0:
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 1);
break;
case 1:
if (curChar == 35)
jjCheckNAddTwoStates(6, 11);
break;
case 3:
if (curChar == 32)
jjAddStates(115, 116);
break;
case 4:
if (curChar == 40 && kind > 15)
kind = 15;
break;
case 13:
if ((0x3ff200000000000L & l) == 0L)
break;
if (kind > 68)
kind = 68;
jjstateSet[jjnewStateCnt++] = 13;
break;
case 14:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 16:
if (curChar == 36)
jjCheckNAddStates(177, 180);
break;
case 18:
case 19:
if (curChar == 33)
jjCheckNAdd(17);
break;
case 21:
if (curChar == 46 && kind > 74)
kind = 74;
break;
case 24:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 26:
if (curChar == 36)
jjCheckNAddTwoStates(27, 28);
break;
case 28:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 29:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(27, 28);
break;
case 30:
if (curChar == 35)
jjCheckNAddStates(174, 176);
break;
case 31:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 32;
break;
case 32:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 12:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 68)
kind = 68;
jjCheckNAdd(13);
}
else if (curChar == 92)
jjCheckNAddStates(181, 184);
break;
case 33:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 5;
else if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 2:
if ((0x10000000100000L & l) != 0L)
jjCheckNAddTwoStates(3, 4);
break;
case 5:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 6:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 7:
if (curChar == 125)
jjCheckNAddTwoStates(3, 4);
break;
case 8:
if ((0x10000000100000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 10:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 11:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 13:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 68)
kind = 68;
jjCheckNAdd(13);
break;
case 15:
if ((0x7fffffe07fffffeL & l) != 0L && kind > 69)
kind = 69;
break;
case 17:
if (curChar == 91 && kind > 74)
kind = 74;
break;
case 20:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 19;
break;
case 22:
if (curChar == 92)
jjCheckNAddStates(181, 184);
break;
case 23:
if (curChar == 92)
jjCheckNAddTwoStates(23, 24);
break;
case 25:
if (curChar == 92)
jjCheckNAddTwoStates(25, 26);
break;
case 27:
if (curChar == 92)
jjAddStates(185, 186);
break;
case 32:
if (kind > 19)
kind = 19;
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 32:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 34 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_4(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x340000L) != 0L)
return 52;
if ((active0 & 0x40L) != 0L)
return 74;
if ((active0 & 0xc00000080L) != 0L)
{
jjmatchedKind = 68;
return 40;
}
return -1;
case 1:
if ((active0 & 0xc00000000L) != 0L)
{
jjmatchedKind = 68;
jjmatchedPos = 1;
return 40;
}
if ((active0 & 0x100000L) != 0L)
return 50;
if ((active0 & 0x80L) != 0L)
return 40;
return -1;
case 2:
if ((active0 & 0xc00000000L) != 0L)
{
jjmatchedKind = 68;
jjmatchedPos = 2;
return 40;
}
return -1;
case 3:
if ((active0 & 0x800000000L) != 0L)
{
jjmatchedKind = 68;
jjmatchedPos = 3;
return 40;
}
if ((active0 & 0x400000000L) != 0L)
return 40;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_4(int pos, long active0)
{
return jjMoveNfa_4(jjStopStringLiteralDfa_4(pos, active0), pos + 1);
}
private int jjMoveStringLiteralDfa0_4()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_4(0x140000L);
case 41:
return jjStopAtPos(0, 13);
case 44:
return jjStopAtPos(0, 5);
case 46:
return jjMoveStringLiteralDfa1_4(0x40L);
case 58:
return jjStopAtPos(0, 8);
case 91:
return jjStopAtPos(0, 3);
case 93:
return jjStopAtPos(0, 4);
case 70:
case 102:
return jjMoveStringLiteralDfa1_4(0x800000000L);
case 73:
case 105:
return jjMoveStringLiteralDfa1_4(0x80L);
case 84:
case 116:
return jjMoveStringLiteralDfa1_4(0x400000000L);
case 123:
return jjStopAtPos(0, 9);
case 125:
return jjStopAtPos(0, 10);
default :
return jjMoveNfa_4(13, 0);
}
}
private int jjMoveStringLiteralDfa1_4(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_4(0, active0);
return 1;
}
switch(curChar)
{
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_4(1, 20, 50);
break;
case 46:
if ((active0 & 0x40L) != 0L)
return jjStopAtPos(1, 6);
break;
case 91:
return jjMoveStringLiteralDfa2_4(active0, 0x40000L);
case 65:
case 97:
return jjMoveStringLiteralDfa2_4(active0, 0x800000000L);
case 78:
case 110:
if ((active0 & 0x80L) != 0L)
return jjStartNfaWithStates_4(1, 7, 40);
break;
case 82:
case 114:
return jjMoveStringLiteralDfa2_4(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_4(0, active0);
}
private int jjMoveStringLiteralDfa2_4(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_4(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_4(1, active0);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
case 76:
case 108:
return jjMoveStringLiteralDfa3_4(active0, 0x800000000L);
case 85:
case 117:
return jjMoveStringLiteralDfa3_4(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_4(1, active0);
}
private int jjMoveStringLiteralDfa3_4(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_4(1, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_4(2, active0);
return 3;
}
switch(curChar)
{
case 69:
case 101:
if ((active0 & 0x400000000L) != 0L)
return jjStartNfaWithStates_4(3, 34, 40);
break;
case 83:
case 115:
return jjMoveStringLiteralDfa4_4(active0, 0x800000000L);
default :
break;
}
return jjStartNfa_4(2, active0);
}
private int jjMoveStringLiteralDfa4_4(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_4(2, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_4(3, active0);
return 4;
}
switch(curChar)
{
case 69:
case 101:
if ((active0 & 0x800000000L) != 0L)
return jjStartNfaWithStates_4(4, 35, 40);
break;
default :
break;
}
return jjStartNfa_4(3, active0);
}
private int jjStartNfaWithStates_4(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_4(state, pos + 1);
}
private int jjMoveNfa_4(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 75;
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 52:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 50;
break;
case 74:
case 64:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(64, 65);
break;
case 13:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 58)
kind = 58;
jjCheckNAddStates(187, 192);
}
else if ((0x100002600L & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAdd(12);
}
else if (curChar == 46)
jjCheckNAddTwoStates(64, 74);
else if (curChar == 45)
jjCheckNAddStates(193, 196);
else if (curChar == 35)
jjCheckNAddStates(197, 199);
else if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(46, 47);
}
else if (curChar == 39)
jjCheckNAddStates(200, 203);
else if (curChar == 34)
jjCheckNAddStates(204, 207);
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 1);
break;
case 0:
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 1);
break;
case 1:
if (curChar == 35)
jjCheckNAddTwoStates(6, 11);
break;
case 3:
if (curChar == 32)
jjAddStates(115, 116);
break;
case 4:
if (curChar == 40 && kind > 15)
kind = 15;
break;
case 12:
if ((0x100002600L & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAdd(12);
break;
case 14:
if ((0xfffffffbffffffffL & l) != 0L)
jjCheckNAddStates(204, 207);
break;
case 15:
if (curChar == 34)
jjCheckNAddStates(204, 207);
break;
case 16:
if (curChar == 34)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 17:
if (curChar == 34 && kind > 33)
kind = 33;
break;
case 20:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(208, 212);
break;
case 21:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(204, 207);
break;
case 22:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 23;
break;
case 23:
if ((0xff000000000000L & l) != 0L)
jjCheckNAdd(21);
break;
case 25:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 26;
break;
case 26:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 27;
break;
case 27:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 28;
break;
case 28:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(204, 207);
break;
case 29:
if (curChar == 32)
jjAddStates(94, 95);
break;
case 30:
if (curChar == 10)
jjCheckNAddStates(204, 207);
break;
case 31:
case 33:
if (curChar == 39)
jjCheckNAddStates(200, 203);
break;
case 32:
if ((0xffffff7fffffffffL & l) != 0L)
jjCheckNAddStates(200, 203);
break;
case 34:
if (curChar == 39)
jjstateSet[jjnewStateCnt++] = 33;
break;
case 36:
if (curChar == 32)
jjAddStates(213, 214);
break;
case 37:
if (curChar == 10)
jjCheckNAddStates(200, 203);
break;
case 38:
if (curChar == 39 && kind > 33)
kind = 33;
break;
case 40:
if ((0x3ff200000000000L & l) == 0L)
break;
if (kind > 68)
kind = 68;
jjstateSet[jjnewStateCnt++] = 40;
break;
case 43:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 45:
if (curChar == 36)
jjCheckNAddTwoStates(46, 47);
break;
case 47:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 48:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(46, 47);
break;
case 49:
if (curChar == 35)
jjCheckNAddStates(197, 199);
break;
case 50:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 51;
break;
case 51:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
case 53:
if (curChar == 45)
jjCheckNAddStates(193, 196);
break;
case 54:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 58)
kind = 58;
jjCheckNAddTwoStates(54, 56);
break;
case 55:
if (curChar == 46 && kind > 58)
kind = 58;
break;
case 56:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 55;
break;
case 57:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(57, 58);
break;
case 58:
if (curChar != 46)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(59, 60);
break;
case 59:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(59, 60);
break;
case 61:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(62);
break;
case 62:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(62);
break;
case 63:
if (curChar == 46)
jjCheckNAdd(64);
break;
case 66:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(67);
break;
case 67:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(67);
break;
case 68:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(68, 69);
break;
case 70:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(71);
break;
case 71:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAdd(71);
break;
case 72:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 58)
kind = 58;
jjCheckNAddStates(187, 192);
break;
case 73:
if (curChar == 46)
jjCheckNAddTwoStates(64, 74);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 52:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 5;
else if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 74:
if ((0x7fffffe07fffffeL & l) != 0L && kind > 69)
kind = 69;
break;
case 13:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 68)
kind = 68;
jjCheckNAdd(40);
}
else if (curChar == 92)
jjCheckNAddStates(215, 218);
break;
case 2:
if ((0x10000000100000L & l) != 0L)
jjCheckNAddTwoStates(3, 4);
break;
case 5:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 6:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 7:
if (curChar == 125)
jjCheckNAddTwoStates(3, 4);
break;
case 8:
if ((0x10000000100000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 10:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 11:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 14:
jjCheckNAddStates(204, 207);
break;
case 18:
if (curChar == 92)
jjAddStates(219, 224);
break;
case 19:
if ((0x14404400144044L & l) != 0L)
jjCheckNAddStates(204, 207);
break;
case 24:
if ((0x20000000200000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 25;
break;
case 25:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 26;
break;
case 26:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 27;
break;
case 27:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 28;
break;
case 28:
if ((0x7e0000007eL & l) != 0L)
jjCheckNAddStates(204, 207);
break;
case 32:
jjAddStates(200, 203);
break;
case 35:
if (curChar == 92)
jjAddStates(213, 214);
break;
case 39:
case 40:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 68)
kind = 68;
jjCheckNAdd(40);
break;
case 41:
if (curChar == 92)
jjCheckNAddStates(215, 218);
break;
case 42:
if (curChar == 92)
jjCheckNAddTwoStates(42, 43);
break;
case 44:
if (curChar == 92)
jjCheckNAddTwoStates(44, 45);
break;
case 46:
if (curChar == 92)
jjAddStates(225, 226);
break;
case 51:
if (kind > 19)
kind = 19;
break;
case 60:
if ((0x2000000020L & l) != 0L)
jjAddStates(227, 228);
break;
case 65:
if ((0x2000000020L & l) != 0L)
jjAddStates(229, 230);
break;
case 69:
if ((0x2000000020L & l) != 0L)
jjAddStates(30, 31);
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 14:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(204, 207);
break;
case 32:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(200, 203);
break;
case 51:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 75 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_1(int pos, long active0, long active1)
{
switch (pos)
{
case 0:
if ((active0 & 0xc00000000L) != 0L)
{
jjmatchedKind = 68;
return 13;
}
if ((active0 & 0x340000L) != 0L)
return 27;
return -1;
case 1:
if ((active0 & 0xc00000000L) != 0L)
{
jjmatchedKind = 68;
jjmatchedPos = 1;
return 13;
}
if ((active0 & 0x100000L) != 0L)
return 25;
return -1;
case 2:
if ((active0 & 0xc00000000L) != 0L)
{
jjmatchedKind = 68;
jjmatchedPos = 2;
return 13;
}
return -1;
case 3:
if ((active0 & 0x800000000L) != 0L)
{
jjmatchedKind = 68;
jjmatchedPos = 3;
return 13;
}
if ((active0 & 0x400000000L) != 0L)
return 13;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_1(int pos, long active0, long active1)
{
return jjMoveNfa_1(jjStopStringLiteralDfa_1(pos, active0, active1), pos + 1);
}
private int jjMoveStringLiteralDfa0_1()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_1(0x140000L);
case 40:
return jjStopAtPos(0, 11);
case 91:
return jjStopAtPos(0, 1);
case 70:
case 102:
return jjMoveStringLiteralDfa1_1(0x800000000L);
case 84:
case 116:
return jjMoveStringLiteralDfa1_1(0x400000000L);
case 123:
return jjStopAtPos(0, 70);
case 125:
return jjStopAtPos(0, 71);
default :
return jjMoveNfa_1(12, 0);
}
}
private int jjMoveStringLiteralDfa1_1(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_1(0, active0, 0L);
return 1;
}
switch(curChar)
{
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_1(1, 20, 25);
break;
case 91:
return jjMoveStringLiteralDfa2_1(active0, 0x40000L);
case 65:
case 97:
return jjMoveStringLiteralDfa2_1(active0, 0x800000000L);
case 82:
case 114:
return jjMoveStringLiteralDfa2_1(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_1(0, active0, 0L);
}
private int jjMoveStringLiteralDfa2_1(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_1(0, old0, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_1(1, active0, 0L);
return 2;
}
switch(curChar)
{
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
case 76:
case 108:
return jjMoveStringLiteralDfa3_1(active0, 0x800000000L);
case 85:
case 117:
return jjMoveStringLiteralDfa3_1(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_1(1, active0, 0L);
}
private int jjMoveStringLiteralDfa3_1(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_1(1, old0, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_1(2, active0, 0L);
return 3;
}
switch(curChar)
{
case 69:
case 101:
if ((active0 & 0x400000000L) != 0L)
return jjStartNfaWithStates_1(3, 34, 13);
break;
case 83:
case 115:
return jjMoveStringLiteralDfa4_1(active0, 0x800000000L);
default :
break;
}
return jjStartNfa_1(2, active0, 0L);
}
private int jjMoveStringLiteralDfa4_1(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_1(2, old0, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_1(3, active0, 0L);
return 4;
}
switch(curChar)
{
case 69:
case 101:
if ((active0 & 0x800000000L) != 0L)
return jjStartNfaWithStates_1(4, 35, 13);
break;
default :
break;
}
return jjStartNfa_1(3, active0, 0L);
}
private int jjStartNfaWithStates_1(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_1(state, pos + 1);
}
private int jjMoveNfa_1(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 28;
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 12:
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 1);
else if (curChar == 35)
jjCheckNAddStates(231, 233);
else if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(21, 22);
}
else if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 27:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 25;
break;
case 0:
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 1);
break;
case 1:
if (curChar == 35)
jjCheckNAddTwoStates(6, 11);
break;
case 3:
if (curChar == 32)
jjAddStates(115, 116);
break;
case 4:
if (curChar == 40 && kind > 15)
kind = 15;
break;
case 13:
if ((0x3ff200000000000L & l) == 0L)
break;
if (kind > 68)
kind = 68;
jjstateSet[jjnewStateCnt++] = 13;
break;
case 14:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 18:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 20:
if (curChar == 36)
jjCheckNAddTwoStates(21, 22);
break;
case 22:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 23:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(21, 22);
break;
case 24:
if (curChar == 35)
jjCheckNAddStates(231, 233);
break;
case 25:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 26;
break;
case 26:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 12:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 68)
kind = 68;
jjCheckNAdd(13);
}
else if (curChar == 92)
jjCheckNAddStates(234, 237);
break;
case 27:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 5;
else if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 2:
if ((0x10000000100000L & l) != 0L)
jjCheckNAddTwoStates(3, 4);
break;
case 5:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 6:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 7:
if (curChar == 125)
jjCheckNAddTwoStates(3, 4);
break;
case 8:
if ((0x10000000100000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 10:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 11:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 13:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 68)
kind = 68;
jjCheckNAdd(13);
break;
case 15:
if ((0x7fffffe07fffffeL & l) != 0L && kind > 69)
kind = 69;
break;
case 16:
if (curChar == 92)
jjCheckNAddStates(234, 237);
break;
case 17:
if (curChar == 92)
jjCheckNAddTwoStates(17, 18);
break;
case 19:
if (curChar == 92)
jjCheckNAddTwoStates(19, 20);
break;
case 21:
if (curChar == 92)
jjAddStates(146, 147);
break;
case 26:
if (kind > 19)
kind = 19;
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 26:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 28 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_7(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x340000L) != 0L)
return 2;
return -1;
case 1:
if ((active0 & 0x100000L) != 0L)
return 0;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_7(int pos, long active0)
{
return jjMoveNfa_7(jjStopStringLiteralDfa_7(pos, active0), pos + 1);
}
private int jjMoveStringLiteralDfa0_7()
{
switch(curChar)
{
case 35:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_7(0x140000L);
case 93:
return jjMoveStringLiteralDfa1_7(0x20000000L);
default :
return jjMoveNfa_7(3, 0);
}
}
private int jjMoveStringLiteralDfa1_7(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_7(0, active0);
return 1;
}
switch(curChar)
{
case 42:
if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_7(1, 20, 0);
break;
case 91:
return jjMoveStringLiteralDfa2_7(active0, 0x40000L);
case 93:
return jjMoveStringLiteralDfa2_7(active0, 0x20000000L);
default :
break;
}
return jjStartNfa_7(0, active0);
}
private int jjMoveStringLiteralDfa2_7(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_7(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_7(1, active0);
return 2;
}
switch(curChar)
{
case 35:
if ((active0 & 0x20000000L) != 0L)
return jjStopAtPos(2, 29);
break;
case 91:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(2, 18);
break;
default :
break;
}
return jjStartNfa_7(1, active0);
}
private int jjStartNfaWithStates_7(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_7(state, pos + 1);
}
private int jjMoveNfa_7(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 12;
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 3:
if (curChar == 36)
{
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(9, 10);
}
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 19)
kind = 19;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 6:
if (curChar == 36 && kind > 16)
kind = 16;
break;
case 8:
if (curChar == 36)
jjCheckNAddTwoStates(9, 10);
break;
case 10:
if (curChar == 33 && kind > 17)
kind = 17;
break;
case 11:
if (curChar != 36)
break;
if (kind > 16)
kind = 16;
jjCheckNAddTwoStates(9, 10);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 92)
jjCheckNAddStates(100, 103);
break;
case 1:
if (kind > 19)
kind = 19;
break;
case 5:
if (curChar == 92)
jjCheckNAddTwoStates(5, 6);
break;
case 7:
if (curChar == 92)
jjCheckNAddTwoStates(7, 8);
break;
case 9:
if (curChar == 92)
jjAddStates(104, 105);
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 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 19)
kind = 19;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 12 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
static final int[] jjnextStates = {
91, 93, 94, 95, 100, 101, 91, 94, 61, 100, 29, 31, 32, 35, 11, 13,
14, 15, 1, 2, 4, 11, 18, 13, 14, 15, 26, 27, 33, 34, 70, 71,
73, 74, 75, 76, 87, 89, 84, 85, 81, 82, 16, 17, 19, 21, 26, 27,
64, 65, 77, 78, 98, 99, 102, 103, 84, 86, 87, 88, 93, 94, 84, 87,
13, 93, 22, 23, 34, 35, 37, 45, 46, 48, 53, 35, 54, 77, 46, 78,
57, 65, 68, 75, 82, 25, 26, 27, 28, 38, 43, 50, 16, 17, 29, 30,
91, 92, 95, 96, 5, 6, 7, 8, 9, 10, 6, 11, 39, 14, 15, 17,
18, 22, 24, 3, 4, 20, 21, 29, 30, 31, 32, 45, 47, 48, 49, 54,
55, 45, 48, 31, 54, 24, 26, 27, 30, 6, 8, 9, 10, 6, 13, 8,
9, 10, 21, 22, 28, 29, 37, 38, 39, 40, 11, 12, 14, 16, 21, 22,
34, 35, 41, 42, 52, 53, 56, 57, 8, 9, 10, 11, 12, 13, 6, 11,
33, 17, 18, 20, 21, 23, 24, 25, 26, 27, 28, 54, 56, 57, 58, 68,
69, 54, 57, 63, 68, 6, 11, 52, 32, 34, 35, 38, 14, 16, 17, 18,
14, 21, 16, 17, 18, 36, 37, 42, 43, 44, 45, 19, 20, 22, 24, 29,
30, 46, 47, 61, 62, 66, 67, 6, 11, 27, 17, 18, 19, 20,
};
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;
}
}
/** net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken literal values. */
public static final String[] jjstrLiteralImages = {
null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, };
/** Lexer state names. */
public static final String[] lexStateNames = {
"REFERENCE",
"REFMODIFIER",
"REFINDEX",
"DIRECTIVE",
"REFMOD2",
"DEFAULT",
"REFMOD",
"IN_TEXTBLOCK",
"IN_MULTI_LINE_COMMENT",
"IN_FORMAL_COMMENT",
"IN_SINGLE_LINE_COMMENT",
"PRE_DIRECTIVE",
};
/** Lex State array. */
public static final int[] jjnewLexState = {
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
};
static final long[] jjtoToken = {
0x8dffffff3fc0ffffL, 0x4f1L,
};
static final long[] jjtoSkip = {
0x40000000L, 0x300L,
};
static final long[] jjtoSpecial = {
0x0L, 0x300L,
};
static final long[] jjtoMore = {
0x803f0000L, 0x0L,
};
protected net.sourceforge.pmd.lang.ast.impl.javacc.CharStream input_stream;
private final int[] jjrounds = new int[105];
private final int[] jjstateSet = new int[210];
private final StringBuilder jjimage = new StringBuilder();
private StringBuilder image = jjimage;
private int jjimageLen;
private int lengthOfMatch;
protected char curChar;
/** Constructor. */
public VtlParserImplTokenManager(net.sourceforge.pmd.lang.ast.impl.javacc.CharStream stream){
input_stream = stream;
}
/** Constructor. */
public VtlParserImplTokenManager(net.sourceforge.pmd.lang.ast.impl.javacc.CharStream stream, int lexState){
this(stream);
SwitchTo(lexState);
}
/** Reinitialise parser. */
public void ReInit(net.sourceforge.pmd.lang.ast.impl.javacc.CharStream stream)
{
jjmatchedPos = jjnewStateCnt = 0;
curLexState = defaultLexState;
input_stream = stream;
ReInitRounds();
}
private void ReInitRounds()
{
int i;
jjround = 0x80000001;
for (i = 105; i-- > 0;)
jjrounds[i] = 0x80000000;
}
/** Reinitialise parser. */
public void ReInit(net.sourceforge.pmd.lang.ast.impl.javacc.CharStream stream, int lexState)
{
ReInit(stream);
SwitchTo(lexState);
}
/** Switch to specified lex state. */
public void SwitchTo(int lexState)
{
if (lexState >= 12 || lexState < 0)
throw new IllegalArgumentException("Invalid lexical state " + lexState);
else
curLexState = lexState;
}
protected net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken jjFillToken() {return input_stream.getTokenDocument().createToken(jjmatchedKind, input_stream, jjstrLiteralImages[jjmatchedKind]);}int curLexState = 5;
int defaultLexState = 5;
int jjnewStateCnt;
int jjround;
int jjmatchedPos;
int jjmatchedKind;
/** Get the next net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken. */
public net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken getNextToken()
{
net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken specialToken = null;
net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken matchedToken;
int curPos = 0;
EOFLoop :
for (;;)
{
try
{
curChar = input_stream.markTokenStart();
}
catch(java.io.IOException e)
{
jjmatchedKind = 0;
matchedToken = jjFillToken();
matchedToken.specialToken = specialToken;
return matchedToken;
}
image = jjimage;
image.setLength(0);
jjimageLen = 0;
for (;;)
{
switch(curLexState)
{
case 0:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_0();
if (jjmatchedPos == 0 && jjmatchedKind > 72)
{
jjmatchedKind = 72;
}
break;
case 1:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_1();
if (jjmatchedPos == 0 && jjmatchedKind > 72)
{
jjmatchedKind = 72;
}
break;
case 2:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_2();
break;
case 3:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_3();
break;
case 4:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_4();
break;
case 5:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_5();
break;
case 6:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_6();
if (jjmatchedPos == 0 && jjmatchedKind > 72)
{
jjmatchedKind = 72;
}
break;
case 7:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_7();
if (jjmatchedPos == 0 && jjmatchedKind > 31)
{
jjmatchedKind = 31;
}
break;
case 8:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_8();
if (jjmatchedPos == 0 && jjmatchedKind > 30)
{
jjmatchedKind = 30;
}
break;
case 9:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_9();
if (jjmatchedPos == 0 && jjmatchedKind > 30)
{
jjmatchedKind = 30;
}
break;
case 10:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_10();
if (jjmatchedPos == 0 && jjmatchedKind > 30)
{
jjmatchedKind = 30;
}
break;
case 11:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_11();
if (jjmatchedPos == 0 && jjmatchedKind > 73)
{
jjmatchedKind = 73;
}
break;
}
if (jjmatchedKind != 0x7fffffff)
{
if (jjmatchedPos + 1 < curPos)
input_stream.backup(curPos - jjmatchedPos - 1);
if ((jjtoToken[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
matchedToken = jjFillToken();
matchedToken.specialToken = specialToken;
matchedToken = TokenLexicalActions(matchedToken);
if (jjnewLexState[jjmatchedKind] != -1)
curLexState = jjnewLexState[jjmatchedKind];
return matchedToken;
}
else if ((jjtoSkip[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
if ((jjtoSpecial[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
matchedToken = jjFillToken();
if (specialToken == null)
specialToken = matchedToken;
else
{
matchedToken.specialToken = specialToken;
specialToken = (specialToken.next = matchedToken);
}
SkipLexicalActions(matchedToken);
}
else
SkipLexicalActions(null);
if (jjnewLexState[jjmatchedKind] != -1)
curLexState = jjnewLexState[jjmatchedKind];
continue EOFLoop;
}
MoreLexicalActions();
if (jjnewLexState[jjmatchedKind] != -1)
curLexState = jjnewLexState[jjmatchedKind];
curPos = 0;
jjmatchedKind = 0x7fffffff;
try {
curChar = input_stream.readChar();
continue;
}
catch (java.io.IOException e1) { }
}
int error_line = input_stream.getEndLine();
int error_column = (input_stream.getEndColumn() - 1);
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.getTokenImage();
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.getTokenImage();
}
throw net.sourceforge.pmd.lang.ast.InternalApiBridge.newLexException(EOFSeen, lexStateNames[curLexState], error_line, error_column, error_after, curChar);
}
}
}
net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken SkipLexicalActions(net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken matchedToken) {
switch(jjmatchedKind)
{
case 72 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
/*
* push every terminator character back into the stream
*/
input_stream.backup(1);
inReference = false;
if ( debugPrint )
System.out.print("REF_TERM :");
stateStackPop();
break;
case 73 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
if ( debugPrint )
System.out.print("DIRECTIVE_TERM :");
input_stream.backup(1);
inDirective = false;
stateStackPop();
break;
default :
break;
}
return matchedToken; }void MoreLexicalActions()
{
jjimageLen += (lengthOfMatch = jjmatchedPos + 1);
switch(jjmatchedKind)
{
case 16 :
input_stream.appendSuffix(image,(jjimageLen));
jjimageLen = 0;
if (! inComment)
{
/*
* if we find ourselves in REFERENCE, we need to pop down
* to end the previous ref
*/
if (curLexState == REFERENCE)
{
inReference = false;
stateStackPop();
}
inReference = true;
if ( debugPrint )
System.out.print( "$ : going to " + REFERENCE );
stateStackPush();
SwitchTo(REFERENCE);
}
break;
case 17 :
input_stream.appendSuffix(image,(jjimageLen));
jjimageLen = 0;
if (! inComment)
{
/*
* if we find ourselves in REFERENCE, we need to pop down
* to end the previous ref
*/
if (curLexState == REFERENCE)
{
inReference = false;
stateStackPop();
}
inReference = true;
if ( debugPrint )
System.out.print( "$! : going to " + REFERENCE );
stateStackPush();
SwitchTo(REFERENCE);
}
break;
case 18 :
input_stream.appendSuffix(image,(jjimageLen));
jjimageLen = 0;
if (!inComment)
{
inComment = true;
stateStackPush();
SwitchTo( IN_TEXTBLOCK );
}
break;
case 19 :
input_stream.appendSuffix(image,(jjimageLen));
jjimageLen = 0;
if (!inComment)
{
input_stream.backup(1);
inComment = true;
stateStackPush();
SwitchTo( IN_FORMAL_COMMENT);
}
break;
case 20 :
input_stream.appendSuffix(image,(jjimageLen));
jjimageLen = 0;
if (!inComment)
{
inComment=true;
stateStackPush();
SwitchTo( IN_MULTI_LINE_COMMENT );
}
break;
case 21 :
input_stream.appendSuffix(image,(jjimageLen));
jjimageLen = 0;
if (! inComment)
{
/*
* We can have the situation where #if($foo)$foo#end.
* We need to transition out of REFERENCE before going to DIRECTIVE.
* I don't really like this, but I can't think of a legal way
* you are going into DIRECTIVE while in REFERENCE. -gmj
*/
if (curLexState == REFERENCE || curLexState == REFMODIFIER )
{
inReference = false;
stateStackPop();
}
inDirective = true;
if ( debugPrint )
System.out.print("# : going to " + DIRECTIVE );
stateStackPush();
SwitchTo(PRE_DIRECTIVE);
}
break;
default :
break;
}
}
net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken TokenLexicalActions(net.sourceforge.pmd.lang.ast.impl.javacc.JavaccToken matchedToken) {
switch(jjmatchedKind)
{
case 1 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
stateStackPush();
SwitchTo(REFINDEX);
break;
case 2 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
stateStackPop();
break;
case 11 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
if (!inComment)
lparen++;
/*
* If in REFERENCE and we have seen the dot, then move
* to REFMOD2 -> Modifier()
*/
if (curLexState == REFMODIFIER )
SwitchTo( REFMOD2 );
break;
case 12 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
RPARENHandler();
break;
case 13 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
/*
* need to simply switch back to REFERENCE, not drop down the stack
* because we can (infinitely) chain, ala
* $foo.bar().blargh().woogie().doogie()
*/
SwitchTo( REFERENCE );
break;
case 15 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
if (! inComment)
{
inDirective = true;
if ( debugPrint )
System.out.print("#set : going to " + DIRECTIVE );
stateStackPush();
inSet = true;
SwitchTo(DIRECTIVE);
}
/*
* need the LPAREN action
*/
if (!inComment)
{
lparen++;
/*
* If in REFERENCE and we have seen the dot, then move
* to REFMOD2 -> Modifier()
*/
if (curLexState == REFMODIFIER )
SwitchTo( REFMOD2 );
}
break;
case 22 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
if (!inComment)
{
if (curLexState == REFERENCE)
{
inReference = false;
stateStackPop();
}
inComment = true;
stateStackPush();
SwitchTo(IN_SINGLE_LINE_COMMENT);
}
break;
case 26 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
inComment = false;
stateStackPop();
break;
case 27 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
inComment = false;
stateStackPop();
break;
case 28 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
inComment = false;
stateStackPop();
break;
case 29 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
inComment = false;
stateStackPop();
break;
case 33 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
/*
* - if we are in DIRECTIVE and haven't seen ( yet, then also drop out.
* don't forget to account for the beloved yet wierd #set
* - finally, if we are in REFMOD2 (remember : $foo.bar( ) then " is ok!
*/
if( curLexState == DIRECTIVE && !inSet && lparen == 0)
stateStackPop();
break;
case 36 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
if ( debugPrint )
System.out.println(" NEWLINE :");
stateStackPop();
if (inSet)
inSet = false;
if (inDirective)
inDirective = false;
break;
case 52 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
inDirective = false;
stateStackPop();
break;
case 53 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
SwitchTo(DIRECTIVE);
break;
case 54 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
SwitchTo(DIRECTIVE);
break;
case 55 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
SwitchTo(DIRECTIVE);
break;
case 56 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
inDirective = false;
stateStackPop();
break;
case 58 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
/*
* Remove the double period if it is there
*/
if (matchedToken.getImage().endsWith("..")) {
input_stream.backup(2);
matchedToken = matchedToken.replaceImage(input_stream);
}
/*
* check to see if we are in set
* ex. #set $foo = $foo + 3
* because we want to handle the \n after
*/
if ( lparen == 0 && !inSet && curLexState != REFMOD2 && curLexState != REFINDEX)
{
stateStackPop();
}
break;
case 59 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
/*
* check to see if we are in set
* ex. #set $foo = $foo + 3
* because we want to handle the \n after
*/
if ( lparen == 0 && !inSet && curLexState != REFMOD2)
{
stateStackPop();
}
break;
case 69 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
/*
* push the alpha char back into the stream so the following identifier
* is complete
*/
input_stream.backup(1);
/*
* and munge the so we just get a . when we have normal text that
* looks like a ref.ident
*/
matchedToken = matchedToken.replaceImage(input_stream);
if ( debugPrint )
System.out.print("DOT : switching to " + REFMODIFIER);
SwitchTo(REFMODIFIER);
break;
case 71 :
input_stream.appendSuffix(image,(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
stateStackPop();
break;
default :
break;
}
return matchedToken; }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);
}
}
