/* Generated By:JavaCC: Do not edit this line. ParserTokenManager.java */ import edu.neu.ccs.demeter.*; public class ParserTokenManager implements ParserConstants { private final int jjStopStringLiteralDfa_0(int pos, long active0) { switch (pos) { case 0: if ((active0 & 0x180003f9aL) != 0L) { jjmatchedKind = 33; return 43; } if ((active0 & 0x4000L) != 0L) return 27; return -1; case 1: if ((active0 & 0x180003f9aL) != 0L) { jjmatchedKind = 33; jjmatchedPos = 1; return 43; } return -1; case 2: if ((active0 & 0x180003e10L) != 0L) { if (jjmatchedPos != 2) { jjmatchedKind = 33; jjmatchedPos = 2; } return 43; } if ((active0 & 0x18aL) != 0L) return 43; return -1; case 3: if ((active0 & 0x80000010L) != 0L) return 43; if ((active0 & 0x100003f02L) != 0L) { jjmatchedKind = 33; jjmatchedPos = 3; return 43; } return -1; case 4: if ((active0 & 0x100000400L) != 0L) return 43; if ((active0 & 0x3b02L) != 0L) { jjmatchedKind = 33; jjmatchedPos = 4; return 43; } return -1; case 5: if ((active0 & 0x1100L) != 0L) { jjmatchedKind = 33; jjmatchedPos = 5; return 43; } if ((active0 & 0x2a02L) != 0L) return 43; return -1; case 6: if ((active0 & 0x100L) != 0L) return 43; if ((active0 & 0x1000L) != 0L) { jjmatchedKind = 33; jjmatchedPos = 6; return 43; } return -1; case 7: if ((active0 & 0x1000L) != 0L) { jjmatchedKind = 33; jjmatchedPos = 7; return 43; } return -1; case 8: if ((active0 & 0x1000L) != 0L) { jjmatchedKind = 33; jjmatchedPos = 8; return 43; } return -1; case 9: if ((active0 & 0x1000L) != 0L) { jjmatchedKind = 33; jjmatchedPos = 9; return 43; } 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 40: return jjStartNfaWithStates_0(0, 14, 27); case 41: return jjStopAtPos(0, 15); case 44: return jjStopAtPos(0, 16); case 61: return jjStopAtPos(0, 2); case 91: return jjStopAtPos(0, 5); case 93: return jjStopAtPos(0, 6); case 98: return jjMoveStringLiteralDfa1_0(0x200L); case 99: return jjMoveStringLiteralDfa1_0(0x3000L); case 100: return jjMoveStringLiteralDfa1_0(0x10aL); case 101: return jjMoveStringLiteralDfa1_0(0x80L); case 102: return jjMoveStringLiteralDfa1_0(0x100000000L); case 103: return jjMoveStringLiteralDfa1_0(0xc00L); case 105: return jjMoveStringLiteralDfa1_0(0x10L); case 116: return jjMoveStringLiteralDfa1_0(0x80000000L); 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 97: return jjMoveStringLiteralDfa2_0(active0, 0x100000000L); case 110: return jjMoveStringLiteralDfa2_0(active0, 0x90L); case 111: return jjMoveStringLiteralDfa2_0(active0, 0x310aL); case 114: return jjMoveStringLiteralDfa2_0(active0, 0x80000e00L); 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 100: if ((active0 & 0x80L) != 0L) return jjStartNfaWithStates_0(2, 7, 43); break; case 105: return jjMoveStringLiteralDfa3_0(active0, 0x210L); case 108: return jjMoveStringLiteralDfa3_0(active0, 0x100000000L); case 109: if ((active0 & 0x8L) != 0L) { jjmatchedKind = 3; jjmatchedPos = 2; } return jjMoveStringLiteralDfa3_0(active0, 0x3102L); case 111: return jjMoveStringLiteralDfa3_0(active0, 0x400L); case 112: return jjMoveStringLiteralDfa3_0(active0, 0x800L); case 117: return jjMoveStringLiteralDfa3_0(active0, 0x80000000L); 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 97: return jjMoveStringLiteralDfa4_0(active0, 0x2L); case 100: return jjMoveStringLiteralDfa4_0(active0, 0x300L); case 101: if ((active0 & 0x80000000L) != 0L) return jjStartNfaWithStates_0(3, 31, 43); return jjMoveStringLiteralDfa4_0(active0, 0x2800L); case 112: return jjMoveStringLiteralDfa4_0(active0, 0x1000L); case 115: return jjMoveStringLiteralDfa4_0(active0, 0x100000000L); case 116: if ((active0 & 0x10L) != 0L) return jjStartNfaWithStates_0(3, 4, 43); break; case 117: return jjMoveStringLiteralDfa4_0(active0, 0x400L); 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 97: return jjMoveStringLiteralDfa5_0(active0, 0x1000L); case 101: if ((active0 & 0x100000000L) != 0L) return jjStartNfaWithStates_0(4, 32, 43); return jjMoveStringLiteralDfa5_0(active0, 0x100L); case 103: return jjMoveStringLiteralDfa5_0(active0, 0x200L); case 105: return jjMoveStringLiteralDfa5_0(active0, 0x2L); case 112: if ((active0 & 0x400L) != 0L) return jjStartNfaWithStates_0(4, 10, 43); break; case 120: return jjMoveStringLiteralDfa5_0(active0, 0x2800L); default : break; } return jjStartNfa_0(3, active0); } private final int jjMoveStringLiteralDfa5_0(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_0(3, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(4, active0); return 5; } switch(curChar) { case 101: if ((active0 & 0x200L) != 0L) return jjStartNfaWithStates_0(5, 9, 43); break; case 110: if ((active0 & 0x2L) != 0L) return jjStartNfaWithStates_0(5, 1, 43); break; case 112: if ((active0 & 0x800L) != 0L) return jjStartNfaWithStates_0(5, 11, 43); else if ((active0 & 0x2000L) != 0L) return jjStartNfaWithStates_0(5, 13, 43); break; case 114: return jjMoveStringLiteralDfa6_0(active0, 0x1000L); case 115: return jjMoveStringLiteralDfa6_0(active0, 0x100L); default : break; } return jjStartNfa_0(4, active0); } private final int jjMoveStringLiteralDfa6_0(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_0(4, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(5, active0); return 6; } switch(curChar) { case 99: if ((active0 & 0x100L) != 0L) return jjStartNfaWithStates_0(6, 8, 43); break; case 116: return jjMoveStringLiteralDfa7_0(active0, 0x1000L); default : break; } return jjStartNfa_0(5, active0); } private final int jjMoveStringLiteralDfa7_0(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_0(5, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(6, active0); return 7; } switch(curChar) { case 109: return jjMoveStringLiteralDfa8_0(active0, 0x1000L); default : break; } return jjStartNfa_0(6, active0); } private final int jjMoveStringLiteralDfa8_0(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_0(6, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(7, active0); return 8; } switch(curChar) { case 101: return jjMoveStringLiteralDfa9_0(active0, 0x1000L); default : break; } return jjStartNfa_0(7, active0); } private final int jjMoveStringLiteralDfa9_0(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_0(7, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(8, active0); return 9; } switch(curChar) { case 110: return jjMoveStringLiteralDfa10_0(active0, 0x1000L); default : break; } return jjStartNfa_0(8, active0); } private final int jjMoveStringLiteralDfa10_0(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_0(8, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(9, active0); return 10; } switch(curChar) { case 116: if ((active0 & 0x1000L) != 0L) return jjStartNfaWithStates_0(10, 12, 43); break; default : break; } return jjStartNfa_0(9, 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 }; 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 final int jjMoveNfa_0(int startState, int curPos) { int[] nextStates; int startsAt = 0; jjnewStateCnt = 77; 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) jjCheckNAddStates(0, 6); else if (curChar == 47) jjAddStates(7, 8); else if (curChar == 36) { if (kind > 33) kind = 33; jjCheckNAdd(43); } else if (curChar == 40) jjstateSet[jjnewStateCnt++] = 27; else if (curChar == 34) jjCheckNAddStates(9, 11); else if (curChar == 39) jjAddStates(12, 13); else if (curChar == 46) jjCheckNAdd(4); if ((0x3fe000000000000L & l) != 0L) { if (kind > 23) kind = 23; jjCheckNAddTwoStates(1, 2); } else if (curChar == 48) { if (kind > 25) kind = 25; jjCheckNAddStates(14, 16); } break; case 1: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(1, 2); break; case 3: if (curChar == 46) jjCheckNAdd(4); break; case 4: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 26) kind = 26; jjCheckNAddStates(17, 19); break; case 6: if ((0x280000000000L & l) != 0L) jjCheckNAdd(7); break; case 7: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 26) kind = 26; jjCheckNAddTwoStates(7, 8); break; case 9: if (curChar == 39) jjAddStates(12, 13); break; case 10: if ((0xffffff7fffffdbffL & l) != 0L) jjCheckNAdd(11); break; case 11: if (curChar == 39 && kind > 28) kind = 28; break; case 13: if ((0x8400000000L & l) != 0L) jjCheckNAdd(11); break; case 14: if ((0xff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 11); break; case 15: if ((0xff000000000000L & l) != 0L) jjCheckNAdd(11); break; case 16: if ((0xf000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0xff000000000000L & l) != 0L) jjCheckNAdd(15); break; case 18: if (curChar == 34) jjCheckNAddStates(9, 11); break; case 19: if ((0xfffffffbffffdbffL & l) != 0L) jjCheckNAddStates(9, 11); break; case 21: if ((0x8400000000L & l) != 0L) jjCheckNAddStates(9, 11); break; case 22: if (curChar == 34 && kind > 29) kind = 29; break; case 23: if ((0xff000000000000L & l) != 0L) jjCheckNAddStates(20, 23); break; case 24: if ((0xff000000000000L & l) != 0L) jjCheckNAddStates(9, 11); break; case 25: if ((0xf000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 26; break; case 26: if ((0xff000000000000L & l) != 0L) jjCheckNAdd(24); break; case 28: jjCheckNAddStates(24, 26); break; case 30: if ((0xfffffdffffffffffL & l) != 0L) jjCheckNAddStates(27, 29); break; case 31: jjCheckNAddStates(27, 29); break; case 32: if (curChar == 41 && kind > 30) kind = 30; break; case 34: if (curChar == 40) jjstateSet[jjnewStateCnt++] = 27; break; case 36: jjCheckNAddStates(30, 32); break; case 38: jjCheckNAddStates(33, 35); break; case 42: if (curChar != 36) break; if (kind > 33) kind = 33; jjCheckNAdd(43); break; case 43: if ((0x3ff001000000000L & l) == 0L) break; if (kind > 33) kind = 33; jjCheckNAdd(43); break; case 44: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(0, 6); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(45, 46); break; case 46: if (curChar == 46) jjCheckNAdd(47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 26) kind = 26; jjCheckNAddStates(36, 38); break; case 49: if ((0x280000000000L & l) != 0L) jjCheckNAdd(50); break; case 50: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 26) kind = 26; jjCheckNAddTwoStates(50, 8); break; case 51: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(51, 52); break; case 53: if ((0x280000000000L & l) != 0L) jjCheckNAdd(54); break; case 54: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 26) kind = 26; jjCheckNAddTwoStates(54, 8); break; case 55: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(39, 41); break; case 57: if ((0x280000000000L & l) != 0L) jjCheckNAdd(58); break; case 58: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(58, 8); break; case 59: if (curChar == 47) jjAddStates(7, 8); break; case 60: if (curChar == 47) jjCheckNAddStates(42, 44); break; case 61: if ((0xffffffffffffdbffL & l) != 0L) jjCheckNAddStates(42, 44); break; case 62: case 63: if (curChar == 10 && kind > 21) kind = 21; break; case 64: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 63; break; case 65: if (curChar == 42) jjCheckNAddTwoStates(66, 67); break; case 66: if ((0xfffffbffffffffffL & l) != 0L) jjCheckNAddTwoStates(66, 67); break; case 67: if (curChar == 42) jjAddStates(45, 46); break; case 68: if ((0xffff7fffffffffffL & l) != 0L) jjCheckNAddTwoStates(69, 67); break; case 69: if ((0xfffffbffffffffffL & l) != 0L) jjCheckNAddTwoStates(69, 67); break; case 70: if (curChar == 47 && kind > 22) kind = 22; break; case 71: if (curChar != 48) break; if (kind > 25) kind = 25; jjCheckNAddStates(14, 16); break; case 73: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 24) kind = 24; jjAddStates(47, 48); break; case 75: if ((0xff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddTwoStates(75, 76); 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 > 33) kind = 33; jjCheckNAdd(43); } else if (curChar == 123) jjstateSet[jjnewStateCnt++] = 35; break; case 2: if ((0x100000001000L & l) != 0L && kind > 23) kind = 23; break; case 5: if ((0x2000000020L & l) != 0L) jjAddStates(49, 50); break; case 8: if ((0x5000000050L & l) != 0L && kind > 26) kind = 26; break; case 10: if ((0xffffffffefffffffL & l) != 0L) jjCheckNAdd(11); break; case 12: if (curChar == 92) jjAddStates(51, 53); break; case 13: if ((0x14404410000000L & l) != 0L) jjCheckNAdd(11); break; case 19: if ((0xffffffffefffffffL & l) != 0L) jjCheckNAddStates(9, 11); break; case 20: if (curChar == 92) jjAddStates(54, 56); break; case 21: if ((0x14404410000000L & l) != 0L) jjCheckNAddStates(9, 11); break; case 27: if (curChar == 64) jjCheckNAddStates(24, 26); break; case 28: if ((0xfffffffffffffffeL & l) != 0L) jjCheckNAddStates(24, 26); break; case 29: if (curChar == 64) jjstateSet[jjnewStateCnt++] = 30; break; case 30: jjCheckNAddStates(27, 29); break; case 31: if ((0xfffffffffffffffeL & l) != 0L) jjCheckNAddStates(27, 29); break; case 33: if (curChar == 64) jjstateSet[jjnewStateCnt++] = 32; break; case 35: if (curChar == 123) jjCheckNAddStates(30, 32); break; case 36: if ((0xdfffffffffffffffL & l) != 0L) jjCheckNAddStates(30, 32); break; case 37: if (curChar == 125) jjCheckNAdd(38); break; case 38: if ((0xdfffffffffffffffL & l) != 0L) jjCheckNAddStates(33, 35); break; case 39: if (curChar == 125 && kind > 30) kind = 30; break; case 40: if (curChar == 125) jjstateSet[jjnewStateCnt++] = 39; break; case 41: if (curChar == 123) jjstateSet[jjnewStateCnt++] = 35; break; case 42: case 43: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 33) kind = 33; jjCheckNAdd(43); break; case 48: if ((0x2000000020L & l) != 0L) jjAddStates(57, 58); break; case 52: if ((0x2000000020L & l) != 0L) jjAddStates(59, 60); break; case 56: if ((0x2000000020L & l) != 0L) jjAddStates(61, 62); break; case 61: jjAddStates(42, 44); break; case 66: jjCheckNAddTwoStates(66, 67); break; case 68: case 69: jjCheckNAddTwoStates(69, 67); break; case 72: if ((0x100000001000000L & l) != 0L) jjCheckNAdd(73); break; case 73: if ((0x7e0000007eL & l) == 0L) break; if (kind > 24) kind = 24; jjCheckNAddTwoStates(73, 74); break; case 74: if ((0x100000001000L & l) != 0L && kind > 24) kind = 24; break; case 76: if ((0x100000001000L & l) != 0L && kind > 25) kind = 25; 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 0: case 43: if (!jjCanMove_1(hiByte, i1, i2, l1, l2)) break; if (kind > 33) kind = 33; jjCheckNAdd(43); break; case 10: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjstateSet[jjnewStateCnt++] = 11; break; case 19: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(9, 11); break; case 28: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(24, 26); break; case 30: case 31: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(27, 29); break; case 36: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(30, 32); break; case 38: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(33, 35); break; case 61: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(42, 44); break; case 66: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddTwoStates(66, 67); break; case 68: case 69: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddTwoStates(69, 67); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 77 - (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) { default : return -1; } } private final int jjStartNfa_2(int pos, long active0) { return jjMoveNfa_2(jjStopStringLiteralDfa_2(pos, active0), pos + 1); } private final 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 final int jjMoveStringLiteralDfa0_2() { switch(curChar) { default : return jjMoveNfa_2(0, 0); } } private final int jjMoveNfa_2(int startState, int curPos) { int[] nextStates; int startsAt = 0; jjnewStateCnt = 1; 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 ((0xfffffffeffffd9ffL & l) == 0L) break; kind = 41; jjstateSet[jjnewStateCnt++] = 0; break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 0: kind = 41; jjstateSet[jjnewStateCnt++] = 0; 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 0: if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) break; if (kind > 41) kind = 41; jjstateSet[jjnewStateCnt++] = 0; break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 1 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } } } private final int jjMoveStringLiteralDfa0_1() { return jjMoveNfa_1(0, 0); } private final int jjMoveNfa_1(int startState, int curPos) { int[] nextStates; int startsAt = 0; jjnewStateCnt = 1; 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 ((0xffffffffffffdbffL & l) == 0L) break; kind = 36; jjstateSet[jjnewStateCnt++] = 0; break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 0: kind = 36; jjstateSet[jjnewStateCnt++] = 0; 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 0: if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) break; if (kind > 36) kind = 36; jjstateSet[jjnewStateCnt++] = 0; break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 1 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } } } static final int[] jjnextStates = { 45, 46, 51, 52, 55, 56, 8, 60, 65, 19, 20, 22, 10, 12, 72, 75, 76, 4, 5, 8, 19, 20, 24, 22, 28, 29, 33, 29, 31, 33, 36, 37, 40, 37, 38, 40, 47, 48, 8, 55, 56, 8, 61, 62, 64, 68, 70, 73, 74, 6, 7, 13, 14, 16, 21, 23, 25, 49, 50, 53, 54, 57, 58, }; 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; } } private static final boolean jjCanMove_1(int hiByte, int i1, int i2, long l1, long l2) { switch(hiByte) { case 0: return ((jjbitVec4[i2] & l2) != 0L); case 48: return ((jjbitVec5[i2] & l2) != 0L); case 49: return ((jjbitVec6[i2] & l2) != 0L); case 51: return ((jjbitVec7[i2] & l2) != 0L); case 61: return ((jjbitVec8[i2] & l2) != 0L); default : if ((jjbitVec3[i1] & l1) != 0L) return true; return false; } } public static final String[] jjstrLiteralImages = { "", "\144\157\155\141\151\156", "\75", "\144\157\155", "\151\156\151\164", "\133", "\135", "\145\156\144", "\144\157\155\144\145\163\143", "\142\162\151\144\147\145", "\147\162\157\165\160", "\147\162\160\145\170\160", "\143\157\155\160\141\162\164\155\145\156\164", "\143\157\155\145\170\160", "\50", "\51", "\54", null, null, null, null, null, null, null, null, null, null, null, null, null, null, "\164\162\165\145", "\146\141\154\163\145", null, null, null, null, null, null, null, null, null, }; public static final String[] lexStateNames = { "DEFAULT", "Line", "Word", }; 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, 0, -1, -1, -1, -1, 0, }; static final long[] jjtoToken = { 0x213f781ffffL, }; static final long[] jjtoSkip = { 0x1e0007e0000L, }; private ASCII_UCodeESC_CharStream input_stream; private final int[] jjrounds = new int[77]; private final int[] jjstateSet = new int[154]; StringBuffer image; int jjimageLen; int lengthOfMatch; protected char curChar; public ParserTokenManager(ASCII_UCodeESC_CharStream stream) { if (ASCII_UCodeESC_CharStream.staticFlag) throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer."); input_stream = stream; } public ParserTokenManager(ASCII_UCodeESC_CharStream stream, int lexState) { this(stream); SwitchTo(lexState); } public void ReInit(ASCII_UCodeESC_CharStream stream) { jjmatchedPos = jjnewStateCnt = 0; curLexState = defaultLexState; input_stream = stream; ReInitRounds(); } private final void ReInitRounds() { int i; jjround = 0x80000001; for (i = 77; i-- > 0;) jjrounds[i] = 0x80000000; } public void ReInit(ASCII_UCodeESC_CharStream stream, int lexState) { ReInit(stream); SwitchTo(lexState); } public void SwitchTo(int lexState) { if (lexState >= 3 || lexState < 0) throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE); else curLexState = lexState; } private final Token jjFillToken() { Token t = Token.newToken(jjmatchedKind); t.kind = jjmatchedKind; if (jjmatchedPos < 0) { t.image = ""; t.beginLine = t.endLine = input_stream.getBeginLine(); t.beginColumn = t.endColumn = input_stream.getBeginColumn(); } else { String im = jjstrLiteralImages[jjmatchedKind]; t.image = (im == null) ? input_stream.GetImage() : im; t.beginLine = input_stream.getBeginLine(); t.beginColumn = input_stream.getBeginColumn(); t.endLine = input_stream.getEndLine(); t.endColumn = input_stream.getEndColumn(); } return t; } int curLexState = 0; int defaultLexState = 0; int jjnewStateCnt; int jjround; int jjmatchedPos; int jjmatchedKind; public final Token getNextToken() { int kind; Token specialToken = null; Token matchedToken; int curPos = 0; EOFLoop : for (;;) { try { curChar = input_stream.BeginToken(); } catch(java.io.IOException e) { jjmatchedKind = 0; matchedToken = jjFillToken(); return matchedToken; } image = null; jjimageLen = 0; switch(curLexState) { case 0: try { input_stream.backup(0); while (curChar <= 32 && (0x100002600L & (1L << curChar)) != 0L) curChar = input_stream.BeginToken(); } catch (java.io.IOException e1) { continue EOFLoop; } jjmatchedKind = 0x7fffffff; jjmatchedPos = 0; curPos = jjMoveStringLiteralDfa0_0(); break; case 1: jjmatchedKind = 36; jjmatchedPos = -1; curPos = 0; curPos = jjMoveStringLiteralDfa0_1(); break; case 2: try { input_stream.backup(0); while (curChar <= 32 && (0x100002600L & (1L << curChar)) != 0L) curChar = input_stream.BeginToken(); } catch (java.io.IOException e1) { continue EOFLoop; } jjmatchedKind = 41; jjmatchedPos = -1; curPos = 0; curPos = jjMoveStringLiteralDfa0_2(); break; } if (jjmatchedKind != 0x7fffffff) { if (jjmatchedPos + 1 < curPos) input_stream.backup(curPos - jjmatchedPos - 1); if ((jjtoToken[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L) { matchedToken = jjFillToken(); TokenLexicalActions(matchedToken); if (jjnewLexState[jjmatchedKind] != -1) curLexState = jjnewLexState[jjmatchedKind]; return matchedToken; } else { if (jjnewLexState[jjmatchedKind] != -1) curLexState = jjnewLexState[jjmatchedKind]; continue EOFLoop; } } int error_line = input_stream.getEndLine(); int error_column = input_stream.getEndColumn(); String error_after = null; boolean EOFSeen = false; try { input_stream.readChar(); input_stream.backup(1); } catch (java.io.IOException e1) { EOFSeen = true; error_after = curPos <= 1 ? "" : input_stream.GetImage(); if (curChar == '\n' || curChar == '\r') { error_line++; error_column = 0; } else error_column++; } if (!EOFSeen) { input_stream.backup(1); error_after = curPos <= 1 ? "" : input_stream.GetImage(); } throw new TokenMgrError(EOFSeen, curLexState, error_line, error_column, error_after, curChar, TokenMgrError.LEXICAL_ERROR); } } final void TokenLexicalActions(Token matchedToken) { switch(jjmatchedKind) { default : break; } } }