/* Generated By:JavaCC: Do not edit this line. ChatParserTokenManager.java */ /* * Copyright (c) 2014 tabletoptool.com team. * All rights reserved. This program and the accompanying materials * are made available under the terms of the GNU Public License v3.0 * which accompanies this distribution, and is available at * http://www.gnu.org/licenses/gpl.html * * Contributors: * rptools.com team - initial implementation * tabletoptool.com team - further development */ package com.t3.chatparser.generated; /** Token Manager. */ public class ChatParserTokenManager implements ChatParserConstants { /** Debug output. */ public java.io.PrintStream debugStream = System.out; /** Set debug output. */ public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; } private int jjStopAtPos(int pos, int kind) { jjmatchedKind = kind; jjmatchedPos = pos; return pos + 1; } private int jjMoveStringLiteralDfa0_4() { switch(curChar) { case 36: jjmatchedKind = 26; return jjMoveStringLiteralDfa1_4(0x2000000L); case 47: return jjStopAtPos(0, 24); default : return 1; } } private int jjMoveStringLiteralDfa1_4(long active0) { try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return 1; } switch(curChar) { case 36: if ((active0 & 0x2000000L) != 0L) return jjStopAtPos(1, 25); break; default : return 2; } return 2; } private final int jjStopStringLiteralDfa_0(int pos, long active0) { switch (pos) { default : return -1; } } private final int jjStartNfa_0(int pos, long active0) { return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1); } private int jjStartNfaWithStates_0(int pos, int kind, int state) { jjmatchedKind = kind; jjmatchedPos = pos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return pos + 1; } return jjMoveNfa_0(state, pos + 1); } private int jjMoveStringLiteralDfa0_0() { switch(curChar) { case 111: return jjMoveStringLiteralDfa1_0(0x1000L); case 115: return jjMoveStringLiteralDfa1_0(0x40000L); 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 101: return jjMoveStringLiteralDfa2_0(active0, 0x40000L); case 111: return jjMoveStringLiteralDfa2_0(active0, 0x1000L); 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 99: if ((active0 & 0x1000L) != 0L) return jjStopAtPos(2, 12); break; case 108: return jjMoveStringLiteralDfa3_0(active0, 0x40000L); 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 102: if ((active0 & 0x40000L) != 0L) return jjStopAtPos(3, 18); break; default : break; } return jjStartNfa_0(2, active0); } private int jjMoveNfa_0(int startState, int curPos) { //int[] nextStates; // not used int startsAt = 0; jjnewStateCnt = 95; int i = 1; jjstateSet[0] = startState; //int j; // not used int kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; do { switch(jjstateSet[--i]) { default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); do { switch(jjstateSet[--i]) { case 0: if (curChar == 114) jjAddStates(0, 8); else if (curChar == 116) jjAddStates(9, 13); else if (curChar == 103) jjCheckNAddTwoStates(44, 47); else if (curChar == 101) jjAddStates(14, 15); else if (curChar == 109) jjCheckNAddTwoStates(34, 35); else if (curChar == 99) jjAddStates(16, 17); else if (curChar == 105) jjAddStates(18, 19); else if (curChar == 119) { if (kind > 21) kind = 21; } if (curChar == 119) jjstateSet[jjnewStateCnt++] = 9; else if (curChar == 114) { if (kind > 14) kind = 14; } else if (curChar == 103) { if (kind > 6) kind = 6; } else if (curChar == 101) { if (kind > 3) kind = 3; } else if (curChar == 109) { if (kind > 1) kind = 1; } break; case 1: if (curChar == 101 && kind > 3) kind = 3; break; case 2: if (curChar == 103 && kind > 6) kind = 6; break; case 3: if (curChar == 114 && kind > 14) kind = 14; break; case 4: if (curChar == 114 && kind > 21) kind = 21; break; case 5: if (curChar == 101) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if (curChar == 112) jjstateSet[jjnewStateCnt++] = 5; break; case 7: if (curChar == 115) jjstateSet[jjnewStateCnt++] = 6; break; case 8: if (curChar == 105) jjstateSet[jjnewStateCnt++] = 7; break; case 9: if (curChar == 104) jjstateSet[jjnewStateCnt++] = 8; break; case 10: if (curChar == 119) jjstateSet[jjnewStateCnt++] = 9; break; case 11: if (curChar == 119 && kind > 21) kind = 21; break; case 12: if (curChar == 105) jjAddStates(18, 19); break; case 13: if (curChar == 101 && kind > 11) kind = 11; break; case 14: if (curChar == 116) jjstateSet[jjnewStateCnt++] = 13; break; case 15: if (curChar == 97) jjstateSet[jjnewStateCnt++] = 14; break; case 16: if (curChar == 110) jjstateSet[jjnewStateCnt++] = 15; break; case 17: if (curChar == 111) jjstateSet[jjnewStateCnt++] = 16; break; case 18: if (curChar == 115) jjstateSet[jjnewStateCnt++] = 17; break; case 19: if (curChar == 114) jjstateSet[jjnewStateCnt++] = 18; break; case 20: if (curChar == 101) jjstateSet[jjnewStateCnt++] = 19; break; case 21: if (curChar == 112) jjstateSet[jjnewStateCnt++] = 20; break; case 22: if (curChar == 109) jjstateSet[jjnewStateCnt++] = 21; break; case 23: if (curChar == 109 && kind > 11) kind = 11; break; case 24: if (curChar == 99) jjAddStates(16, 17); break; case 25: if (curChar == 114 && kind > 2) kind = 2; break; case 26: if (curChar == 97) jjCheckNAdd(25); break; case 27: if (curChar == 101) jjstateSet[jjnewStateCnt++] = 26; break; case 28: if (curChar == 108) jjstateSet[jjnewStateCnt++] = 27; break; case 29: if (curChar == 108) jjCheckNAdd(25); break; case 30: if (curChar == 109) jjCheckNAddTwoStates(34, 35); break; case 31: if (curChar == 111 && kind > 1) kind = 1; break; case 32: if (curChar == 114) jjstateSet[jjnewStateCnt++] = 31; break; case 33: if (curChar == 99) jjstateSet[jjnewStateCnt++] = 32; break; case 34: if (curChar == 97) jjstateSet[jjnewStateCnt++] = 33; break; case 35: if (curChar == 101 && kind > 4) kind = 4; break; case 36: if (curChar == 101) jjAddStates(14, 15); break; case 37: if (curChar == 116 && kind > 3) kind = 3; break; case 38: if (curChar == 105) jjstateSet[jjnewStateCnt++] = 37; break; case 39: if (curChar == 109) jjstateSet[jjnewStateCnt++] = 38; break; case 40: if (curChar == 116) jjCheckNAdd(35); break; case 41: if (curChar == 111) jjstateSet[jjnewStateCnt++] = 40; break; case 42: if (curChar == 109) jjstateSet[jjnewStateCnt++] = 41; break; case 43: if (curChar == 103) jjCheckNAddTwoStates(44, 47); break; case 44: if (curChar == 109 && kind > 5) kind = 5; break; case 45: if (curChar == 111 && kind > 6) kind = 6; break; case 46: if (curChar == 116) jjstateSet[jjnewStateCnt++] = 45; break; case 47: if (curChar == 111) jjstateSet[jjnewStateCnt++] = 46; break; case 48: if (curChar == 116) jjAddStates(9, 13); break; case 49: if (curChar == 103) jjCheckNAdd(44); break; case 50: if (curChar == 111) jjstateSet[jjnewStateCnt++] = 49; break; case 51: if (curChar == 101 && kind > 19) kind = 19; break; case 52: if (curChar == 108) jjstateSet[jjnewStateCnt++] = 51; break; case 53: if (curChar == 98) jjstateSet[jjnewStateCnt++] = 52; break; case 54: if (curChar == 97) jjstateSet[jjnewStateCnt++] = 53; break; case 55: if (curChar == 108 && kind > 19) kind = 19; break; case 56: if (curChar == 98) jjstateSet[jjnewStateCnt++] = 55; break; case 57: if (curChar == 121 && kind > 20) kind = 20; break; case 58: if (curChar == 97) jjstateSet[jjnewStateCnt++] = 57; break; case 59: if (curChar == 115) jjstateSet[jjnewStateCnt++] = 58; break; case 60: if (curChar == 115 && kind > 20) kind = 20; break; case 61: if (curChar == 114) jjAddStates(0, 8); break; case 62: if (curChar == 121 && kind > 13) kind = 13; break; case 63: if (curChar == 108) jjstateSet[jjnewStateCnt++] = 62; break; case 64: if (curChar == 112) jjstateSet[jjnewStateCnt++] = 63; break; case 65: if (curChar == 101) jjstateSet[jjnewStateCnt++] = 64; break; case 66: if (curChar == 112 && kind > 13) kind = 13; break; case 67: if (curChar == 101) jjstateSet[jjnewStateCnt++] = 66; break; case 68: if (curChar == 108 && kind > 14) kind = 14; break; case 69: if (curChar == 108) jjstateSet[jjnewStateCnt++] = 68; break; case 70: if (curChar == 111) jjstateSet[jjnewStateCnt++] = 69; break; case 71: if (curChar == 109 && kind > 15) kind = 15; break; case 72: case 76: if (curChar == 103) jjCheckNAdd(71); break; case 73: if (curChar == 108) jjstateSet[jjnewStateCnt++] = 72; break; case 74: if (curChar == 108) jjstateSet[jjnewStateCnt++] = 73; break; case 75: if (curChar == 111) jjstateSet[jjnewStateCnt++] = 74; break; case 77: if (curChar == 101 && kind > 16) kind = 16; break; case 78: case 82: if (curChar == 109) jjCheckNAdd(77); break; case 79: if (curChar == 108) jjstateSet[jjnewStateCnt++] = 78; break; case 80: if (curChar == 108) jjstateSet[jjnewStateCnt++] = 79; break; case 81: if (curChar == 111) jjstateSet[jjnewStateCnt++] = 80; break; case 83: if (curChar == 116 && kind > 17) kind = 17; break; case 84: if (curChar == 101) jjstateSet[jjnewStateCnt++] = 83; break; case 85: if (curChar == 114) jjstateSet[jjnewStateCnt++] = 84; break; case 86: if (curChar == 99) jjstateSet[jjnewStateCnt++] = 85; break; case 87: if (curChar == 101) jjstateSet[jjnewStateCnt++] = 86; break; case 88: if (curChar == 115) jjstateSet[jjnewStateCnt++] = 87; break; case 89: if (curChar == 108) jjstateSet[jjnewStateCnt++] = 88; break; case 90: if (curChar == 108) jjstateSet[jjnewStateCnt++] = 89; break; case 91: if (curChar == 111) jjstateSet[jjnewStateCnt++] = 90; break; case 92: if (curChar == 99 && kind > 17) kind = 17; break; case 93: if (curChar == 101) jjstateSet[jjnewStateCnt++] = 92; break; case 94: if (curChar == 115) jjstateSet[jjnewStateCnt++] = 93; break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); do { switch(jjstateSet[--i]) { default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 95 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } } } private final int jjStopStringLiteralDfa_2(int pos, long active0) { switch (pos) { case 0: if ((active0 & 0x40000000L) != 0L) return 1; return -1; default : return -1; } } private final int jjStartNfa_2(int pos, long active0) { return jjMoveNfa_2(jjStopStringLiteralDfa_2(pos, active0), pos + 1); } private int jjStartNfaWithStates_2(int pos, int kind, int state) { jjmatchedKind = kind; jjmatchedPos = pos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return pos + 1; } return jjMoveNfa_2(state, pos + 1); } private int jjMoveStringLiteralDfa0_2() { switch(curChar) { case 36: return jjStopAtPos(0, 28); case 40: return jjStopAtPos(0, 33); case 41: return jjStopAtPos(0, 34); case 42: return jjStopAtPos(0, 31); case 43: return jjStopAtPos(0, 29); case 45: return jjStartNfaWithStates_2(0, 30, 1); case 47: return jjStopAtPos(0, 32); case 100: jjmatchedKind = 37; return jjMoveStringLiteralDfa1_2(0x180000000000L); case 101: jjmatchedKind = 42; return jjMoveStringLiteralDfa1_2(0x20000000000L); case 107: return jjStopAtPos(0, 38); case 114: return jjStopAtPos(0, 39); case 115: jjmatchedKind = 40; return jjMoveStringLiteralDfa1_2(0x1e00000000000L); default : return jjMoveNfa_2(0, 0); } } private int jjMoveStringLiteralDfa1_2(long active0) { try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_2(0, active0); return 1; } switch(curChar) { case 102: if ((active0 & 0x80000000000L) != 0L) return jjStopAtPos(1, 43); break; case 114: return jjMoveStringLiteralDfa2_2(active0, 0x1e00000000000L); case 115: if ((active0 & 0x20000000000L) != 0L) return jjStopAtPos(1, 41); break; case 117: if ((active0 & 0x100000000000L) != 0L) return jjStopAtPos(1, 44); break; default : break; } return jjStartNfa_2(0, active0); } private int jjMoveStringLiteralDfa2_2(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_2(0, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_2(1, active0); return 2; } switch(curChar) { case 52: if ((active0 & 0x1000000000000L) != 0L) { jjmatchedKind = 48; jjmatchedPos = 2; } return jjMoveStringLiteralDfa3_2(active0, 0xe00000000000L); default : break; } return jjStartNfa_2(1, active0); } private int jjMoveStringLiteralDfa3_2(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_2(1, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_2(2, active0); return 3; } switch(curChar) { case 101: if ((active0 & 0x400000000000L) != 0L) { jjmatchedKind = 46; jjmatchedPos = 3; } return jjMoveStringLiteralDfa4_2(active0, 0x200000000000L); case 103: if ((active0 & 0x800000000000L) != 0L) return jjStopAtPos(3, 47); break; default : break; } return jjStartNfa_2(2, active0); } private int jjMoveStringLiteralDfa4_2(long old0, long active0) { if (((active0 &= old0)) == 0L) return jjStartNfa_2(2, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_2(3, active0); return 4; } switch(curChar) { case 103: if ((active0 & 0x200000000000L) != 0L) return jjStopAtPos(4, 45); break; default : break; } return jjStartNfa_2(3, active0); } private int jjMoveNfa_2(int startState, int curPos) { //int[] nextStates; // not used int startsAt = 0; jjnewStateCnt = 6; int i = 1; jjstateSet[0] = startState; //int j; // not used 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) { if (kind > 35) kind = 35; jjCheckNAddStates(20, 22); } else if (curChar == 45) jjCheckNAdd(1); break; case 1: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(1, 2); break; case 2: if (curChar == 46) jjCheckNAdd(3); break; case 3: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 36) kind = 36; jjCheckNAdd(3); break; case 4: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 35) kind = 35; jjCheckNAddStates(20, 22); break; case 5: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 35) kind = 35; jjCheckNAdd(5); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); do { switch(jjstateSet[--i]) { default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); do { switch(jjstateSet[--i]) { default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 6 - (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) { default : return -1; } } private final int jjStartNfa_1(int pos, long active0) { return jjMoveNfa_1(jjStopStringLiteralDfa_1(pos, active0), pos + 1); } private int jjStartNfaWithStates_1(int pos, int kind, int state) { jjmatchedKind = kind; jjmatchedPos = pos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return pos + 1; } return jjMoveNfa_1(state, pos + 1); } private int jjMoveStringLiteralDfa0_1() { switch(curChar) { default : return jjMoveNfa_1(0, 0); } } private int jjMoveNfa_1(int startState, int curPos) { //int[] nextStates; // not used int startsAt = 0; jjnewStateCnt = 35; int i = 1; jjstateSet[0] = startState; //int j; // not used 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) jjstateSet[jjnewStateCnt++] = 4; else if (curChar == 45) { if (kind > 9) kind = 9; jjCheckNAdd(2); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 7) kind = 7; jjCheckNAdd(1); } else if (curChar == 45) jjCheckNAdd(1); break; case 1: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAdd(1); break; case 2: if (curChar != 45) break; if (kind > 9) kind = 9; jjCheckNAdd(2); break; case 3: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 4; break; case 4: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 5; break; case 5: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 6; break; case 6: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 7; break; case 7: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 8; break; case 8: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 9; break; case 9: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 10; break; case 10: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 11; break; case 11: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 12; break; case 12: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 13; break; case 13: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 14; break; case 14: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 15; 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) jjstateSet[jjnewStateCnt++] = 19; break; case 19: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 20; 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) jjstateSet[jjnewStateCnt++] = 24; break; case 24: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 25; break; case 25: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 26; break; case 26: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 27; break; case 27: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 28; break; case 28: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 29; break; case 29: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 30; break; case 30: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 31; break; case 31: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 32; break; case 32: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 33; break; case 33: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 34; break; case 34: if ((0x3ff000000000000L & l) != 0L && kind > 10) kind = 10; break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); do { switch(jjstateSet[--i]) { case 0: if ((0x7fffffe87fffffeL & l) != 0L) { if (kind > 9) kind = 9; jjCheckNAdd(2); } if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 4; break; case 2: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 9) kind = 9; jjCheckNAdd(2); break; case 3: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 4; break; case 4: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 5; break; case 5: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 6; break; case 6: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 7; break; case 7: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 8; break; case 8: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 9; break; case 9: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 10; break; case 10: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 11; break; case 11: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 12; break; case 12: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 13; break; case 13: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 14; break; case 14: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 15; break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 16; break; case 16: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 18; break; case 18: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 19; break; case 19: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 21; break; case 21: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 22; break; case 22: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 23; break; case 23: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 24; break; case 24: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 25; break; case 25: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 26; break; case 26: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 27; break; case 27: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 28; break; case 28: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 29; break; case 29: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 30; break; case 30: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 31; break; case 31: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 32; break; case 32: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 33; break; case 33: if ((0x7fffffe07fffffeL & l) != 0L) jjstateSet[jjnewStateCnt++] = 34; break; case 34: if ((0x7fffffe07fffffeL & l) != 0L && kind > 10) kind = 10; break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); do { switch(jjstateSet[--i]) { default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 35 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } } } private int jjMoveStringLiteralDfa0_5() { switch(curChar) { case 36: jjmatchedKind = 26; return jjMoveStringLiteralDfa1_5(0x2000000L); default : return 1; } } private int jjMoveStringLiteralDfa1_5(long active0) { try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return 1; } switch(curChar) { case 36: if ((active0 & 0x2000000L) != 0L) return jjStopAtPos(1, 25); break; default : return 2; } return 2; } private int jjMoveStringLiteralDfa0_3() { return jjMoveNfa_3(0, 0); } static final long[] jjbitVec0 = { 0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL }; static final long[] jjbitVec2 = { 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL }; private int jjMoveNfa_3(int startState, int curPos) { //int[] nextStates; // not used int startsAt = 0; jjnewStateCnt = 1; int i = 1; jjstateSet[0] = startState; //int j; // not used int kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; do { switch(jjstateSet[--i]) { case 0: kind = 23; jjstateSet[jjnewStateCnt++] = 0; break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); do { switch(jjstateSet[--i]) { case 0: kind = 23; 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); do { switch(jjstateSet[--i]) { case 0: if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) break; if (kind > 23) kind = 23; 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 = { 65, 67, 70, 75, 76, 81, 82, 91, 94, 50, 54, 56, 59, 60, 39, 42, 28, 29, 22, 23, 5, 1, 2, }; 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; } } /** Token literal values. */ public static final String[] jjstrLiteralImages = { "", null, null, null, null, null, null, null, null, null, null, null, "\157\157\143", null, null, null, null, null, "\163\145\154\146", null, null, null, null, null, "\57", "\44\44", "\44", null, "\44", "\53", "\55", "\52", "\57", "\50", "\51", null, null, "\144", "\153", "\162", "\163", "\145\163", "\145", "\144\146", "\144\165", "\163\162\64\145\147", "\163\162\64\145", "\163\162\64\147", "\163\162\64", }; /** Lexer state names. */ public static final String[] lexStateNames = { "CHATCOMMAND", "CC_ARGUMENTS", "DICE_EXPR", "REST", "DEFAULT", "AFTER_CC", }; /** Lex State array. */ public static final int[] jjnewLexState = { -1, 3, 5, 5, 5, 5, 1, -1, -1, -1, -1, 1, 5, 5, 2, 2, 2, 2, 5, 1, 3, 5, -1, -1, 0, -1, 2, 5, 5, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, }; static final long[] jjtoToken = { 0x1fffffffffeffL, }; static final long[] jjtoSkip = { 0x100L, }; protected SimpleCharStream input_stream; private final int[] jjrounds = new int[95]; private final int[] jjstateSet = new int[190]; protected char curChar; /** Constructor. */ public ChatParserTokenManager(SimpleCharStream stream){ if (SimpleCharStream.staticFlag) throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer."); input_stream = stream; } /** Constructor. */ public ChatParserTokenManager(SimpleCharStream stream, int lexState){ this(stream); SwitchTo(lexState); } /** Reinitialise parser. */ public void ReInit(SimpleCharStream stream) { jjmatchedPos = jjnewStateCnt = 0; curLexState = defaultLexState; input_stream = stream; ReInitRounds(); } private void ReInitRounds() { int i; jjround = 0x80000001; for (i = 95; i-- > 0;) jjrounds[i] = 0x80000000; } /** Reinitialise parser. */ public void ReInit(SimpleCharStream stream, int lexState) { ReInit(stream); SwitchTo(lexState); } /** Switch to specified lex state. */ public void SwitchTo(int lexState) { if (lexState >= 6 || lexState < 0) throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE); else curLexState = lexState; } protected Token jjFillToken() { final Token t; final String tokenImage; final int beginLine; final int endLine; final int beginColumn; final int endColumn; String im = jjstrLiteralImages[jjmatchedKind]; tokenImage = (im == null) ? input_stream.GetImage() : im; beginLine = input_stream.getBeginLine(); beginColumn = input_stream.getBeginColumn(); endLine = input_stream.getEndLine(); endColumn = input_stream.getEndColumn(); t = Token.newToken(jjmatchedKind, tokenImage); t.beginLine = beginLine; t.endLine = endLine; t.beginColumn = beginColumn; t.endColumn = endColumn; return t; } int curLexState = 4; int defaultLexState = 4; int jjnewStateCnt; int jjround; int jjmatchedPos; int jjmatchedKind; /** Get the next Token. */ public 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; } switch(curLexState) { case 0: jjmatchedKind = 0x7fffffff; jjmatchedPos = 0; curPos = jjMoveStringLiteralDfa0_0(); if (jjmatchedPos == 0 && jjmatchedKind > 22) { jjmatchedKind = 22; } break; case 1: try { input_stream.backup(0); while (curChar <= 32 && (0x100000000L & (1L << curChar)) != 0L) curChar = input_stream.BeginToken(); } catch (java.io.IOException e1) { continue EOFLoop; } jjmatchedKind = 0x7fffffff; jjmatchedPos = 0; curPos = jjMoveStringLiteralDfa0_1(); break; case 2: try { input_stream.backup(0); while (curChar <= 32 && (0x100000000L & (1L << curChar)) != 0L) curChar = input_stream.BeginToken(); } catch (java.io.IOException e1) { continue EOFLoop; } jjmatchedKind = 0x7fffffff; jjmatchedPos = 0; curPos = jjMoveStringLiteralDfa0_2(); break; case 3: jjmatchedKind = 0x7fffffff; jjmatchedPos = 0; curPos = jjMoveStringLiteralDfa0_3(); break; case 4: jjmatchedKind = 0x7fffffff; jjmatchedPos = 0; curPos = jjMoveStringLiteralDfa0_4(); if (jjmatchedPos == 0 && jjmatchedKind > 27) { jjmatchedKind = 27; } break; case 5: jjmatchedKind = 0x7fffffff; jjmatchedPos = 0; curPos = jjMoveStringLiteralDfa0_5(); if (jjmatchedPos == 0 && jjmatchedKind > 27) { jjmatchedKind = 27; } break; } if (jjmatchedKind != 0x7fffffff) { if (jjmatchedPos + 1 < curPos) input_stream.backup(curPos - jjmatchedPos - 1); if ((jjtoToken[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L) { matchedToken = jjFillToken(); 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); } } private void jjCheckNAdd(int state) { if (jjrounds[state] != jjround) { jjstateSet[jjnewStateCnt++] = state; jjrounds[state] = jjround; } } private void jjAddStates(int start, int end) { do { jjstateSet[jjnewStateCnt++] = jjnextStates[start]; } while (start++ != end); } private void jjCheckNAddTwoStates(int state1, int state2) { jjCheckNAdd(state1); jjCheckNAdd(state2); } private void jjCheckNAddStates(int start, int end) { do { jjCheckNAdd(jjnextStates[start]); } while (start++ != end); } }