Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
  /* Generated By:JavaCC: Do not edit this line. as2jTokenManager.java */
  package jason.asSyntax.parser;
  import java.util.*;
  import java.io.*;
  import jason.*;
  import jason.bb.*;
  import jason.asSyntax.*;
 
 public class as2jTokenManager implements as2jConstants
 {
   public  java.io.PrintStream debugStream = .;
   public  void setDebugStream(java.io.PrintStream ds) {  = ds; }
 private final int jjStopStringLiteralDfa_0(int poslong active0)
 {
    switch (pos)
    {
       case 0:
          if ((active0 & 0x1ef700L) != 0L)
          {
              = 23;
             return 43;
          }
          if ((active0 & 0x200000000L) != 0L)
             return 44;
          if ((active0 & 0x800000000000000L) != 0L)
             return 14;
          return -1;
       case 1:
          if ((active0 & 0x20000L) != 0L)
             return 43;
          if ((active0 & 0x1cf700L) != 0L)
          {
              = 23;
              = 1;
             return 43;
          }
          return -1;
       case 2:
          if ((active0 & 0x144300L) != 0L)
          {
              = 23;
              = 2;
             return 43;
          }
          if ((active0 & 0x8b400L) != 0L)
             return 43;
          return -1;
       case 3:
          if ((active0 & 0x104200L) != 0L)
          {
              = 23;
              = 3;
             return 43;
          }
          if ((active0 & 0x40100L) != 0L)
             return 43;
          return -1;
       default :
          return -1;
    }
 }
 private final int jjStartNfa_0(int poslong active0)
 {
    return jjMoveNfa_0(jjStopStringLiteralDfa_0(posactive0), pos + 1);
 }
 private final int jjStopAtPos(int posint kind)
 {
     = kind;
     = pos;
    return pos + 1;
 }
 private final int jjStartNfaWithStates_0(int posint kindint state)
 {
     = kind;
     = pos;
    try {  = .readChar(); }
    catch(java.io.IOException e) { return pos + 1; }
    return jjMoveNfa_0(statepos + 1);
 }
 private final int jjMoveStringLiteralDfa0_0()
 {
    switch()
    {
       case 33:
           = 34;
          return jjMoveStringLiteralDfa1_0(0x100000000000L);
       case 38:
          return jjStopAtPos(0, 51);
       case 40:
         return jjStopAtPos(0, 42);
      case 41:
         return jjStopAtPos(0, 43);
      case 42:
          = 58;
         return jjMoveStringLiteralDfa1_0(0x1000000000000000L);
      case 43:
         return jjStopAtPos(0, 37);
      case 44:
         return jjStopAtPos(0, 47);
      case 45:
         return jjStopAtPos(0, 38);
      case 46:
         return jjStartNfaWithStates_0(0, 33, 44);
      case 47:
         return jjStartNfaWithStates_0(0, 59, 14);
      case 58:
          = 35;
         return jjMoveStringLiteralDfa1_0(0x100000000L);
      case 59:
         return jjStopAtPos(0, 41);
      case 60:
          = 45;
         return jjMoveStringLiteralDfa1_0(0x10001000000000L);
      case 61:
          = 56;
         return jjMoveStringLiteralDfa1_0(0x240000000000000L);
      case 62:
          = 46;
         return jjMoveStringLiteralDfa1_0(0x20000000000000L);
      case 63:
         return jjStopAtPos(0, 40);
      case 64:
         return jjStopAtPos(0, 16);
      case 91:
         return jjStopAtPos(0, 48);
      case 92:
         return jjMoveStringLiteralDfa1_0(0x80000000000000L);
      case 93:
         return jjStopAtPos(0, 50);
      case 94:
         return jjStopAtPos(0, 39);
      case 98:
         return jjMoveStringLiteralDfa1_0(0x4000L);
      case 100:
         return jjMoveStringLiteralDfa1_0(0x1000L);
      case 101:
         return jjMoveStringLiteralDfa1_0(0x48000L);
      case 102:
         return jjMoveStringLiteralDfa1_0(0x80200L);
      case 105:
         return jjMoveStringLiteralDfa1_0(0x20000L);
      case 109:
         return jjMoveStringLiteralDfa1_0(0x2000L);
      case 110:
         return jjMoveStringLiteralDfa1_0(0x400L);
      case 116:
         return jjMoveStringLiteralDfa1_0(0x100L);
      case 119:
         return jjMoveStringLiteralDfa1_0(0x100000L);
      case 123:
         return jjStopAtPos(0, 30);
      case 124:
         return jjStopAtPos(0, 49);
      case 125:
         return jjStopAtPos(0, 31);
      case 126:
         return jjStopAtPos(0, 11);
      default :
         return jjMoveNfa_0(0, 0);
   }
private final int jjMoveStringLiteralDfa1_0(long active0)
   try {  = .readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(0, active0);
      return 1;
   }
   switch()
   {
      case 33:
         if ((active0 & 0x100000000000L) != 0L)
            return jjStopAtPos(1, 44);
         break;
      case 42:
         if ((active0 & 0x1000000000000000L) != 0L)
            return jjStopAtPos(1, 60);
         break;
      case 45:
         if ((active0 & 0x100000000L) != 0L)
            return jjStopAtPos(1, 32);
         else if ((active0 & 0x1000000000L) != 0L)
            return jjStopAtPos(1, 36);
         break;
      case 46:
         return jjMoveStringLiteralDfa2_0(active0, 0x200000000000000L);
      case 61:
         if ((active0 & 0x10000000000000L) != 0L)
            return jjStopAtPos(1, 52);
         else if ((active0 & 0x20000000000000L) != 0L)
            return jjStopAtPos(1, 53);
         else if ((active0 & 0x40000000000000L) != 0L)
            return jjStopAtPos(1, 54);
         return jjMoveStringLiteralDfa2_0(active0, 0x80000000000000L);
      case 97:
         return jjMoveStringLiteralDfa2_0(active0, 0x200L);
      case 101:
         return jjMoveStringLiteralDfa2_0(active0, 0x4000L);
      case 102:
         if ((active0 & 0x20000L) != 0L)
            return jjStartNfaWithStates_0(1, 17, 43);
         break;
      case 104:
         return jjMoveStringLiteralDfa2_0(active0, 0x100000L);
      case 105:
         return jjMoveStringLiteralDfa2_0(active0, 0x1000L);
      case 108:
         return jjMoveStringLiteralDfa2_0(active0, 0x40000L);
      case 110:
         return jjMoveStringLiteralDfa2_0(active0, 0x8000L);
      case 111:
         return jjMoveStringLiteralDfa2_0(active0, 0x82400L);
      case 114:
         return jjMoveStringLiteralDfa2_0(active0, 0x100L);
      default :
         break;
   }
   return jjStartNfa_0(0, active0);
private final int jjMoveStringLiteralDfa2_0(long old0long active0)
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(0, old0); 
   try {  = .readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(1, active0);
      return 2;
   }
   switch()
   {
      case 46:
         if ((active0 & 0x200000000000000L) != 0L)
            return jjStopAtPos(2, 57);
         break;
      case 61:
         if ((active0 & 0x80000000000000L) != 0L)
            return jjStopAtPos(2, 55);
         break;
      case 100:
         if ((active0 & 0x2000L) != 0L)
            return jjStartNfaWithStates_0(2, 13, 43);
         else if ((active0 & 0x8000L) != 0L)
            return jjStartNfaWithStates_0(2, 15, 43);
         break;
      case 103:
         return jjMoveStringLiteralDfa3_0(active0, 0x4000L);
      case 105:
         return jjMoveStringLiteralDfa3_0(active0, 0x100000L);
      case 108:
         return jjMoveStringLiteralDfa3_0(active0, 0x200L);
      case 114:
         if ((active0 & 0x80000L) != 0L)
            return jjStartNfaWithStates_0(2, 19, 43);
         break;
      case 115:
         return jjMoveStringLiteralDfa3_0(active0, 0x40000L);
      case 116:
         if ((active0 & 0x400L) != 0L)
            return jjStartNfaWithStates_0(2, 10, 43);
         break;
      case 117:
         return jjMoveStringLiteralDfa3_0(active0, 0x100L);
      case 118:
         if ((active0 & 0x1000L) != 0L)
            return jjStartNfaWithStates_0(2, 12, 43);
         break;
      default :
         break;
   }
   return jjStartNfa_0(1, active0);
private final int jjMoveStringLiteralDfa3_0(long old0long active0)
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(1, old0); 
   try {  = .readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(2, active0);
      return 3;
   }
   switch()
   {
      case 101:
         if ((active0 & 0x100L) != 0L)
            return jjStartNfaWithStates_0(3, 8, 43);
         else if ((active0 & 0x40000L) != 0L)
            return jjStartNfaWithStates_0(3, 18, 43);
         break;
      case 105:
         return jjMoveStringLiteralDfa4_0(active0, 0x4000L);
      case 108:
         return jjMoveStringLiteralDfa4_0(active0, 0x100000L);
      case 115:
         return jjMoveStringLiteralDfa4_0(active0, 0x200L);
      default :
         break;
   }
   return jjStartNfa_0(2, active0);
private final int jjMoveStringLiteralDfa4_0(long old0long active0)
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(2, old0); 
   try {  = .readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(3, active0);
      return 4;
   }
   switch()
   {
      case 101:
         if ((active0 & 0x200L) != 0L)
            return jjStartNfaWithStates_0(4, 9, 43);
         else if ((active0 & 0x100000L) != 0L)
            return jjStartNfaWithStates_0(4, 20, 43);
         break;
      case 110:
         if ((active0 & 0x4000L) != 0L)
            return jjStartNfaWithStates_0(4, 14, 43);
         break;
      default :
         break;
   }
   return jjStartNfa_0(3, active0);
private final void jjCheckNAdd(int state)
   if ([state] != )
   {
      [++] = state;
      [state] = ;
   }
private final void jjAddStates(int startint end)
   do {
      [++] = [start];
   } while (start++ != end);
private final void jjCheckNAddTwoStates(int state1int state2)
   jjCheckNAdd(state1);
   jjCheckNAdd(state2);
private final void jjCheckNAddStates(int startint end)
   do {
      jjCheckNAdd([start]);
   } while (start++ != end);
private final void jjCheckNAddStates(int start)
   jjCheckNAdd([start + 1]);
static final long[] jjbitVec0 = {
   0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec2 = {
   0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
private final int jjMoveNfa_0(int startStateint curPos)
   int[] nextStates;
   int startsAt = 0;
    = 43;
   int i = 1;
   [0] = startState;
   int jkind = 0x7fffffff;
   for (;;)
   {
      if (++ == 0x7fffffff)
         ReInitRounds();
      if ( < 64)
      {
         long l = 1L << ;
         MatchLoop: do
         {
            switch([--i])
            {
               case 44:
                  if ((0x3ff000000000000L & l) != 0L)
                  {
                     if (kind > 23)
                        kind = 23;
                     jjCheckNAddTwoStates(33, 32);
                  }
                  if ((0x3ff000000000000L & l) != 0L)
                  {
                     if (kind > 21)
                        kind = 21;
                     jjCheckNAddTwoStates(28, 29);
                  }
                  break;
               case 14:
                  if ( == 42)
                     jjCheckNAddTwoStates(20, 21);
                  else if ( == 47)
                     jjCheckNAddStates(0, 2);
                  break;
               case 0:
                  if ((0x3ff000000000000L & l) != 0L)
                  {
                     if (kind > 21)
                        kind = 21;
                     jjCheckNAddStates(3, 7);
                  }
                  else if ( == 46)
                     jjCheckNAddTwoStates(28, 32);
                  else if ( == 47)
                     jjAddStates(8, 9);
                  else if ( == 34)
                     jjCheckNAddStates(10, 12);
                  if ((0x3ff000000000000L & l) != 0L)
                  {
                     if (kind > 25)
                        kind = 25;
                  }
                  break;
               case 43:
                  if ((0x3ff000000000000L & l) != 0L)
                  {
                     if (kind > 23)
                        kind = 23;
                     jjCheckNAddTwoStates(33, 32);
                  }
                  else if ( == 46)
                     jjCheckNAdd(32);
                  break;
               case 1:
                  if ((0xfffffffbffffdbffL & l) != 0L)
                     jjCheckNAddStates(10, 12);
                  break;
               case 3:
                  if ((0x8400000000L & l) != 0L)
                     jjCheckNAddStates(10, 12);
                  break;
               case 4:
                  if ( == 34 && kind > 22)
                     kind = 22;
                  break;
               case 5:
                  if ((0xff000000000000L & l) != 0L)
                     jjCheckNAddStates(13, 16);
                  break;
               case 6:
                  if ((0xff000000000000L & l) != 0L)
                     jjCheckNAddStates(10, 12);
                  break;
               case 7:
                  if ((0xf000000000000L & l) != 0L)
                     [++] = 8;
                  break;
               case 8:
                  if ((0xff000000000000L & l) != 0L)
                     jjCheckNAdd(6);
                  break;
               case 10:
                  if ((0x3ff000000000000L & l) == 0L)
                     break;
                  if (kind > 24)
                     kind = 24;
                  [++] = 10;
                  break;
               case 11:
                  if ((0x3ff000000000000L & l) != 0L && kind > 25)
                     kind = 25;
                  break;
               case 13:
                  if ( == 47)
                     jjAddStates(8, 9);
                  break;
               case 15:
                  if ((0xffffffffffffdbffL & l) != 0L)
                     jjCheckNAddStates(0, 2);
                  break;
               case 16:
                  if ((0x2400L & l) != 0L && kind > 5)
                     kind = 5;
                  break;
               case 17:
                  if ( == 10 && kind > 5)
                     kind = 5;
                  break;
               case 18:
                  if ( == 13)
                     [++] = 17;
                  break;
               case 19:
                  if ( == 42)
                     jjCheckNAddTwoStates(20, 21);
                  break;
               case 20:
                  if ((0xfffffbffffffffffL & l) != 0L)
                     jjCheckNAddTwoStates(20, 21);
                  break;
               case 21:
                  if ( == 42)
                     jjCheckNAddStates(17, 19);
                  break;
               case 22:
                  if ((0xffff7bffffffffffL & l) != 0L)
                     jjCheckNAddTwoStates(23, 21);
                  break;
               case 23:
                  if ((0xfffffbffffffffffL & l) != 0L)
                     jjCheckNAddTwoStates(23, 21);
                  break;
               case 24:
                  if ( == 47 && kind > 6)
                     kind = 6;
                  break;
               case 26:
                  if ((0x3ff000000000000L & l) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  [++] = 26;
                  break;
               case 27:
                  if ( == 46)
                     jjCheckNAddTwoStates(28, 32);
                  break;
               case 28:
                  if ((0x3ff000000000000L & l) == 0L)
                     break;
                  if (kind > 21)
                     kind = 21;
                  jjCheckNAddTwoStates(28, 29);
                  break;
               case 30:
                  if ((0x280000000000L & l) != 0L)
                     jjCheckNAdd(31);
                  break;
               case 31:
                  if ((0x3ff000000000000L & l) == 0L)
                     break;
                  if (kind > 21)
                     kind = 21;
                  jjCheckNAdd(31);
                  break;
               case 32:
                  if ((0x3ff000000000000L & l) == 0L)
                     break;
                  if (kind > 23)
                     kind = 23;
                  jjCheckNAddTwoStates(33, 32);
                  break;
               case 33:
                  if ( == 46)
                     jjCheckNAdd(32);
                  break;
               case 35:
                  if ((0x3ff000000000000L & l) == 0L)
                     break;
                  if (kind > 21)
                     kind = 21;
                  jjCheckNAddStates(3, 7);
                  break;
               case 36:
                  if ((0x3ff000000000000L & l) == 0L)
                     break;
                  if (kind > 21)
                     kind = 21;
                  jjCheckNAdd(36);
                  break;
               case 37:
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(37, 38);
                  break;
               case 38:
                  if ( == 46)
                     jjCheckNAdd(28);
                  break;
               case 39:
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(39, 40);
                  break;
               case 41:
                  if ((0x280000000000L & l) != 0L)
                     jjCheckNAdd(42);
                  break;
               case 42:
                  if ((0x3ff000000000000L & l) == 0L)
                     break;
                  if (kind > 21)
                     kind = 21;
                  jjCheckNAdd(42);
                  break;
               default : break;
            }
         } while(i != startsAt);
      }
      else if ( < 128)
      {
         long l = 1L << ( & 077);
         MatchLoop: do
         {
            switch([--i])
            {
               case 44:
               case 32:
                  if ((0x7fffffe87fffffeL & l) == 0L)
                     break;
                  if (kind > 23)
                     kind = 23;
                  jjCheckNAddTwoStates(33, 32);
                  break;
               case 0:
                  if ((0x7fffffe87fffffeL & l) != 0L)
                  {
                     if (kind > 25)
                        kind = 25;
                  }
                  if ((0x7fffffe07fffffeL & l) != 0L)
                  {
                     if (kind > 26)
                        kind = 26;
                  }
                  else if ( == 95)
                  {
                     if (kind > 24)
                        kind = 24;
                     jjCheckNAdd(10);
                  }
                  if ((0x7fffffe00000000L & l) != 0L)
                  {
                     if (kind > 23)
                        kind = 23;
                     jjCheckNAddTwoStates(33, 32);
                  }
                  else if ((0x7fffffeL & l) != 0L)
                  {
                     if (kind > 7)
                        kind = 7;
                     jjCheckNAdd(26);
                  }
                  break;
               case 43:
                  if ((0x7fffffe87fffffeL & l) == 0L)
                     break;
                  if (kind > 23)
                     kind = 23;
                  jjCheckNAddTwoStates(33, 32);
                  break;
               case 1:
                  if ((0xffffffffefffffffL & l) != 0L)
                     jjCheckNAddStates(10, 12);
                  break;
               case 2:
                  if ( == 92)
                     jjAddStates(20, 22);
                  break;
               case 3:
                  if ((0x14404410000000L & l) != 0L)
                     jjCheckNAddStates(10, 12);
                  break;
               case 9:
                  if ( != 95)
                     break;
                  if (kind > 24)
                     kind = 24;
                  jjCheckNAdd(10);
                  break;
               case 10:
                  if ((0x7fffffe87fffffeL & l) == 0L)
                     break;
                  if (kind > 24)
                     kind = 24;
                  jjCheckNAdd(10);
                  break;
               case 11:
                  if ((0x7fffffe87fffffeL & l) != 0L && kind > 25)
                     kind = 25;
                  break;
               case 12:
                  if ((0x7fffffe07fffffeL & l) != 0L && kind > 26)
                     kind = 26;
                  break;
               case 15:
                  jjAddStates(0, 2);
                  break;
               case 20:
                  jjCheckNAddTwoStates(20, 21);
                  break;
               case 22:
               case 23:
                  jjCheckNAddTwoStates(23, 21);
                  break;
               case 25:
                  if ((0x7fffffeL & l) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  jjCheckNAdd(26);
                  break;
               case 26:
                  if ((0x7fffffe87fffffeL & l) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  jjCheckNAdd(26);
                  break;
               case 29:
                  if ((0x2000000020L & l) != 0L)
                     jjAddStates(23, 24);
                  break;
               case 34:
                  if ((0x7fffffe00000000L & l) == 0L)
                     break;
                  if (kind > 23)
                     kind = 23;
                  jjCheckNAddTwoStates(33, 32);
                  break;
               case 40:
                  if ((0x2000000020L & l) != 0L)
                     jjAddStates(25, 26);
                  break;
               default : break;
            }
         } while(i != startsAt);
      }
      else
      {
         int hiByte = (int)( >> 8);
         int i1 = hiByte >> 6;
         long l1 = 1L << (hiByte & 077);
         int i2 = ( & 0xff) >> 6;
         long l2 = 1L << ( & 077);
         MatchLoop: do
         {
            switch([--i])
            {
               case 1:
                  if (jjCanMove_0(hiBytei1i2l1l2))
                     jjAddStates(10, 12);
                  break;
               case 15:
                  if (jjCanMove_0(hiBytei1i2l1l2))
                     jjAddStates(0, 2);
                  break;
               case 20:
                  if (jjCanMove_0(hiBytei1i2l1l2))
                     jjCheckNAddTwoStates(20, 21);
                  break;
               case 22:
               case 23:
                  if (jjCanMove_0(hiBytei1i2l1l2))
                     jjCheckNAddTwoStates(23, 21);
                  break;
               default : break;
            }
         } while(i != startsAt);
      }
      if (kind != 0x7fffffff)
      {
          = kind;
          = curPos;
         kind = 0x7fffffff;
      }
      ++curPos;
      if ((i = ) == (startsAt = 43 - ( = startsAt)))
         return curPos;
      try {  = .readChar(); }
      catch(java.io.IOException e) { return curPos; }
   }
static final int[] jjnextStates = {
   15, 16, 18, 36, 37, 38, 39, 40, 14, 19, 1, 2, 4, 1, 2, 6, 
   4, 21, 22, 24, 3, 5, 7, 30, 31, 41, 42, 
};
private static final boolean jjCanMove_0(int hiByteint i1int i2long l1long l2)
   switch(hiByte)
   {
      case 0:
         return (([i2] & l2) != 0L);
      default : 
         if (([i1] & l1) != 0L)
            return true;
         return false;
   }
public static final String[] jjstrLiteralImages = {
""nullnullnullnullnullnullnull"\164\162\165\145"
"\146\141\154\163\145""\156\157\164""\176""\144\151\166""\155\157\144"
"\142\145\147\151\156""\145\156\144""\100""\151\146""\145\154\163\145""\146\157\162"
"\167\150\151\154\145"nullnullnullnullnullnullnullnullnull"\173""\175"
"\72\55""\56""\41""\72""\74\55""\53""\55""\136""\77""\73""\50"
"\51""\41\41""\74""\76""\54""\133""\174""\135""\46""\74\75"
"\76\75""\75\75""\134\75\75""\75""\75\56\56""\52""\57""\52\52", };
public static final String[] lexStateNames = {
   "DEFAULT"
};
static final long[] jjtoToken = {
   0x1fffffffffffff81L, 
};
static final long[] jjtoSkip = {
   0x7eL, 
};
private final int[] jjrounds = new int[43];
private final int[] jjstateSet = new int[86];
protected char curChar;
      throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");
    = stream;
public as2jTokenManager(SimpleCharStream streamint lexState){
   this(stream);
   SwitchTo(lexState);
public void ReInit(SimpleCharStream stream)
    = stream;
private final void ReInitRounds()
   int i;
    = 0x80000001;
   for (i = 43; i-- > 0;)
      [i] = 0x80000000;
public void ReInit(SimpleCharStream streamint lexState)
   ReInit(stream);
   SwitchTo(lexState);
public void SwitchTo(int lexState)
   if (lexState >= 1 || lexState < 0)
      throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.".);
   else
       = lexState;
protected Token jjFillToken()
   Token t = Token.newToken();
   t.kind = ;
   t.image = (im == null) ? .GetImage() : im;
   t.beginLine = .getBeginLine();
   t.beginColumn = .getBeginColumn();
   t.endLine = .getEndLine();
   t.endColumn = .getEndColumn();
   return t;
int curLexState = 0;
int defaultLexState = 0;
public Token getNextToken() 
  int kind;
  Token specialToken = null;
  Token matchedToken;
  int curPos = 0;
  EOFLoop :
  for (;;)
  {   
   try   
   {     
   }     
   catch(java.io.IOException e)
   {        
       = 0;
      matchedToken = jjFillToken();
      return matchedToken;
   }
   try { .backup(0);
      while ( <= 32 && (0x100002600L & (1L << )) != 0L)
          = .BeginToken();
   }
   catch (java.io.IOException e1) { continue EOFLoop; }
    = 0x7fffffff;
    = 0;
   curPos = jjMoveStringLiteralDfa0_0();
   if ( != 0x7fffffff)
   {
      if ( + 1 < curPos)
         .backup(curPos -  - 1);
      if (([ >> 6] & (1L << ( & 077))) != 0L)
      {
         matchedToken = jjFillToken();
         return matchedToken;
      }
      else
      {
         continue EOFLoop;
      }
   }
   int error_line = .getEndLine();
   int error_column = .getEndColumn();
   String error_after = null;
   boolean EOFSeen = false;
   try { .readChar(); .backup(1); }
   catch (java.io.IOException e1) {
      EOFSeen = true;
      error_after = curPos <= 1 ? "" : .GetImage();
      if ( == '\n' ||  == '\r') {
         error_line++;
         error_column = 0;
      }
      else
         error_column++;
   }
   if (!EOFSeen) {
      .backup(1);
      error_after = curPos <= 1 ? "" : .GetImage();
   }
   throw new TokenMgrError(EOFSeenerror_lineerror_columnerror_after.);
  }
New to GrepCode? Check out our FAQ X