考试系统--生成试卷、授权、得分，手工阅卷，自动阅卷。-springmvc.zip

/* Generated By:JavaCC: Do not edit this line. JSONParserTokenManager.java */ package com.baidu.yun.core.json; // import java.io.StringReader; import java.util.Map; import java.util.HashMap; import java.util.List; import java.util.ArrayList; /** Token Manager. */ public class JSONParserTokenManager implements JSONParserConstants { /** Debug output. */ public java.io.PrintStream debugStream = System.out; /** Set debug output. */ public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; } private final int jjStopStringLiteralDfa_0(int pos, long active0) { switch (pos) { case 0: if ((active0 & 0xe0L) != 0L) { jjmatchedKind = 15; return 28; } return -1; case 1: if ((active0 & 0xe0L) != 0L) { jjmatchedKind = 15; jjmatchedPos = 1; return 28; } return -1; case 2: if ((active0 & 0xe0L) != 0L) { jjmatchedKind = 15; jjmatchedPos = 2; return 28; } return -1; case 3: if ((active0 & 0xa0L) != 0L) return 28; if ((active0 & 0x40L) != 0L) { jjmatchedKind = 15; jjmatchedPos = 3; return 28; } return -1; default: return -1; } } private final int jjStartNfa_0(int pos, long active0) { return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1); } private int jjStopAtPos(int pos, int kind) { jjmatchedKind = kind; jjmatchedPos = pos; return pos + 1; } private int jjMoveStringLiteralDfa0_0() { switch (curChar) { case 44: return jjStopAtPos(0, 20); case 58: return jjStopAtPos(0, 19); case 91: return jjStopAtPos(0, 22); case 93: return jjStopAtPos(0, 23); case 102: return jjMoveStringLiteralDfa1_0(0x40L); case 110: return jjMoveStringLiteralDfa1_0(0x80L); case 116: return jjMoveStringLiteralDfa1_0(0x20L); case 123: return jjStopAtPos(0, 18); case 125: return jjStopAtPos(0, 21); default: return jjMoveNfa_0(0, 0); } } private int jjMoveStringLiteralDfa1_0(long active0) { try { curChar = input_stream.readChar(); } catch (java.io.IOException e) { jjStopStringLiteralDfa_0(0, active0); return 1; } switch (curChar) { case 97: return jjMoveStringLiteralDfa2_0(active0, 0x40L); case 114: return jjMoveStringLiteralDfa2_0(active0, 0x20L); case 117: return jjMoveStringLiteralDfa2_0(active0, 0x80L); default: break; } return jjStartNfa_0(0, active0); } private int jjMoveStringLiteralDfa2_0(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_0(0, old0); try { curChar = input_stream.readChar(); } catch (java.io.IOException e) { jjStopStringLiteralDfa_0(1, active0); return 2; } switch (curChar) { case 108: return jjMoveStringLiteralDfa3_0(active0, 0xc0L); case 117: return jjMoveStringLiteralDfa3_0(active0, 0x20L); default: break; } return jjStartNfa_0(1, active0); } private int jjMoveStringLiteralDfa3_0(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_0(1, old0); try { curChar = input_stream.readChar(); } catch (java.io.IOException e) { jjStopStringLiteralDfa_0(2, active0); return 3; } switch (curChar) { case 101: if ((active0 & 0x20L) != 0L) return jjStartNfaWithStates_0(3, 5, 28); break; case 108: if ((active0 & 0x80L) != 0L) return jjStartNfaWithStates_0(3, 7, 28); break; case 115: return jjMoveStringLiteralDfa4_0(active0, 0x40L); default: break; } return jjStartNfa_0(2, active0); } private int jjMoveStringLiteralDfa4_0(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_0(2, old0); try { curChar = input_stream.readChar(); } catch (java.io.IOException e) { jjStopStringLiteralDfa_0(3, active0); return 4; } switch (curChar) { case 101: if ((active0 & 0x40L) != 0L) return jjStartNfaWithStates_0(4, 6, 28); break; default: break; } return jjStartNfa_0(3, active0); } private int jjStartNfaWithStates_0(int pos, int kind, int state) { jjmatchedKind = kind; jjmatchedPos = pos; try { curChar = input_stream.readChar(); } catch (java.io.IOException e) { return pos + 1; } return jjMoveNfa_0(state, pos + 1); } static final long[] jjbitVec0 = { 0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL }; static final long[] jjbitVec2 = { 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL }; static final long[] jjbitVec3 = { 0x1ff00000fffffffeL, 0xffffffffffffc000L, 0xffffffffL, 0x600000000000000L }; static final long[] jjbitVec4 = { 0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL }; static final long[] jjbitVec5 = { 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL }; static final long[] jjbitVec6 = { 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffL, 0x0L }; static final long[] jjbitVec7 = { 0xffffffffffffffffL, 0xffffffffffffffffL, 0x0L, 0x0L }; static final long[] jjbitVec8 = { 0x3fffffffffffL, 0x0L, 0x0L, 0x0L }; private int jjMoveNfa_0(int startState, int curPos) { int startsAt = 0; jjnewStateCnt = 48; 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 0: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(0, 6); else if (curChar == 36) { if (kind > 15) kind = 15; jjCheckNAdd(28); } else if (curChar == 39) jjCheckNAddStates(7, 9); else if (curChar == 34) jjCheckNAddStates(10, 12); else if (curChar == 46) jjCheckNAdd(4); if ((0x3fe000000000000L & l) != 0L) { if (kind > 8) kind = 8; jjCheckNAddTwoStates(1, 2); } else if (curChar == 48) { if (kind > 8) kind = 8; jjCheckNAddStates(13, 15); } break; case 1: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 8) kind = 8; jjChe