ParserTokenManager.java
| Index Score | ||
|---|---|---|
 |
 |
org.apache.velocity.runtime.parser |
 |
 |
Apache Velocity Engine |
View: Reasons, Metrics, Source Code
These are the metrics that contribute to the Enerjy Score for this file, ranked by impact. So the metrics listed at the top influence the score to a greater extent that the metrics listed at the bottom.
| Metric | Description | |
|---|---|---|
| CYCLOMATIC | Cyclomatic complexity |  |
| COMPARISONS | Number of comparison operators | |
| JAVA0034 | JAVA0034 Missing braces in if statement | |
| JAVA0076 | JAVA0076 Use of magic number | |
| ELOC | Effective lines of code | |
| LOC | Lines of code | |
| LOGICAL_LINES | Number of statements | |
| OPERATORS | Number of operators | |
| PROGRAM_LENGTH | Halstead program length | |
| SIZE | Size of the file in bytes | |
| OPERANDS | Number of operands | |
| LINES | Number of lines in the source file | |
| RETURNS | Number of return points from functions | |
| INTERFACE_COMPLEXITY | Interface complexity | |
| LOOPS | Number of loops | |
| BLOCKS | Number of blocks | |
| PARAMS | Number of formal parameter declarations | |
| JAVA0053 | JAVA0053 Unused label | |
| JAVA0264 | JAVA0264 Integer math in long context - check for overflow | |
| UNIQUE_OPERANDS | Number of unique operands | |
| JAVA0040 | JAVA0040 Switch statement contains N cases (maximum: M) | |
| PROGRAM_VOCAB | Halstead program vocabulary | |
| FUNCTIONS | Number of function declarations | |
| JAVA0171 | JAVA0171 Unused local variable | |
| JAVA0177 | JAVA0177 Variable declaration missing initializer | |
| JAVA0123 | JAVA0123 Use all three components of for loop | |
| EXITS | Procedure exits | |
| JAVA0266 | JAVA0266 Use of System.out | |
| JAVA0082 | JAVA0082 Unnecessary widening cast | |
| EXEC_COMMENTS | Comments in executable code | |
| JAVA0130 | JAVA0130 Non-static method does not use instance fields | |
| JAVA0150 | JAVA0150 java.lang.Error (or subclass) thrown | |
| JAVA0173 | JAVA0173 Unused method parameter | |
| JAVA0116 | JAVA0116 Missing javadoc: field 'field' | |
| UNIQUE_OPERATORS | Number of unique operators | |
| JAVA0117 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0244 | JAVA0244 Field or method name in subclass differs only by case from inherited field or method | |
| JAVA0125 | JAVA0125 Continue statement with label | |
| JAVA0007 | JAVA0007 Should not declare public field | |
| NEST_DEPTH | Maximum nesting depth | |
| JAVA0080 | JAVA0080 Import declaration not used | |
| BLOCK_COMMENT | Number of block comment lines | |
| JAVA0111 | JAVA0111 Incorrect javadoc: @return tag for void method | |
| PROGRAM_VOLUME | Halstead program volume | |
| JAVA0136 | JAVA0136 N methods defined in class (maximum: M) | |
| JAVA0032 | JAVA0032 Switch statement missing default | |
| JAVA0035 | JAVA0035 Missing braces in for statement | |
| JAVA0126 | JAVA0126 Method declares unchecked exception in throws | |
| LINE_COMMENT | Number of line comments | |
| JAVA0110 | JAVA0110 Incorrect javadoc: no @return tag | |
| JAVA0030 | JAVA0030 Private field not used | |
| JAVA0029 | JAVA0029 Private method not used | |
| JAVA0100 | JAVA0100 Class contains N non-final fields (maximum: M) | |
| JAVA0108 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| DOC_COMMENT | Number of javadoc comment lines | |
| DECL_COMMENTS | Comments in declarations | |
| JAVA0145 | JAVA0145 Tab character used in source file | |
/* Generated By:JJTree&JavaCC: Do not edit this line. ParserTokenManager.java */
package org.apache.velocity.runtime.parser;
import java.io.*;
import java.util.*;
import org.apache.velocity.runtime.RuntimeServices;
import org.apache.velocity.runtime.parser.node.*;
import org.apache.velocity.runtime.directive.Directive;
import org.apache.velocity.runtime.directive.Macro;
import org.apache.velocity.runtime.directive.MacroParseException;
import org.apache.velocity.util.StringUtils;
public class ParserTokenManager implements ParserConstants
{
private int fileDepth = 0;
private int lparen = 0;
private int rparen = 0;
Stack stateStack = new Stack();
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()
{
Hashtable h;
try
{
h = (Hashtable) stateStack.pop();
}
catch( EmptyStackException e)
{
lparen=0;
SwitchTo(DEFAULT);
return false;
}
if( debugPrint )
System.out.println(
" stack pop (" + stateStack.size() + ") : lparen=" +
( (Integer) h.get("lparen")).intValue() +
" newstate=" + ( (Integer) h.get("lexstate")).intValue() );
lparen = ( (Integer) h.get("lparen")).intValue();
rparen = ( (Integer) h.get("rparen")).intValue();
SwitchTo( ( (Integer) h.get("lexstate")).intValue() );
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 );
Hashtable h = new Hashtable();
h.put("lexstate", new Integer( curLexState ) );
h.put("lparen", new Integer( lparen ));
h.put("rparen", new Integer( rparen ));
lparen = 0;
stateStack.push( h );
return true;
}
/**
* Clears all state variables, resets to
* start values, clears stateStack. Call
* before parsing.
* @return void
*/
public void clearStateVars()
{
stateStack.clear();
lparen = 0;
rparen = 0;
inReference = false;
inDirective = false;
inComment = false;
inSet = false;
return;
}
/**
* 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;
}
}
}
public java.io.PrintStream debugStream = System.out;
public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }
private final int jjStopStringLiteralDfa_0(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x10L) != 0L)
return 58;
if ((active0 & 0x80000000L) != 0L)
return 101;
if ((active0 & 0x40L) != 0L)
return 65;
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 57;
return 63;
}
if ((active0 & 0x200000000000L) != 0L)
return 50;
if ((active0 & 0x70000L) != 0L)
return 7;
return -1;
case 1:
if ((active0 & 0x10000L) != 0L)
return 5;
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 57;
jjmatchedPos = 1;
return 63;
}
return -1;
case 2:
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 57;
jjmatchedPos = 2;
return 63;
}
return -1;
case 3:
if ((active0 & 0x10000000L) != 0L)
return 63;
if ((active0 & 0x20000000L) != 0L)
{
jjmatchedKind = 57;
jjmatchedPos = 3;
return 63;
}
return -1;
default :
return -1;
}
}
private final int jjStartNfa_0(int pos, long active0)
{
return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1);
}
private final int jjStopAtPos(int pos, int kind)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
return pos + 1;
}
private final int jjStartNfaWithStates_0(int pos, int kind, int state)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return pos + 1; }
return jjMoveNfa_0(state, pos + 1);
}
private final int jjMoveStringLiteralDfa0_0()
{
switch(curChar)
{
case 35:
jjmatchedKind = 17;
return jjMoveStringLiteralDfa1_0(0x50000L);
case 37:
return jjStopAtPos(0, 35);
case 40:
return jjStopAtPos(0, 8);
case 42:
return jjStopAtPos(0, 33);
case 43:
return jjStopAtPos(0, 32);
case 44:
return jjStopAtPos(0, 3);
case 45:
return jjStartNfaWithStates_0(0, 31, 101);
case 46:
return jjMoveStringLiteralDfa1_0(0x10L);
case 47:
return jjStopAtPos(0, 34);
case 58:
return jjStopAtPos(0, 5);
case 61:
return jjStartNfaWithStates_0(0, 45, 50);
case 91:
return jjStopAtPos(0, 1);
case 93:
return jjStopAtPos(0, 2);
case 102:
return jjMoveStringLiteralDfa1_0(0x20000000L);
case 116:
return jjMoveStringLiteralDfa1_0(0x10000000L);
case 123:
return jjStartNfaWithStates_0(0, 6, 65);
case 125:
return jjStopAtPos(0, 7);
default :
return jjMoveNfa_0(0, 0);
}
}
private final int jjMoveStringLiteralDfa1_0(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(1, 18);
break;
case 42:
if ((active0 & 0x10000L) != 0L)
return jjStartNfaWithStates_0(1, 16, 5);
break;
case 46:
if ((active0 & 0x10L) != 0L)
return jjStopAtPos(1, 4);
break;
case 97:
return jjMoveStringLiteralDfa2_0(active0, 0x20000000L);
case 114:
return jjMoveStringLiteralDfa2_0(active0, 0x10000000L);
default :
break;
}
return jjStartNfa_0(0, active0);
}
private final int jjMoveStringLiteralDfa2_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(1, active0);
return 2;
}
switch(curChar)
{
case 108:
return jjMoveStringLiteralDfa3_0(active0, 0x20000000L);
case 117:
return jjMoveStringLiteralDfa3_0(active0, 0x10000000L);
default :
break;
}
return jjStartNfa_0(1, active0);
}
private final int jjMoveStringLiteralDfa3_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(1, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(2, active0);
return 3;
}
switch(curChar)
{
case 101:
if ((active0 & 0x10000000L) != 0L)
return jjStartNfaWithStates_0(3, 28, 63);
break;
case 115:
return jjMoveStringLiteralDfa4_0(active0, 0x20000000L);
default :
break;
}
return jjStartNfa_0(2, active0);
}
private final int jjMoveStringLiteralDfa4_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(2, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(3, active0);
return 4;
}
switch(curChar)
{
case 101:
if ((active0 & 0x20000000L) != 0L)
return jjStartNfaWithStates_0(4, 29, 63);
break;
default :
break;
}
return jjStartNfa_0(3, active0);
}
private final void jjCheckNAdd(int state)
{
if (jjrounds[state] != jjround)
{
jjstateSet[jjnewStateCnt++] = state;
jjrounds[state] = jjround;
}
}
private final void jjAddStates(int start, int end)
{
do {
jjstateSet[jjnewStateCnt++] = jjnextStates[start];
} while (start++ != end);
}
private final void jjCheckNAddTwoStates(int state1, int state2)
{
jjCheckNAdd(state1);
jjCheckNAdd(state2);
}
private final void jjCheckNAddStates(int start, int end)
{
do {
jjCheckNAdd(jjnextStates[start]);
} while (start++ != end);
}
private final void jjCheckNAddStates(int start)
{
jjCheckNAdd(jjnextStates[start]);
jjCheckNAdd(jjnextStates[start + 1]);
}
static final long[] jjbitVec0 = {
0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
private final int jjMoveNfa_0(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 101;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAddStates(0, 5);
}
else if ((0x100002600L & l) != 0L)
{
if (kind > 26)
kind = 26;
jjCheckNAdd(9);
}
else if (curChar == 45)
jjCheckNAddStates(6, 9);
else if (curChar == 36)
{
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(73, 74);
}
else if (curChar == 46)
jjCheckNAdd(58);
else if (curChar == 33)
{
if (kind > 44)
kind = 44;
}
else if (curChar == 61)
jjstateSet[jjnewStateCnt++] = 50;
else if (curChar == 62)
jjstateSet[jjnewStateCnt++] = 48;
else if (curChar == 60)
jjstateSet[jjnewStateCnt++] = 45;
else if (curChar == 38)
jjstateSet[jjnewStateCnt++] = 35;
else if (curChar == 39)
jjCheckNAddStates(10, 12);
else if (curChar == 34)
jjCheckNAddStates(13, 15);
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 7;
else if (curChar == 41)
{
if (kind > 9)
kind = 9;
jjCheckNAddStates(16, 18);
}
if ((0x2400L & l) != 0L)
{
if (kind > 30)
kind = 30;
}
else if (curChar == 33)
jjstateSet[jjnewStateCnt++] = 54;
else if (curChar == 62)
{
if (kind > 40)
kind = 40;
}
else if (curChar == 60)
{
if (kind > 38)
kind = 38;
}
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 33;
break;
case 101:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(96, 97);
else if (curChar == 46)
jjCheckNAdd(58);
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(90, 91);
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAddTwoStates(87, 89);
}
break;
case 1:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(16, 18);
break;
case 2:
if ((0x2400L & l) != 0L && kind > 9)
kind = 9;
break;
case 3:
if (curChar == 10 && kind > 9)
kind = 9;
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 > 15)
kind = 15;
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 > 26)
kind = 26;
jjCheckNAdd(9);
break;
case 10:
if (curChar == 34)
jjCheckNAddStates(13, 15);
break;
case 11:
if ((0xfffffffbffffffffL & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 12:
if (curChar == 34 && kind > 27)
kind = 27;
break;
case 14:
if ((0x8400000000L & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 15:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(19, 22);
break;
case 16:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 17:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 18;
break;
case 18:
if ((0xff000000000000L & l) != 0L)
jjCheckNAdd(16);
break;
case 20:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 21;
break;
case 21:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 22;
break;
case 22:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 23;
break;
case 23:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 24:
if (curChar == 32)
jjAddStates(23, 24);
break;
case 25:
if (curChar == 10)
jjCheckNAddStates(13, 15);
break;
case 26:
if (curChar == 39)
jjCheckNAddStates(10, 12);
break;
case 27:
if ((0xffffff7fffffffffL & l) != 0L)
jjCheckNAddStates(10, 12);
break;
case 29:
if (curChar == 32)
jjAddStates(25, 26);
break;
case 30:
if (curChar == 10)
jjCheckNAddStates(10, 12);
break;
case 31:
if (curChar == 39 && kind > 27)
kind = 27;
break;
case 32:
if ((0x2400L & l) != 0L && kind > 30)
kind = 30;
break;
case 33:
if (curChar == 10 && kind > 30)
kind = 30;
break;
case 34:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 33;
break;
case 35:
if (curChar == 38 && kind > 36)
kind = 36;
break;
case 36:
if (curChar == 38)
jjstateSet[jjnewStateCnt++] = 35;
break;
case 44:
if (curChar == 60 && kind > 38)
kind = 38;
break;
case 45:
if (curChar == 61 && kind > 39)
kind = 39;
break;
case 46:
if (curChar == 60)
jjstateSet[jjnewStateCnt++] = 45;
break;
case 47:
if (curChar == 62 && kind > 40)
kind = 40;
break;
case 48:
if (curChar == 61 && kind > 41)
kind = 41;
break;
case 49:
if (curChar == 62)
jjstateSet[jjnewStateCnt++] = 48;
break;
case 50:
if (curChar == 61 && kind > 42)
kind = 42;
break;
case 51:
if (curChar == 61)
jjstateSet[jjnewStateCnt++] = 50;
break;
case 54:
if (curChar == 61 && kind > 43)
kind = 43;
break;
case 55:
if (curChar == 33)
jjstateSet[jjnewStateCnt++] = 54;
break;
case 56:
if (curChar == 33 && kind > 44)
kind = 44;
break;
case 57:
if (curChar == 46)
jjCheckNAdd(58);
break;
case 58:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAddTwoStates(58, 59);
break;
case 60:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(61);
break;
case 61:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAdd(61);
break;
case 63:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 57)
kind = 57;
jjstateSet[jjnewStateCnt++] = 63;
break;
case 66:
if ((0x3ff000000000000L & l) != 0L)
jjAddStates(27, 28);
break;
case 70:
if (curChar == 36 && kind > 13)
kind = 13;
break;
case 72:
if (curChar == 36)
jjCheckNAddTwoStates(73, 74);
break;
case 74:
if (curChar == 33 && kind > 14)
kind = 14;
break;
case 75:
if (curChar != 36)
break;
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(73, 74);
break;
case 86:
if (curChar == 45)
jjCheckNAddStates(6, 9);
break;
case 87:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAddTwoStates(87, 89);
break;
case 88:
if (curChar == 46 && kind > 52)
kind = 52;
break;
case 89:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 88;
break;
case 90:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(90, 91);
break;
case 91:
if (curChar != 46)
break;
if (kind > 53)
kind = 53;
jjCheckNAddTwoStates(92, 93);
break;
case 92:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAddTwoStates(92, 93);
break;
case 94:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(95);
break;
case 95:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAdd(95);
break;
case 96:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(96, 97);
break;
case 98:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(99);
break;
case 99:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAdd(99);
break;
case 100:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAddStates(0, 5);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 57)
kind = 57;
jjCheckNAdd(63);
}
else if (curChar == 92)
jjCheckNAddStates(29, 32);
else if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 65;
else if (curChar == 124)
jjstateSet[jjnewStateCnt++] = 40;
if (curChar == 110)
jjAddStates(33, 34);
else if (curChar == 103)
jjAddStates(35, 36);
else if (curChar == 108)
jjAddStates(37, 38);
else if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 52;
else if (curChar == 111)
jjstateSet[jjnewStateCnt++] = 42;
else if (curChar == 97)
jjstateSet[jjnewStateCnt++] = 38;
break;
case 6:
if (kind > 15)
kind = 15;
break;
case 11:
if ((0xffffffffefffffffL & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 13:
if (curChar == 92)
jjAddStates(39, 44);
break;
case 14:
if ((0x14404410000000L & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 19:
if (curChar == 117)
jjstateSet[jjnewStateCnt++] = 20;
break;
case 20:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 21;
break;
case 21:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 22;
break;
case 22:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 23;
break;
case 23:
if ((0x7e0000007eL & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 27:
jjAddStates(10, 12);
break;
case 28:
if (curChar == 92)
jjAddStates(25, 26);
break;
case 37:
if (curChar == 100 && kind > 36)
kind = 36;
break;
case 38:
if (curChar == 110)
jjstateSet[jjnewStateCnt++] = 37;
break;
case 39:
if (curChar == 97)
jjstateSet[jjnewStateCnt++] = 38;
break;
case 40:
if (curChar == 124 && kind > 37)
kind = 37;
break;
case 41:
if (curChar == 124)
jjstateSet[jjnewStateCnt++] = 40;
break;
case 42:
if (curChar == 114 && kind > 37)
kind = 37;
break;
case 43:
if (curChar == 111)
jjstateSet[jjnewStateCnt++] = 42;
break;
case 52:
if (curChar == 113 && kind > 42)
kind = 42;
break;
case 53:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 52;
break;
case 59:
if ((0x2000000020L & l) != 0L)
jjAddStates(45, 46);
break;
case 62:
case 63:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 57)
kind = 57;
jjCheckNAdd(63);
break;
case 64:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 65;
break;
case 65:
case 66:
if ((0x7fffffe87fffffeL & l) != 0L)
jjCheckNAddTwoStates(66, 67);
break;
case 67:
if (curChar == 125 && kind > 58)
kind = 58;
break;
case 68:
if (curChar == 92)
jjCheckNAddStates(29, 32);
break;
case 69:
if (curChar == 92)
jjCheckNAddTwoStates(69, 70);
break;
case 71:
if (curChar == 92)
jjCheckNAddTwoStates(71, 72);
break;
case 73:
if (curChar == 92)
jjAddStates(47, 48);
break;
case 76:
if (curChar == 108)
jjAddStates(37, 38);
break;
case 77:
if (curChar == 116 && kind > 38)
kind = 38;
break;
case 78:
if (curChar == 101 && kind > 39)
kind = 39;
break;
case 79:
if (curChar == 103)
jjAddStates(35, 36);
break;
case 80:
if (curChar == 116 && kind > 40)
kind = 40;
break;
case 81:
if (curChar == 101 && kind > 41)
kind = 41;
break;
case 82:
if (curChar == 110)
jjAddStates(33, 34);
break;
case 83:
if (curChar == 101 && kind > 43)
kind = 43;
break;
case 84:
if (curChar == 116 && kind > 44)
kind = 44;
break;
case 85:
if (curChar == 111)
jjstateSet[jjnewStateCnt++] = 84;
break;
case 93:
if ((0x2000000020L & l) != 0L)
jjAddStates(49, 50);
break;
case 97:
if ((0x2000000020L & l) != 0L)
jjAddStates(51, 52);
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 6:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 15)
kind = 15;
break;
case 11:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(13, 15);
break;
case 27:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(10, 12);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 101 - (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 & 0x70000L) != 0L)
return 2;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_6(int pos, long active0)
{
return jjMoveNfa_6(jjStopStringLiteralDfa_6(pos, active0), pos + 1);
}
private final 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 final int jjMoveStringLiteralDfa0_6()
{
switch(curChar)
{
case 35:
jjmatchedKind = 17;
return jjMoveStringLiteralDfa1_6(0x50000L);
case 42:
return jjMoveStringLiteralDfa1_6(0x1000000L);
default :
return jjMoveNfa_6(3, 0);
}
}
private final int jjMoveStringLiteralDfa1_6(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_6(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(1, 18);
else if ((active0 & 0x1000000L) != 0L)
return jjStopAtPos(1, 24);
break;
case 42:
if ((active0 & 0x10000L) != 0L)
return jjStartNfaWithStates_6(1, 16, 0);
break;
default :
break;
}
return jjStartNfa_6(0, active0);
}
private final int jjMoveNfa_6(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 12;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 36)
{
if (kind > 13)
kind = 13;
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 > 15)
kind = 15;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 6:
if (curChar == 36 && kind > 13)
kind = 13;
break;
case 8:
if (curChar == 36)
jjCheckNAddTwoStates(9, 10);
break;
case 10:
if (curChar == 33 && kind > 14)
kind = 14;
break;
case 11:
if (curChar != 36)
break;
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(9, 10);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 92)
jjCheckNAddStates(53, 56);
break;
case 1:
if (kind > 15)
kind = 15;
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(57, 58);
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 15)
kind = 15;
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_4(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x70000L) != 0L)
return 2;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_4(int pos, long active0)
{
return jjMoveNfa_4(jjStopStringLiteralDfa_4(pos, active0), pos + 1);
}
private final 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 final int jjMoveStringLiteralDfa0_4()
{
switch(curChar)
{
case 35:
jjmatchedKind = 17;
return jjMoveStringLiteralDfa1_4(0x50000L);
default :
return jjMoveNfa_4(3, 0);
}
}
private final int jjMoveStringLiteralDfa1_4(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_4(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(1, 18);
break;
case 42:
if ((active0 & 0x10000L) != 0L)
return jjStartNfaWithStates_4(1, 16, 0);
break;
default :
break;
}
return jjStartNfa_4(0, active0);
}
private final int jjMoveNfa_4(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 92;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAddStates(59, 64);
}
else if (curChar == 45)
jjCheckNAddStates(65, 68);
else if (curChar == 36)
{
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(26, 27);
}
else if (curChar == 46)
jjCheckNAdd(11);
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 15)
kind = 15;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 10:
if (curChar == 46)
jjCheckNAdd(11);
break;
case 11:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAddTwoStates(11, 12);
break;
case 13:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(14);
break;
case 14:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAdd(14);
break;
case 16:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 57)
kind = 57;
jjstateSet[jjnewStateCnt++] = 16;
break;
case 19:
if ((0x3ff000000000000L & l) != 0L)
jjAddStates(69, 70);
break;
case 23:
if (curChar == 36 && kind > 13)
kind = 13;
break;
case 25:
if (curChar == 36)
jjCheckNAddTwoStates(26, 27);
break;
case 27:
if (curChar == 33 && kind > 14)
kind = 14;
break;
case 28:
if (curChar != 36)
break;
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(26, 27);
break;
case 31:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(71, 73);
break;
case 32:
if ((0x2400L & l) != 0L && kind > 46)
kind = 46;
break;
case 33:
if (curChar == 10 && kind > 46)
kind = 46;
break;
case 34:
case 51:
if (curChar == 13)
jjCheckNAdd(33);
break;
case 42:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(74, 76);
break;
case 43:
if ((0x2400L & l) != 0L && kind > 49)
kind = 49;
break;
case 44:
if (curChar == 10 && kind > 49)
kind = 49;
break;
case 45:
case 67:
if (curChar == 13)
jjCheckNAdd(44);
break;
case 50:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(77, 79);
break;
case 66:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(80, 82);
break;
case 77:
if (curChar == 45)
jjCheckNAddStates(65, 68);
break;
case 78:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAddTwoStates(78, 80);
break;
case 79:
if (curChar == 46 && kind > 52)
kind = 52;
break;
case 80:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 79;
break;
case 81:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(81, 82);
break;
case 82:
if (curChar != 46)
break;
if (kind > 53)
kind = 53;
jjCheckNAddTwoStates(83, 84);
break;
case 83:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAddTwoStates(83, 84);
break;
case 85:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(86);
break;
case 86:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAdd(86);
break;
case 87:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(87, 88);
break;
case 89:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(90);
break;
case 90:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAdd(90);
break;
case 91:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAddStates(59, 64);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 57)
kind = 57;
jjCheckNAdd(16);
}
else if (curChar == 123)
jjAddStates(83, 87);
else if (curChar == 92)
jjCheckNAddStates(88, 91);
if (curChar == 101)
jjAddStates(92, 94);
else if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 18;
else if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 8;
else if (curChar == 105)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 1:
if (kind > 15)
kind = 15;
break;
case 4:
if (curChar == 102 && kind > 47)
kind = 47;
break;
case 5:
if (curChar == 105)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 6:
if (curChar == 112 && kind > 50)
kind = 50;
break;
case 7:
if (curChar == 111)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 8:
if (curChar == 116)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 12:
if ((0x2000000020L & l) != 0L)
jjAddStates(95, 96);
break;
case 15:
case 16:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 57)
kind = 57;
jjCheckNAdd(16);
break;
case 17:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 18;
break;
case 18:
case 19:
if ((0x7fffffe87fffffeL & l) != 0L)
jjCheckNAddTwoStates(19, 20);
break;
case 20:
if (curChar == 125 && kind > 58)
kind = 58;
break;
case 21:
if (curChar == 92)
jjCheckNAddStates(88, 91);
break;
case 22:
if (curChar == 92)
jjCheckNAddTwoStates(22, 23);
break;
case 24:
if (curChar == 92)
jjCheckNAddTwoStates(24, 25);
break;
case 26:
if (curChar == 92)
jjAddStates(97, 98);
break;
case 29:
if (curChar == 101)
jjAddStates(92, 94);
break;
case 30:
if (curChar != 100)
break;
if (kind > 46)
kind = 46;
jjCheckNAddStates(71, 73);
break;
case 35:
if (curChar == 110)
jjstateSet[jjnewStateCnt++] = 30;
break;
case 36:
if (curChar == 102 && kind > 48)
kind = 48;
break;
case 37:
if (curChar == 105)
jjstateSet[jjnewStateCnt++] = 36;
break;
case 38:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 37;
break;
case 39:
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 38;
break;
case 40:
if (curChar == 108)
jjstateSet[jjnewStateCnt++] = 39;
break;
case 41:
if (curChar != 101)
break;
if (kind > 49)
kind = 49;
jjCheckNAddStates(74, 76);
break;
case 46:
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 41;
break;
case 47:
if (curChar == 108)
jjstateSet[jjnewStateCnt++] = 46;
break;
case 48:
if (curChar == 123)
jjAddStates(83, 87);
break;
case 49:
if (curChar != 125)
break;
if (kind > 46)
kind = 46;
jjCheckNAddStates(77, 79);
break;
case 52:
if (curChar == 100)
jjstateSet[jjnewStateCnt++] = 49;
break;
case 53:
if (curChar == 110)
jjstateSet[jjnewStateCnt++] = 52;
break;
case 54:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 53;
break;
case 55:
if (curChar == 125 && kind > 47)
kind = 47;
break;
case 56:
if (curChar == 102)
jjstateSet[jjnewStateCnt++] = 55;
break;
case 57:
if (curChar == 105)
jjstateSet[jjnewStateCnt++] = 56;
break;
case 58:
if (curChar == 125 && kind > 48)
kind = 48;
break;
case 59:
if (curChar == 102)
jjstateSet[jjnewStateCnt++] = 58;
break;
case 60:
if (curChar == 105)
jjstateSet[jjnewStateCnt++] = 59;
break;
case 61:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 60;
break;
case 62:
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 61;
break;
case 63:
if (curChar == 108)
jjstateSet[jjnewStateCnt++] = 62;
break;
case 64:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 63;
break;
case 65:
if (curChar != 125)
break;
if (kind > 49)
kind = 49;
jjCheckNAddStates(80, 82);
break;
case 68:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 65;
break;
case 69:
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 68;
break;
case 70:
if (curChar == 108)
jjstateSet[jjnewStateCnt++] = 69;
break;
case 71:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 70;
break;
case 72:
if (curChar == 125 && kind > 50)
kind = 50;
break;
case 73:
if (curChar == 112)
jjstateSet[jjnewStateCnt++] = 72;
break;
case 74:
if (curChar == 111)
jjstateSet[jjnewStateCnt++] = 73;
break;
case 75:
if (curChar == 116)
jjstateSet[jjnewStateCnt++] = 74;
break;
case 76:
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 75;
break;
case 84:
if ((0x2000000020L & l) != 0L)
jjAddStates(99, 100);
break;
case 88:
if ((0x2000000020L & l) != 0L)
jjAddStates(101, 102);
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 15)
kind = 15;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 92 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_3(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x180000L) != 0L)
return 14;
if ((active0 & 0x70000L) != 0L)
return 29;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_3(int pos, long active0)
{
return jjMoveNfa_3(jjStopStringLiteralDfa_3(pos, active0), pos + 1);
}
private final 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);
}
private final int jjMoveStringLiteralDfa0_3()
{
switch(curChar)
{
case 35:
jjmatchedKind = 17;
return jjMoveStringLiteralDfa1_3(0x50000L);
case 92:
jjmatchedKind = 20;
return jjMoveStringLiteralDfa1_3(0x80000L);
default :
return jjMoveNfa_3(18, 0);
}
}
private final 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 & 0x40000L) != 0L)
return jjStopAtPos(1, 18);
break;
case 42:
if ((active0 & 0x10000L) != 0L)
return jjStartNfaWithStates_3(1, 16, 27);
break;
case 92:
if ((active0 & 0x80000L) != 0L)
return jjStartNfaWithStates_3(1, 19, 30);
break;
default :
break;
}
return jjStartNfa_3(0, active0);
}
private final int jjMoveNfa_3(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 30;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 29:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 27;
break;
case 18:
if ((0xffffffe7ffffffffL & l) != 0L)
{
if (kind > 21)
kind = 21;
jjCheckNAdd(12);
}
else if (curChar == 35)
jjCheckNAddStates(103, 105);
else if (curChar == 36)
{
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(23, 24);
}
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 1);
break;
case 30:
if (curChar == 36)
jjCheckNAddTwoStates(23, 24);
if (curChar == 36)
{
if (kind > 13)
kind = 13;
}
break;
case 14:
if (curChar == 36)
jjCheckNAddTwoStates(23, 24);
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 16;
if (curChar == 36)
{
if (kind > 13)
kind = 13;
}
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(106, 107);
break;
case 4:
if (curChar == 40 && kind > 12)
kind = 12;
break;
case 12:
if ((0xffffffe7ffffffffL & l) == 0L)
break;
if (kind > 21)
kind = 21;
jjCheckNAdd(12);
break;
case 15:
if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 16;
break;
case 17:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 11)
kind = 11;
jjstateSet[jjnewStateCnt++] = 17;
break;
case 20:
if (curChar == 36 && kind > 13)
kind = 13;
break;
case 22:
if (curChar == 36)
jjCheckNAddTwoStates(23, 24);
break;
case 24:
if (curChar == 33 && kind > 14)
kind = 14;
break;
case 25:
if (curChar != 36)
break;
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(23, 24);
break;
case 26:
if (curChar == 35)
jjCheckNAddStates(103, 105);
break;
case 27:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 28;
break;
case 28:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 15)
kind = 15;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 29:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 10;
else if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 18:
if ((0xffffffffefffffffL & l) != 0L)
{
if (kind > 21)
kind = 21;
jjCheckNAdd(12);
}
else if (curChar == 92)
jjCheckNAddStates(108, 111);
if (curChar == 92)
jjAddStates(112, 113);
break;
case 30:
if (curChar == 92)
jjAddStates(112, 113);
if (curChar == 92)
jjCheckNAddTwoStates(21, 22);
if (curChar == 92)
jjCheckNAddTwoStates(19, 20);
break;
case 14:
if (curChar == 92)
jjCheckNAddTwoStates(21, 22);
if (curChar == 92)
jjCheckNAddTwoStates(19, 20);
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 13;
break;
case 2:
if (curChar == 116)
jjCheckNAddTwoStates(3, 4);
break;
case 5:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 6:
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 7:
if (curChar == 125)
jjCheckNAddTwoStates(3, 4);
break;
case 8:
if (curChar == 116)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 9:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 10:
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 11:
if (curChar == 123)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 12:
if ((0xffffffffefffffffL & l) == 0L)
break;
if (kind > 21)
kind = 21;
jjCheckNAdd(12);
break;
case 13:
if (curChar == 92)
jjAddStates(112, 113);
break;
case 16:
case 17:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 11)
kind = 11;
jjCheckNAdd(17);
break;
case 19:
if (curChar == 92)
jjCheckNAddTwoStates(19, 20);
break;
case 21:
if (curChar == 92)
jjCheckNAddTwoStates(21, 22);
break;
case 23:
if (curChar == 92)
jjAddStates(114, 115);
break;
case 28:
if (kind > 15)
kind = 15;
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 18:
case 12:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 21)
kind = 21;
jjCheckNAdd(12);
break;
case 28:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 15)
kind = 15;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 30 - (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 & 0x70000L) != 0L)
return 2;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_7(int pos, long active0)
{
return jjMoveNfa_7(jjStopStringLiteralDfa_7(pos, active0), pos + 1);
}
private final 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 final int jjMoveStringLiteralDfa0_7()
{
switch(curChar)
{
case 35:
jjmatchedKind = 17;
return jjMoveStringLiteralDfa1_7(0x50000L);
case 42:
return jjMoveStringLiteralDfa1_7(0x800000L);
default :
return jjMoveNfa_7(3, 0);
}
}
private final int jjMoveStringLiteralDfa1_7(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_7(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(1, 18);
else if ((active0 & 0x800000L) != 0L)
return jjStopAtPos(1, 23);
break;
case 42:
if ((active0 & 0x10000L) != 0L)
return jjStartNfaWithStates_7(1, 16, 0);
break;
default :
break;
}
return jjStartNfa_7(0, active0);
}
private final int jjMoveNfa_7(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 12;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 36)
{
if (kind > 13)
kind = 13;
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 > 15)
kind = 15;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 6:
if (curChar == 36 && kind > 13)
kind = 13;
break;
case 8:
if (curChar == 36)
jjCheckNAddTwoStates(9, 10);
break;
case 10:
if (curChar == 33 && kind > 14)
kind = 14;
break;
case 11:
if (curChar != 36)
break;
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(9, 10);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 92)
jjCheckNAddStates(53, 56);
break;
case 1:
if (kind > 15)
kind = 15;
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(57, 58);
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 15)
kind = 15;
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_8(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x70000L) != 0L)
return 2;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_8(int pos, long active0)
{
return jjMoveNfa_8(jjStopStringLiteralDfa_8(pos, active0), pos + 1);
}
private final 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 final int jjMoveStringLiteralDfa0_8()
{
switch(curChar)
{
case 35:
jjmatchedKind = 17;
return jjMoveStringLiteralDfa1_8(0x50000L);
default :
return jjMoveNfa_8(3, 0);
}
}
private final 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 & 0x40000L) != 0L)
return jjStopAtPos(1, 18);
break;
case 42:
if ((active0 & 0x10000L) != 0L)
return jjStartNfaWithStates_8(1, 16, 0);
break;
default :
break;
}
return jjStartNfa_8(0, active0);
}
private final int jjMoveNfa_8(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 15;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if ((0x2400L & l) != 0L)
{
if (kind > 22)
kind = 22;
}
else if (curChar == 36)
{
if (kind > 13)
kind = 13;
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 > 15)
kind = 15;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 4:
if ((0x2400L & l) != 0L && kind > 22)
kind = 22;
break;
case 5:
if (curChar == 10 && kind > 22)
kind = 22;
break;
case 6:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 9:
if (curChar == 36 && kind > 13)
kind = 13;
break;
case 11:
if (curChar == 36)
jjCheckNAddTwoStates(12, 13);
break;
case 13:
if (curChar == 33 && kind > 14)
kind = 14;
break;
case 14:
if (curChar != 36)
break;
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(12, 13);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 92)
jjCheckNAddStates(116, 119);
break;
case 1:
if (kind > 15)
kind = 15;
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(120, 121);
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 15)
kind = 15;
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_5(int pos, long active0, long active1)
{
switch (pos)
{
case 0:
if ((active0 & 0x70000L) != 0L)
return 2;
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 62;
return 5;
}
return -1;
case 1:
if ((active0 & 0x10000L) != 0L)
return 0;
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 62;
jjmatchedPos = 1;
return 5;
}
return -1;
case 2:
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 62;
jjmatchedPos = 2;
return 5;
}
return -1;
case 3:
if ((active0 & 0x20000000L) != 0L)
{
jjmatchedKind = 62;
jjmatchedPos = 3;
return 5;
}
if ((active0 & 0x10000000L) != 0L)
return 5;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_5(int pos, long active0, long active1)
{
return jjMoveNfa_5(jjStopStringLiteralDfa_5(pos, active0, active1), pos + 1);
}
private final 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 final int jjMoveStringLiteralDfa0_5()
{
switch(curChar)
{
case 35:
jjmatchedKind = 17;
return jjMoveStringLiteralDfa1_5(0x50000L);
case 102:
return jjMoveStringLiteralDfa1_5(0x20000000L);
case 116:
return jjMoveStringLiteralDfa1_5(0x10000000L);
case 123:
return jjStopAtPos(0, 64);
case 125:
return jjStopAtPos(0, 65);
default :
return jjMoveNfa_5(3, 0);
}
}
private final int jjMoveStringLiteralDfa1_5(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_5(0, active0, 0L);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(1, 18);
break;
case 42:
if ((active0 & 0x10000L) != 0L)
return jjStartNfaWithStates_5(1, 16, 0);
break;
case 97:
return jjMoveStringLiteralDfa2_5(active0, 0x20000000L);
case 114:
return jjMoveStringLiteralDfa2_5(active0, 0x10000000L);
default :
break;
}
return jjStartNfa_5(0, active0, 0L);
}
private final int jjMoveStringLiteralDfa2_5(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_5(0, old0, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_5(1, active0, 0L);
return 2;
}
switch(curChar)
{
case 108:
return jjMoveStringLiteralDfa3_5(active0, 0x20000000L);
case 117:
return jjMoveStringLiteralDfa3_5(active0, 0x10000000L);
default :
break;
}
return jjStartNfa_5(1, active0, 0L);
}
private final int jjMoveStringLiteralDfa3_5(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_5(1, old0, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_5(2, active0, 0L);
return 3;
}
switch(curChar)
{
case 101:
if ((active0 & 0x10000000L) != 0L)
return jjStartNfaWithStates_5(3, 28, 5);
break;
case 115:
return jjMoveStringLiteralDfa4_5(active0, 0x20000000L);
default :
break;
}
return jjStartNfa_5(2, active0, 0L);
}
private final int jjMoveStringLiteralDfa4_5(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_5(2, old0, 0L);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_5(3, active0, 0L);
return 4;
}
switch(curChar)
{
case 101:
if ((active0 & 0x20000000L) != 0L)
return jjStartNfaWithStates_5(4, 29, 5);
break;
default :
break;
}
return jjStartNfa_5(3, active0, 0L);
}
private final int jjMoveNfa_5(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 16;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if (curChar == 36)
{
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(13, 14);
}
else if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 7;
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 15)
kind = 15;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 5:
if ((0x3ff200000000000L & l) == 0L)
break;
if (kind > 62)
kind = 62;
jjstateSet[jjnewStateCnt++] = 5;
break;
case 6:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 10:
if (curChar == 36 && kind > 13)
kind = 13;
break;
case 12:
if (curChar == 36)
jjCheckNAddTwoStates(13, 14);
break;
case 14:
if (curChar == 33 && kind > 14)
kind = 14;
break;
case 15:
if (curChar != 36)
break;
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(13, 14);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 62)
kind = 62;
jjCheckNAdd(5);
}
else if (curChar == 92)
jjCheckNAddStates(122, 125);
break;
case 1:
if (kind > 15)
kind = 15;
break;
case 4:
case 5:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 62)
kind = 62;
jjCheckNAdd(5);
break;
case 7:
if ((0x7fffffe07fffffeL & l) != 0L && kind > 63)
kind = 63;
break;
case 8:
if (curChar == 92)
jjCheckNAddStates(122, 125);
break;
case 9:
if (curChar == 92)
jjCheckNAddTwoStates(9, 10);
break;
case 11:
if (curChar == 92)
jjCheckNAddTwoStates(11, 12);
break;
case 13:
if (curChar == 92)
jjAddStates(95, 96);
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 15)
kind = 15;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 16 - (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)
{
switch (pos)
{
case 0:
if ((active0 & 0x70000L) != 0L)
return 2;
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 62;
return 28;
}
if ((active0 & 0x10L) != 0L)
return 58;
return -1;
case 1:
if ((active0 & 0x10000L) != 0L)
return 0;
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 62;
jjmatchedPos = 1;
return 28;
}
return -1;
case 2:
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 62;
jjmatchedPos = 2;
return 28;
}
return -1;
case 3:
if ((active0 & 0x10000000L) != 0L)
return 28;
if ((active0 & 0x20000000L) != 0L)
{
jjmatchedKind = 62;
jjmatchedPos = 3;
return 28;
}
return -1;
default :
return -1;
}
}
private final int jjStartNfa_1(int pos, long active0)
{
return jjMoveNfa_1(jjStopStringLiteralDfa_1(pos, active0), pos + 1);
}
private final 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 final int jjMoveStringLiteralDfa0_1()
{
switch(curChar)
{
case 35:
jjmatchedKind = 17;
return jjMoveStringLiteralDfa1_1(0x50000L);
case 41:
return jjStopAtPos(0, 10);
case 44:
return jjStopAtPos(0, 3);
case 46:
return jjMoveStringLiteralDfa1_1(0x10L);
case 58:
return jjStopAtPos(0, 5);
case 91:
return jjStopAtPos(0, 1);
case 93:
return jjStopAtPos(0, 2);
case 102:
return jjMoveStringLiteralDfa1_1(0x20000000L);
case 116:
return jjMoveStringLiteralDfa1_1(0x10000000L);
case 123:
return jjStopAtPos(0, 6);
case 125:
return jjStopAtPos(0, 7);
default :
return jjMoveNfa_1(3, 0);
}
}
private final int jjMoveStringLiteralDfa1_1(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_1(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x40000L) != 0L)
return jjStopAtPos(1, 18);
break;
case 42:
if ((active0 & 0x10000L) != 0L)
return jjStartNfaWithStates_1(1, 16, 0);
break;
case 46:
if ((active0 & 0x10L) != 0L)
return jjStopAtPos(1, 4);
break;
case 97:
return jjMoveStringLiteralDfa2_1(active0, 0x20000000L);
case 114:
return jjMoveStringLiteralDfa2_1(active0, 0x10000000L);
default :
break;
}
return jjStartNfa_1(0, active0);
}
private final int jjMoveStringLiteralDfa2_1(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_1(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_1(1, active0);
return 2;
}
switch(curChar)
{
case 108:
return jjMoveStringLiteralDfa3_1(active0, 0x20000000L);
case 117:
return jjMoveStringLiteralDfa3_1(active0, 0x10000000L);
default :
break;
}
return jjStartNfa_1(1, active0);
}
private final int jjMoveStringLiteralDfa3_1(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_1(1, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_1(2, active0);
return 3;
}
switch(curChar)
{
case 101:
if ((active0 & 0x10000000L) != 0L)
return jjStartNfaWithStates_1(3, 28, 28);
break;
case 115:
return jjMoveStringLiteralDfa4_1(active0, 0x20000000L);
default :
break;
}
return jjStartNfa_1(2, active0);
}
private final int jjMoveStringLiteralDfa4_1(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_1(2, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_1(3, active0);
return 4;
}
switch(curChar)
{
case 101:
if ((active0 & 0x20000000L) != 0L)
return jjStartNfaWithStates_1(4, 29, 28);
break;
default :
break;
}
return jjStartNfa_1(3, active0);
}
private final int jjMoveNfa_1(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 59;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAddStates(126, 131);
}
else if ((0x100002600L & l) != 0L)
{
if (kind > 26)
kind = 26;
jjCheckNAdd(4);
}
else if (curChar == 46)
jjCheckNAddTwoStates(48, 58);
else if (curChar == 45)
jjCheckNAddStates(132, 135);
else if (curChar == 36)
{
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(34, 35);
}
else if (curChar == 39)
jjCheckNAddStates(136, 138);
else if (curChar == 34)
jjCheckNAddStates(139, 141);
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 58:
case 48:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAddTwoStates(48, 49);
break;
case 0:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 15)
kind = 15;
break;
case 2:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 4:
if ((0x100002600L & l) == 0L)
break;
if (kind > 26)
kind = 26;
jjCheckNAdd(4);
break;
case 5:
if (curChar == 34)
jjCheckNAddStates(139, 141);
break;
case 6:
if ((0xfffffffbffffffffL & l) != 0L)
jjCheckNAddStates(139, 141);
break;
case 7:
if (curChar == 34 && kind > 27)
kind = 27;
break;
case 9:
if ((0x8400000000L & l) != 0L)
jjCheckNAddStates(139, 141);
break;
case 10:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(142, 145);
break;
case 11:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(139, 141);
break;
case 12:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 13;
break;
case 13:
if ((0xff000000000000L & l) != 0L)
jjCheckNAdd(11);
break;
case 15:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 16;
break;
case 16:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 17;
break;
case 17:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 18;
break;
case 18:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(139, 141);
break;
case 19:
if (curChar == 32)
jjAddStates(69, 70);
break;
case 20:
if (curChar == 10)
jjCheckNAddStates(139, 141);
break;
case 21:
if (curChar == 39)
jjCheckNAddStates(136, 138);
break;
case 22:
if ((0xffffff7fffffffffL & l) != 0L)
jjCheckNAddStates(136, 138);
break;
case 24:
if (curChar == 32)
jjAddStates(23, 24);
break;
case 25:
if (curChar == 10)
jjCheckNAddStates(136, 138);
break;
case 26:
if (curChar == 39 && kind > 27)
kind = 27;
break;
case 28:
if ((0x3ff200000000000L & l) == 0L)
break;
if (kind > 62)
kind = 62;
jjstateSet[jjnewStateCnt++] = 28;
break;
case 31:
if (curChar == 36 && kind > 13)
kind = 13;
break;
case 33:
if (curChar == 36)
jjCheckNAddTwoStates(34, 35);
break;
case 35:
if (curChar == 33 && kind > 14)
kind = 14;
break;
case 36:
if (curChar != 36)
break;
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(34, 35);
break;
case 37:
if (curChar == 45)
jjCheckNAddStates(132, 135);
break;
case 38:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAddTwoStates(38, 40);
break;
case 39:
if (curChar == 46 && kind > 52)
kind = 52;
break;
case 40:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 39;
break;
case 41:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(41, 42);
break;
case 42:
if (curChar != 46)
break;
if (kind > 53)
kind = 53;
jjCheckNAddTwoStates(43, 44);
break;
case 43:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAddTwoStates(43, 44);
break;
case 45:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(46);
break;
case 46:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAdd(46);
break;
case 47:
if (curChar == 46)
jjCheckNAdd(48);
break;
case 50:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(51);
break;
case 51:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAdd(51);
break;
case 52:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(52, 53);
break;
case 54:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(55);
break;
case 55:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 53)
kind = 53;
jjCheckNAdd(55);
break;
case 56:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAddStates(126, 131);
break;
case 57:
if (curChar == 46)
jjCheckNAddTwoStates(48, 58);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 62)
kind = 62;
jjCheckNAdd(28);
}
else if (curChar == 92)
jjCheckNAddStates(146, 149);
break;
case 58:
if ((0x7fffffe07fffffeL & l) != 0L && kind > 63)
kind = 63;
break;
case 1:
if (kind > 15)
kind = 15;
break;
case 6:
if ((0xffffffffefffffffL & l) != 0L)
jjCheckNAddStates(139, 141);
break;
case 8:
if (curChar == 92)
jjAddStates(150, 155);
break;
case 9:
if ((0x14404410000000L & l) != 0L)
jjCheckNAddStates(139, 141);
break;
case 14:
if (curChar == 117)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 15:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 16;
break;
case 16:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 17;
break;
case 17:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 18;
break;
case 18:
if ((0x7e0000007eL & l) != 0L)
jjCheckNAddStates(139, 141);
break;
case 22:
jjAddStates(136, 138);
break;
case 23:
if (curChar == 92)
jjAddStates(23, 24);
break;
case 27:
case 28:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 62)
kind = 62;
jjCheckNAdd(28);
break;
case 29:
if (curChar == 92)
jjCheckNAddStates(146, 149);
break;
case 30:
if (curChar == 92)
jjCheckNAddTwoStates(30, 31);
break;
case 32:
if (curChar == 92)
jjCheckNAddTwoStates(32, 33);
break;
case 34:
if (curChar == 92)
jjAddStates(156, 157);
break;
case 44:
if ((0x2000000020L & l) != 0L)
jjAddStates(158, 159);
break;
case 49:
if ((0x2000000020L & l) != 0L)
jjAddStates(160, 161);
break;
case 53:
if ((0x2000000020L & l) != 0L)
jjAddStates(162, 163);
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 15)
kind = 15;
break;
case 6:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(139, 141);
break;
case 22:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(136, 138);
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_2(int pos, long active0, long active1)
{
switch (pos)
{
case 0:
if ((active0 & 0x70000L) != 0L)
return 2;
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 62;
return 5;
}
return -1;
case 1:
if ((active0 & 0x10000L) != 0L)
return 0;
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 62;
jjmatchedPos = 1;
return 5;
}
return -1;
case 2:
if ((active0 & 0x30000000L) != 0L)
{
jjmatchedKind = 62;
jjmatchedPos = 2;
return 5;
}
return -1;
case 3:
if ((active0 & 0x20000000L) != 0L)
{
jjmatchedKind = 62;
jjmatchedPos = 3;
return 5;
}
if ((active0 & 0x10000000L) != 0L)
return 5;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_2(int pos, long active0, long active1)
{
return jjMoveNfa_2(jjStopStringLiteralDfa_2(pos, active0, active1), pos + 1);
}
private final int jjStartNfaWithStates_2(int pos, int kind, int state)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
try { curChar = input_str