javaCC_字符串解析的强大工具

/* Generated By:JJTree&JavaCC: Do not edit this line. eg1TokenManager.java */ public class eg1TokenManager implements eg1Constants { public static java.io.PrintStream debugStream = System.out; public static void setDebugStream(java.io.PrintStream ds) { debugStream = ds; } private static final int jjStopStringLiteralDfa_0(int pos, long active0) { switch (pos) { default : return -1; } } private static final int jjStartNfa_0(int pos, long active0) { return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1); } static private final int jjStopAtPos(int pos, int kind) { jjmatchedKind = kind; jjmatchedPos = pos; return pos + 1; } static private final int jjStartNfaWithStates_0(int pos, int kind, int state) { jjmatchedKind = kind; jjmatchedPos = pos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return pos + 1; } return jjMoveNfa_0(state, pos + 1); } static private final int jjMoveStringLiteralDfa0_0() { switch(curChar) { case 37: return jjStopAtPos(0, 19); case 40: return jjStopAtPos(0, 20); case 41: return jjStopAtPos(0, 21); case 42: return jjStopAtPos(0, 17); case 43: return jjStopAtPos(0, 15); case 45: return jjStopAtPos(0, 16); case 47: return jjStartNfaWithStates_0(0, 18, 10); case 59: return jjStopAtPos(0, 14); default : return jjMoveNfa_0(0, 0); } } static private final void jjCheckNAdd(int state) { if (jjrounds[state] != jjround) { jjstateSet[jjnewStateCnt++] = state; jjrounds[state] = jjround; } } static private final void jjAddStates(int start, int end) { do { jjstateSet[jjnewStateCnt++] = jjnextStates[start]; } while (start++ != end); } static private final void jjCheckNAddTwoStates(int state1, int state2) { jjCheckNAdd(state1); jjCheckNAdd(state2); } static private final void jjCheckNAddStates(int start, int end) { do { jjCheckNAdd(jjnextStates[start]); } while (start++ != end); } static private final void jjCheckNAddStates(int start) { jjCheckNAdd(jjnextStates[start]); jjCheckNAdd(jjnextStates[start + 1]); } static final long[] jjbitVec0 = { 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL }; static private final int jjMoveNfa_0(int startState, int curPos) { int[] nextStates; int startsAt = 0; jjnewStateCnt = 21; 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 10: if (curChar == 42) jjCheckNAddTwoStates(16, 17); else if (curChar == 47) jjCheckNAddStates(0, 2); break; case 0: if ((0x3fe000000000000L & l) != 0L) { if (kind > 7) kind = 7; jjCheckNAddTwoStates(1, 2); } else if (curChar == 47) jjAddStates(3, 4); else if (curChar == 48) { if (kind > 7) kind = 7; jjCheckNAddStates(5, 7); } break; case 1: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAddTwoStates(1, 2); break; case 4: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 11) kind = 11; jjstateSet[jjnewStateCnt++] = 4; break; case 5: if (curChar != 48) break; if (kind > 7) kind = 7; jjCheckNAddStates(5, 7); break; case 7: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAddTwoStates(7, 2); break; case 8: if ((0xff000000000000L & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAddTwoStates(8, 2); break; case 9: if (curChar == 47) jjAddStates(3, 4); break; case 11: if ((0xffffffffffffdbffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 12: if ((0x2400L & l) != 0L && kind > 5) kind = 5; break; case 13: if (curChar == 10 && kind > 5) kind = 5; break; case 14: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 13; break; case 15: if (curChar == 42) jjCheckNAddTwoStates(16, 17); break; case 16: if ((0xfffffbffffffffffL & l) != 0L) jjCheckNAddTwoStates(16, 17); break; case 17: if (curChar == 42) jjAddStates(8, 9); break; case 18: if ((0xffff7fffffffffffL & l) != 0L) jjCheckNAddTwoStates(19, 17); break; case 19: if ((0xfffffbffffffffffL & l) != 0L) jjCheckNAddTwoStates(19, 17); break; case 20: if (curChar == 47 && kind > 6) kind = 6; break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 0: case 4: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 11) kind = 11; jjCheckNAdd(4); break; case 2: if ((0x100000001000L & l) != 0L && kind > 7) kind = 7; break; case 6: if ((0x100000001000000L & l) != 0L) jjCheckNAdd(7); break; case 7: if ((0x7e0000007eL & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAddTwoStates(7, 2); break; case 11: jjAddStates(0, 2); break; case 16: jjCheckNAddTwoStates(16, 17); break; case 18: case 19: jjCheckNAddTwoStates(19, 17); break; default : break; } } while(i != startsAt); } else { int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (