Lexer.java

// DO NOT EDIT
// Generated by JFlex 1.8.2 http://jflex.de/
// source: tokenizer.jflex


import java_cup.runtime.* ;


// See https://github.com/jflex-de/jflex/issues/222
@SuppressWarnings("FallThrough")
class Lexer implements java_cup.runtime.Scanner {

  /** This character denotes the end of file. */
  public static final int YYEOF = -1;

  /** Initial size of the lookahead buffer. */
  private static final int ZZ_BUFFERSIZE = 16384;

  // Lexical states.
  public static final int YYINITIAL = 0;

  /**
   * ZZ_LEXSTATE[l] is the state in the DFA for the lexical state l
   * ZZ_LEXSTATE[l+1] is the state in the DFA for the lexical state l
   *                  at the beginning of a line
   * l is of the form l = 2*k, k a non negative integer
   */
  private static final int ZZ_LEXSTATE[] = {
     0, 0
  };

  /**
   * Top-level table for translating characters to character classes
   */
  private static final int [] ZZ_CMAP_TOP = zzUnpackcmap_top();

  private static final String ZZ_CMAP_TOP_PACKED_0 =
    "\1\0\1\u0100\1\u0200\1\u0300\1\u0400\1\u0500\1\u0600\1\u0700"+
    "\1\u0800\1\u0900\1\u0a00\1\u0b00\1\u0c00\1\u0d00\1\u0e00\1\u0f00"+
    "\1\u1000\1\u0100\1\u1100\1\u1200\1\u1300\1\u0100\1\u1400\1\u1500"+
    "\1\u1600\1\u1700\1\u1800\1\u1900\1\u1a00\1\u1b00\1\u0100\1\u1c00"+
    "\1\u1d00\1\u1e00\12\u1f00\1\u2000\1\u2100\1\u2200\1\u1f00\1\u2300"+
    "\1\u2400\2\u1f00\31\u0100\1\u2500\121\u0100\1\u2600\4\u0100\1\u2700"+
    "\1\u0100\1\u2800\1\u2900\1\u2a00\1\u2b00\1\u2c00\1\u2d00\53\u0100"+
    "\1\u2e00\41\u1f00\1\u0100\1\u2f00\1\u3000\1\u0100\1\u3100\1\u3200"+
    "\1\u3300\1\u3400\1\u3500\1\u3600\1\u3700\1\u3800\1\u3900\1\u0100"+
    "\1\u3a00\1\u3b00\1\u3c00\1\u3d00\1\u3e00\1\u3f00\1\u4000\1\u1f00"+
    "\1\u4100\1\u4200\1\u4300\1\u4400\1\u4500\1\u4600\1\u4700\1\u4800"+
    "\1\u4900\1\u4a00\1\u4b00\1\u4c00\1\u1f00\1\u4d00\1\u4e00\1\u4f00"+
    "\1\u5000\3\u0100\1\u5100\1\u5200\1\u5300\12\u1f00\4\u0100\1\u5400"+
    "\17\u1f00\2\u0100\1\u5500\41\u1f00\2\u0100\1\u5600\1\u5700\2\u1f00"+
    "\1\u5800\1\u5900\27\u0100\1\u5a00\2\u0100\1\u5b00\45\u1f00\1\u0100"+
    "\1\u5c00\1\u5d00\11\u1f00\1\u5e00\27\u1f00\1\u5f00\1\u6000\1\u6100"+
    "\1\u6200\11\u1f00\1\u6300\1\u6400\5\u1f00\1\u6500\1\u6600\2\u1f00"+
    "\1\u6700\1\u1f00\1\u6800\21\u1f00\246\u0100\1\u6900\20\u0100\1\u6a00"+
    "\1\u6b00\25\u0100\1\u6c00\34\u0100\1\u6d00\14\u1f00\2\u0100\1\u6e00"+
    "\u0e05\u1f00";

  private static int [] zzUnpackcmap_top() {
    int [] result = new int[4352];
    int offset = 0;
    offset = zzUnpackcmap_top(ZZ_CMAP_TOP_PACKED_0, offset, result);
    return result;
  }

  private static int zzUnpackcmap_top(String packed, int offset, int [] result) {
    int i = 0;       /* index in packed string  */
    int j = offset;  /* index in unpacked array */
    int l = packed.length();
    while (i < l) {
      int count = packed.charAt(i++);
      int value = packed.charAt(i++);
      do result[j++] = value; while (--count > 0);
    }
    return j;
  }


  /**
   * Second-level tables for translating characters to character classes
   */
  private static final int [] ZZ_CMAP_BLOCKS = zzUnpackcmap_blocks();

  private static final String ZZ_CMAP_BLOCKS_PACKED_0 =
    "\11\0\1\1\1\2\1\0\1\1\1\3\22\0\1\1"+
    "\1\4\1\5\1\6\1\7\1\0\1\10\1\11\1\12"+
    "\1\13\1\14\1\15\1\16\1\17\1\20\1\21\1\22"+
    "\11\23\1\24\1\25\1\26\1\27\1\30\1\31\1\0"+
    "\4\7\1\32\25\7\1\33\1\34\1\35\1\0\1\7"+
    "\1\0\1\36\1\37\1\40\1\41\1\42\1\43\1\44"+
    "\1\45\1\46\2\7\1\47\1\7\1\50\1\51\1\52"+
    "\1\7\1\53\1\54\1\55\1\56\1\57\1\60\1\7"+
    "\1\61\1\7\1\0\1\62\45\0\4\7\4\0\1\7"+
    "\12\0\1\7\4\0\1\7\5\0\27\7\1\0\37\7"+
    "\1\0\u01ca\7\4\0\14\7\16\0\5\7\7\0\1\7"+
    "\1\0\1\7\201\0\5\7\1\0\2\7\2\0\4\7"+
    "\1\0\1\7\6\0\1\7\1\0\3\7\1\0\1\7"+
    "\1\0\24\7\1\0\123\7\1\0\213\7\10\0\246\7"+
    "\1\0\46\7\2\0\1\7\6\0\51\7\6\0\1\7"+
    "\100\0\33\7\4\0\4\7\30\0\1\7\24\0\53\7"+
    "\43\0\2\7\1\0\143\7\1\0\1\7\17\0\2\7"+
    "\7\0\2\7\12\0\3\7\2\0\1\7\20\0\1\7"+
    "\1\0\36\7\35\0\131\7\13\0\1\7\30\0\41\7"+
    "\11\0\2\7\4\0\1\7\3\0\30\7\4\0\1\7"+
    "\11\0\1\7\3\0\1\7\27\0\31\7\7\0\13\7"+
    "\65\0\25\7\1\0\10\7\106\0\66\7\3\0\1\7"+
    "\22\0\1\7\7\0\12\7\17\0\20\7\4\0\10\7"+
    "\2\0\2\7\2\0\26\7\1\0\7\7\1\0\1\7"+
    "\3\0\4\7\3\0\1\7\20\0\1\7\15\0\2\7"+
    "\1\0\3\7\16\0\4\7\7\0\2\7\10\0\6\7"+
    "\4\0\2\7\2\0\26\7\1\0\7\7\1\0\2\7"+
    "\1\0\2\7\1\0\2\7\37\0\4\7\1\0\1\7"+
    "\23\0\3\7\20\0\11\7\1\0\3\7\1\0\26\7"+
    "\1\0\7\7\1\0\2\7\1\0\5\7\3\0\1\7"+
    "\22\0\1\7\17\0\2\7\17\0\1\7\7\0\1\7"+
    "\13\0\10\7\2\0\2\7\2\0\26\7\1\0\7\7"+
    "\1\0\2\7\1\0\5\7\3\0\1\7\36\0\2\7"+
    "\1\0\3\7\17\0\1\7\21\0\1\7\1\0\6\7"+
    "\3\0\3\7\1\0\4\7\3\0\2\7\1\0\1\7"+
    "\1\0\2\7\3\0\2\7\3\0\3\7\3\0\14\7"+
    "\26\0\1\7\50\0\1\7\13\0\10\7\1\0\3\7"+
    "\1\0\27\7\1\0\20\7\3\0\1\7\32\0\3\7"+
    "\5\0\2\7\36\0\1\7\4\0\10\7\1\0\3\7"+
    "\1\0\27\7\1\0\12\7\1\0\5\7\3\0\1\7"+
    "\40\0\1\7\1\0\2\7\17\0\2\7\22\0\10\7"+
    "\1\0\3\7\1\0\51\7\2\0\1\7\20\0\1\7"+
    "\5\0\3\7\10\0\3\7\30\0\6\7\5\0\22\7"+
    "\3\0\30\7\1\0\11\7\1\0\1\7\2\0\7\7"+
    "\72\0\60\7\1\0\2\7\13\0\10\7\72\0\2\7"+
    "\1\0\1\7\1\0\5\7\1\0\30\7\1\0\1\7"+
    "\1\0\12\7\1\0\2\7\11\0\1\7\2\0\5\7"+
    "\1\0\1\7\25\0\4\7\40\0\1\7\77\0\10\7"+
    "\1\0\44\7\33\0\5\7\163\0\53\7\24\0\1\7"+
    "\20\0\6\7\4\0\4\7\3\0\1\7\3\0\2\7"+
    "\7\0\3\7\4\0\15\7\14\0\1\7\21\0\46\7"+
    "\1\0\1\7\5\0\1\7\2\0\53\7\1\0\115\7"+
    "\1\0\4\7\2\0\7\7\1\0\1\7\1\0\4\7"+
    "\2\0\51\7\1\0\4\7\2\0\41\7\1\0\4\7"+
    "\2\0\7\7\1\0\1\7\1\0\4\7\2\0\17\7"+
    "\1\0\71\7\1\0\4\7\2\0\103\7\45\0\20\7"+
    "\20\0\126\7\2\0\6\7\3\0\u016c\7\2\0\21\7"+
    "\1\0\32\7\5\0\113\7\3\0\13\7\7\0\15\7"+
    "\1\0\4\7\16\0\22\7\16\0\22\7\16\0\15\7"+
    "\1\0\3\7\17\0\64\7\43\0\1\7\3\0\2\7"+
    "\103\0\131\7\7\0\5\7\2\0\42\7\1\0\1\7"+
    "\5\0\106\7\12\0\37\7\61\0\36\7\2\0\5\7"+
    "\13\0\54\7\4\0\32\7\66\0\27\7\11\0\65\7"+
    "\122\0\1\7\135\0\57\7\21\0\7\7\67\0\36\7"+
    "\15\0\2\7\12\0\54\7\32\0\44\7\51\0\3\7"+
    "\12\0\44\7\2\0\11\7\7\0\53\7\2\0\3\7"+
    "\51\0\4\7\1\0\6\7\1\0\2\7\3\0\1\7"+
    "\5\0\300\7\100\0\26\7\2\0\6\7\2\0\46\7"+
    "\2\0\6\7\2\0\10\7\1\0\1\7\1\0\1\7"+
    "\1\0\1\7\1\0\37\7\2\0\65\7\1\0\7\7"+
    "\1\0\1\7\3\0\3\7\1\0\7\7\3\0\4\7"+
    "\2\0\6\7\4\0\15\7\5\0\3\7\1\0\7\7"+
    "\102\0\2\7\23\0\1\7\34\0\1\7\15\0\1\7"+
    "\20\0\15\7\3\0\40\7\102\0\1\7\4\0\1\7"+
    "\2\0\12\7\1\0\1\7\3\0\5\7\6\0\1\7"+
    "\1\0\1\7\1\0\1\7\1\0\4\7\1\0\13\7"+
    "\2\0\4\7\5\0\5\7\4\0\1\7\21\0\51\7"+
    "\u0177\0\57\7\1\0\57\7\1\0\205\7\6\0\4\7"+
    "\3\0\2\7\14\0\46\7\1\0\1\7\5\0\1\7"+
    "\2\0\70\7\7\0\1\7\20\0\27\7\11\0\7\7"+
    "\1\0\7\7\1\0\7\7\1\0\7\7\1\0\7\7"+
    "\1\0\7\7\1\0\7\7\1\0\7\7\120\0\1\7"+
    "\325\0\3\7\31\0\11\7\7\0\5\7\2\0\5\7"+
    "\4\0\126\7\6\0\3\7\1\0\132\7\1\0\4\7"+
    "\5\0\53\7\1\0\136\7\21\0\33\7\65\0\306\7"+
    "\112\0\360\7\20\0\215\7\103\0\56\7\2\0\15\7"+
    "\3\0\20\7\12\0\2\7\24\0\57\7\20\0\37\7"+
    "\2\0\120\7\47\0\11\7\2\0\147\7\2\0\65\7"+
    "\2\0\5\7\60\0\13\7\1\0\3\7\1\0\4\7"+
    "\1\0\27\7\25\0\1\7\7\0\64\7\16\0\62\7"+
    "\76\0\6\7\3\0\1\7\1\0\2\7\13\0\34\7"+
    "\12\0\27\7\31\0\35\7\7\0\57\7\34\0\1\7"+
    "\20\0\5\7\1\0\12\7\12\0\5\7\1\0\51\7"+
    "\27\0\3\7\1\0\10\7\24\0\27\7\3\0\1\7"+
    "\3\0\62\7\1\0\1\7\3\0\2\7\2\0\5\7"+
    "\2\0\1\7\1\0\1\7\30\0\3\7\2\0\13\7"+
    "\7\0\3\7\14\0\6\7\2\0\6\7\2\0\6\7"+
    "\11\0\7\7\1\0\7\7\1\0\53\7\1\0\14\7"+
    "\10\0\163\7\35\0\244\7\14\0\27\7\4\0\61\7"+
    "\4\0\156\7\2\0\152\7\46\0\7\7\14\0\5\7"+
    "\5\0\1\7\1\0\12\7\1\0\15\7\1\0\5\7"+
    "\1\0\1\7\1\0\2\7\1\0\2\7\1\0\154\7"+
    "\41\0\153\7\22\0\100\7\2\0\66\7\50\0\15\7"+
    "\66\0\2\7\30\0\3\7\31\0\1\7\6\0\5\7"+
    "\1\0\207\7\7\0\1\7\34\0\32\7\4\0\1\7"+
    "\1\0\32\7\13\0\131\7\3\0\6\7\2\0\6\7"+
    "\2\0\6\7\2\0\3\7\3\0\2\7\3\0\2\7"+
    "\31\0\14\7\1\0\32\7\1\0\23\7\1\0\2\7"+
    "\1\0\17\7\2\0\16\7\42\0\173\7\105\0\65\7"+
    "\u010b\0\35\7\3\0\61\7\57\0\40\7\15\0\36\7"+
    "\5\0\46\7\12\0\36\7\2\0\44\7\4\0\10\7"+
    "\1\0\5\7\52\0\236\7\22\0\44\7\4\0\44\7"+
    "\4\0\50\7\10\0\64\7\234\0\67\7\11\0\26\7"+
    "\12\0\10\7\230\0\6\7\2\0\1\7\1\0\54\7"+
    "\1\0\2\7\3\0\1\7\2\0\27\7\12\0\27\7"+
    "\11\0\37\7\101\0\23\7\1\0\2\7\12\0\26\7"+
    "\12\0\32\7\106\0\70\7\6\0\2\7\100\0\1\7"+
    "\17\0\4\7\1\0\3\7\1\0\35\7\52\0\35\7"+
    "\3\0\35\7\43\0\10\7\1\0\34\7\33\0\66\7"+
    "\12\0\26\7\12\0\23\7\15\0\22\7\156\0\111\7"+
    "\67\0\63\7\15\0\63\7\15\0\44\7\334\0\35\7"+
    "\12\0\1\7\10\0\26\7\232\0\27\7\14\0\65\7"+
    "\113\0\55\7\40\0\31\7\32\0\44\7\35\0\1\7"+
    "\13\0\43\7\3\0\1\7\14\0\60\7\16\0\4\7"+
    "\25\0\1\7\1\0\1\7\43\0\22\7\1\0\31\7"+
    "\124\0\7\7\1\0\1\7\1\0\4\7\1\0\17\7"+
    "\1\0\12\7\7\0\57\7\46\0\10\7\2\0\2\7"+
    "\2\0\26\7\1\0\7\7\1\0\2\7\1\0\5\7"+
    "\3\0\1\7\22\0\1\7\14\0\5\7\236\0\65\7"+
    "\22\0\4\7\24\0\1\7\40\0\60\7\24\0\2\7"+
    "\1\0\1\7\270\0\57\7\51\0\4\7\44\0\60\7"+
    "\24\0\1\7\73\0\53\7\15\0\1\7\107\0\33\7"+
    "\345\0\54\7\164\0\100\7\37\0\1\7\240\0\10\7"+
    "\2\0\47\7\20\0\1\7\1\0\1\7\34\0\1\7"+
    "\12\0\50\7\7\0\1\7\25\0\1\7\13\0\56\7"+
    "\23\0\1\7\42\0\71\7\7\0\11\7\1\0\45\7"+
    "\21\0\1\7\61\0\36\7\160\0\7\7\1\0\2\7"+
    "\1\0\46\7\25\0\1\7\31\0\6\7\1\0\2\7"+
    "\1\0\40\7\16\0\1\7\u0147\0\23\7\352\0\4\7"+
    "\37\0\232\7\146\0\157\7\21\0\304\7\274\0\57\7"+
    "\321\0\107\7\271\0\71\7\7\0\37\7\161\0\36\7"+
    "\22\0\60\7\20\0\4\7\37\0\25\7\5\0\23\7"+
    "\260\0\100\7\200\0\113\7\5\0\1\7\102\0\15\7"+
    "\100\0\2\7\1\0\1\7\34\0\370\7\10\0\363\7"+
    "\15\0\37\7\61\0\3\7\21\0\4\7\10\0\u018c\7"+
    "\4\0\153\7\5\0\15\7\3\0\11\7\7\0\12\7"+
    "\146\0\125\7\1\0\107\7\1\0\2\7\2\0\1\7"+
    "\2\0\2\7\2\0\4\7\1\0\14\7\1\0\1\7"+
    "\1\0\7\7\1\0\101\7\1\0\4\7\2\0\10\7"+
    "\1\0\7\7\1\0\34\7\1\0\4\7\1\0\5\7"+
    "\1\0\1\7\3\0\7\7\1\0\u0154\7\2\0\31\7"+
    "\1\0\31\7\1\0\37\7\1\0\31\7\1\0\37\7"+
    "\1\0\31\7\1\0\37\7\1\0\31\7\1\0\37\7"+
    "\1\0\31\7\1\0\10\7\64\0\55\7\12\0\7\7"+
    "\20\0\1\7\u0171\0\54\7\23\0\306\7\73\0\104\7"+
    "\7\0\1\7\u0164\0\1\7\117\0\4\7\1\0\33\7"+
    "\1\0\2\7\1\0\1\7\2\0\1\7\1\0\12\7"+
    "\1\0\4\7\1\0\1\7\1\0\1\7\6\0\1\7"+
    "\4\0\1\7\1\0\1\7\1\0\1\7\1\0\3\7"+
    "\1\0\2\7\1\0\1\7\2\0\1\7\1\0\1\7"+
    "\1\0\1\7\1\0\1\7\1\0\1\7\1\0\2\7"+
    "\1\0\1\7\2\0\4\7\1\0\7\7\1\0\4\7"+
    "\1\0\4\7\1\0\1\7\1\0\12\7\1\0\21\7"+
    "\5\0\3\7\1\0\5\7\1\0\21\7\104\0\327\7"+
    "\51\0\65\7\13\0\336\7\2\0\u0182\7\16\0\u0131\7"+
    "\37\0\36\7\342\0";

  private static int [] zzUnpackcmap_blocks() {
    int [] result = new int[28416];
    int offset = 0;
    offset = zzUnpackcmap_blocks(ZZ_CMAP_BLOCKS_PACKED_0, offset, result);
    return result;
  }

  private static int zzUnpackcmap_blocks(String packed, int offset, int [] result) {
    int i = 0;       /* index in packed string  */
    int j = offset;  /* index in unpacked array */
    int l = packed.length();
    while (i < l) {
      int count = packed.charAt(i++);
      int value = packed.charAt(i++);
      do result[j++] = value; while (--count > 0);
    }
    return j;
  }

  /**
   * Translates DFA states to action switch labels.
   */
  private static final int [] ZZ_ACTION = zzUnpackAction();

  private static final String ZZ_ACTION_PACKED_0 =
    "\1\0\1\1\2\2\1\3\1\1\1\4\1\5\1\6"+
    "\1\1\1\7\1\10\1\11\1\12\1\13\1\14\1\15"+
    "\1\16\2\17\1\20\1\21\1\22\1\23\1\24\1\25"+
    "\1\26\1\27\16\5\1\1\1\30\1\0\1\31\1\0"+
    "\1\32\2\0\1\33\1\34\1\0\1\35\1\36\1\35"+
    "\2\0\1\37\1\40\1\41\5\5\1\42\4\5\1\43"+
    "\12\5\1\44\1\45\2\0\1\35\7\5\1\46\16\5"+
    "\1\47\1\50\2\5\1\51\3\5\1\52\4\5\1\53"+
    "\1\54\1\55\1\5\1\56\1\57\2\5\1\60\3\5"+
    "\1\61\2\5\1\62\1\5\1\63\3\5\1\64\3\5"+
    "\1\65\1\66\1\5\1\67\1\70\1\5\1\71";

  private static int [] zzUnpackAction() {
    int [] result = new int[154];
    int offset = 0;
    offset = zzUnpackAction(ZZ_ACTION_PACKED_0, offset, result);
    return result;
  }

  private static int zzUnpackAction(String packed, int offset, int [] result) {
    int i = 0;       /* index in packed string  */
    int j = offset;  /* index in unpacked array */
    int l = packed.length();
    while (i < l) {
      int count = packed.charAt(i++);
      int value = packed.charAt(i++);
      do result[j++] = value; while (--count > 0);
    }
    return j;
  }


  /**
   * Translates a state to a row index in the transition table
   */
  private static final int [] ZZ_ROWMAP = zzUnpackRowMap();

  private static final String ZZ_ROWMAP_PACKED_0 =
    "\0\0\0\63\0\63\0\146\0\231\0\314\0\63\0\377"+
    "\0\u0132\0\u0165\0\63\0\63\0\63\0\u0198\0\63\0\u01cb"+
    "\0\u01fe\0\u0231\0\u0264\0\u0297\0\63\0\63\0\u02ca\0\u02fd"+
    "\0\u0330\0\63\0\63\0\63\0\u0363\0\u0396\0\u03c9\0\u03fc"+
    "\0\u042f\0\u0462\0\u0495\0\u04c8\0\u04fb\0\u052e\0\u0561\0\u0594"+
    "\0\u05c7\0\u05fa\0\u062d\0\63\0\314\0\63\0\u0660\0\63"+
    "\0\u0693\0\u06c6\0\63\0\63\0\u01fe\0\u0264\0\63\0\u06f9"+
    "\0\u072c\0\u075f\0\63\0\63\0\63\0\u0792\0\u07c5\0\u07f8"+
    "\0\u082b\0\u085e\0\u0891\0\u08c4\0\u08f7\0\u092a\0\u095d\0\377"+
    "\0\u0990\0\u09c3\0\u09f6\0\u0a29\0\u0a5c\0\u0a8f\0\u0ac2\0\u0af5"+
    "\0\u0b28\0\u0b5b\0\63\0\63\0\u0b8e\0\u0bc1\0\u0bc1\0\u0bf4"+
    "\0\u0c27\0\u0c5a\0\u0c8d\0\u0cc0\0\u0cf3\0\u0d26\0\377\0\u0d59"+
    "\0\u0d8c\0\u0dbf\0\u0df2\0\u0e25\0\u0e58\0\u0e8b\0\u0ebe\0\u0ef1"+
    "\0\u0f24\0\u0f57\0\u0f8a\0\u0fbd\0\u0ff0\0\377\0\377\0\u1023"+
    "\0\u1056\0\377\0\u1089\0\u10bc\0\u10ef\0\377\0\u1122\0\u1155"+
    "\0\u1188\0\u11bb\0\377\0\377\0\377\0\u11ee\0\377\0\377"+
    "\0\u1221\0\u1254\0\377\0\u1287\0\u12ba\0\u12ed\0\377\0\u1320"+
    "\0\u1353\0\377\0\u1386\0\377\0\u13b9\0\u13ec\0\u141f\0\377"+
    "\0\u1452\0\u1485\0\u14b8\0\377\0\377\0\u14eb\0\377\0\377"+
    "\0\u151e\0\377";

  private static int [] zzUnpackRowMap() {
    int [] result = new int[154];
    int offset = 0;
    offset = zzUnpackRowMap(ZZ_ROWMAP_PACKED_0, offset, result);
    return result;
  }

  private static int zzUnpackRowMap(String packed, int offset, int [] result) {
    int i = 0;  /* index in packed string  */
    int j = offset;  /* index in unpacked array */
    int l = packed.length();
    while (i < l) {
      int high = packed.charAt(i++) << 16;
      result[j++] = high | packed.charAt(i++);
    }
    return j;
  }

  /**
   * The transition table of the DFA
   */
  private static final int [] ZZ_TRANS = zzUnpackTrans();

  private static final String ZZ_TRANS_PACKED_0 =
    "\1\2\2\3\1\4\1\5\1\6\1\7\1\10\1\11"+
    "\1\12\1\13\1\14\1\15\1\16\1\17\1\20\1\21"+
    "\1\22\1\23\1\24\1\25\1\26\1\27\1\30\1\31"+
    "\1\32\1\10\1\33\1\2\1\34\1\35\1\36\1\37"+
    "\1\40\1\41\1\42\2\10\1\43\1\10\1\44\1\10"+
    "\1\45\1\46\1\47\1\50\1\10\1\51\1\52\1\10"+
    "\1\53\65\0\1\3\107\0\1\54\33\0\5\55\1\56"+
    "\26\55\1\57\26\55\7\0\1\10\12\0\2\10\6\0"+
    "\1\10\3\0\24\10\11\0\1\60\52\0\11\61\1\0"+
    "\22\61\1\62\26\61\15\0\1\63\64\0\1\64\1\65"+
    "\1\0\2\66\4\0\1\67\54\0\2\70\53\0\1\71"+
    "\66\0\1\70\1\0\2\66\6\0\1\72\7\0\1\72"+
    "\40\0\1\70\1\0\2\24\6\0\1\72\7\0\1\72"+
    "\47\0\1\73\62\0\1\74\62\0\1\75\42\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\15\10\1\76\6\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\4\10"+
    "\1\77\6\10\1\100\10\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\7\10\1\101\3\10\1\102\10\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\13\10"+
    "\1\103\10\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\11\10\1\104\1\105\11\10\10\0\1\10\12\0"+
    "\2\10\6\0\1\10\3\0\1\106\17\10\1\107\3\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\5\10"+
    "\1\110\4\10\1\111\11\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\20\10\1\112\3\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\13\10\1\113\1\10"+
    "\1\114\6\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\4\10\1\115\17\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\17\10\1\116\4\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\7\10\1\117\5\10"+
    "\1\120\6\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\13\10\1\121\10\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\7\10\1\122\14\10\63\0\1\123"+
    "\34\0\1\55\13\0\1\55\4\0\1\55\16\0\1\124"+
    "\105\0\1\61\13\0\1\61\4\0\1\61\27\0\2\70"+
    "\6\0\1\72\7\0\1\72\20\0\14\71\1\125\46\71"+
    "\17\0\1\126\2\0\2\127\46\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\15\10\1\130\6\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\6\10\1\131\15\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\13\10"+
    "\1\132\10\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\1\133\23\10\10\0\1\10\12\0\2\10\6\0"+
    "\1\10\3\0\12\10\1\134\11\10\10\0\1\10\12\0"+
    "\2\10\6\0\1\10\3\0\20\10\1\135\3\10\10\0"+
    "\1\10\12\0\2\10\6\0\1\10\3\0\16\10\1\136"+
    "\5\10\10\0\1\10\12\0\2\10\6\0\1\10\3\0"+
    "\3\10\1\137\20\10\10\0\1\10\12\0\2\10\6\0"+
    "\1\10\3\0\11\10\1\140\12\10\10\0\1\10\12\0"+
    "\2\10\6\0\1\10\3\0\12\10\1\141\11\10\10\0"+
    "\1\10\12\0\2\10\6\0\1\10\3\0\17\10\1\142"+
    "\4\10\10\0\1\10\12\0\2\10\6\0\1\10\3\0"+
    "\11\10\1\143\12\10\10\0\1\10\12\0\2\10\6\0"+
    "\1\10\3\0\10\10\1\144\13\10\10\0\1\10\12\0"+
    "\2\10\6\0\1\10\3\0\10\10\1\145\13\10\10\0"+
    "\1\10\12\0\2\10\6\0\1\10\3\0\17\10\1\146"+
    "\4\10\10\0\1\10\12\0\2\10\6\0\1\10\3\0"+
    "\15\10\1\147\6\10\10\0\1\10\12\0\2\10\6\0"+
    "\1\10\3\0\4\10\1\150\17\10\10\0\1\10\12\0"+
    "\2\10\6\0\1\10\3\0\20\10\1\151\3\10\10\0"+
    "\1\10\12\0\2\10\6\0\1\10\3\0\10\10\1\152"+
    "\13\10\10\0\1\10\12\0\2\10\6\0\1\10\3\0"+
    "\10\10\1\153\13\10\1\0\14\71\1\125\4\71\1\3"+
    "\41\71\22\0\2\127\46\0\1\10\12\0\2\10\6\0"+
    "\1\10\3\0\1\154\23\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\10\10\1\155\13\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\11\10\1\156\12\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\15\10"+
    "\1\157\6\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\16\10\1\160\5\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\1\10\1\161\22\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\4\10\1\162\17\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\16\10"+
    "\1\163\5\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\2\10\1\164\21\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\4\10\1\165\17\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\11\10\1\166\12\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\12\10"+
    "\1\167\11\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\12\10\1\170\11\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\20\10\1\171\3\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\20\10\1\172\3\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\12\10"+
    "\1\173\11\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\4\10\1\174\17\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\3\10\1\175\20\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\11\10\1\176\12\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\23\10"+
    "\1\177\10\0\1\10\12\0\2\10\6\0\1\10\3\0"+
    "\12\10\1\200\11\10\10\0\1\10\12\0\2\10\6\0"+
    "\1\10\3\0\17\10\1\201\4\10\10\0\1\10\12\0"+
    "\2\10\6\0\1\10\3\0\11\10\1\202\12\10\10\0"+
    "\1\10\12\0\2\10\6\0\1\10\3\0\4\10\1\203"+
    "\17\10\10\0\1\10\12\0\2\10\6\0\1\10\3\0"+
    "\17\10\1\204\4\10\10\0\1\10\12\0\2\10\6\0"+
    "\1\10\3\0\6\10\1\205\15\10\10\0\1\10\12\0"+
    "\2\10\6\0\1\10\3\0\17\10\1\206\4\10\10\0"+
    "\1\10\12\0\2\10\6\0\1\10\3\0\17\10\1\207"+
    "\4\10\10\0\1\10\12\0\2\10\6\0\1\10\3\0"+
    "\15\10\1\210\6\10\10\0\1\10\12\0\2\10\6\0"+
    "\1\10\3\0\2\10\1\211\21\10\10\0\1\10\12\0"+
    "\2\10\6\0\1\10\3\0\4\10\1\212\17\10\10\0"+
    "\1\10\12\0\2\10\6\0\1\10\3\0\1\213\23\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\4\10"+
    "\1\214\17\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\10\10\1\215\13\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\4\10\1\216\17\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\4\10\1\217\17\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\12\10"+
    "\1\220\11\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\17\10\1\221\4\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\12\10\1\222\11\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\13\10\1\223\10\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\15\10"+
    "\1\224\6\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\15\10\1\225\6\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\3\10\1\226\20\10\10\0\1\10"+
    "\12\0\2\10\6\0\1\10\3\0\17\10\1\227\4\10"+
    "\10\0\1\10\12\0\2\10\6\0\1\10\3\0\12\10"+
    "\1\230\11\10\10\0\1\10\12\0\2\10\6\0\1\10"+
    "\3\0\4\10\1\231\17\10\10\0\1\10\12\0\2\10"+
    "\6\0\1\10\3\0\5\10\1\232\16\10\1\0";

  private static int [] zzUnpackTrans() {
    int [] result = new int[5457];
    int offset = 0;
    offset = zzUnpackTrans(ZZ_TRANS_PACKED_0, offset, result);
    return result;
  }

  private static int zzUnpackTrans(String packed, int offset, int [] result) {
    int i = 0;       /* index in packed string  */
    int j = offset;  /* index in unpacked array */
    int l = packed.length();
    while (i < l) {
      int count = packed.charAt(i++);
      int value = packed.charAt(i++);
      value--;
      do result[j++] = value; while (--count > 0);
    }
    return j;
  }


  /** Error code for "Unknown internal scanner error". */
  private static final int ZZ_UNKNOWN_ERROR = 0;
  /** Error code for "could not match input". */
  private static final int ZZ_NO_MATCH = 1;
  /** Error code for "pushback value was too large". */
  private static final int ZZ_PUSHBACK_2BIG = 2;

  /**
   * Error messages for {@link #ZZ_UNKNOWN_ERROR}, {@link #ZZ_NO_MATCH}, and
   * {@link #ZZ_PUSHBACK_2BIG} respectively.
   */
  private static final String ZZ_ERROR_MSG[] = {
    "Unknown internal scanner error",
    "Error: could not match input",
    "Error: pushback value was too large"
  };

  /**
   * ZZ_ATTRIBUTE[aState] contains the attributes of state {@code aState}
   */
  private static final int [] ZZ_ATTRIBUTE = zzUnpackAttribute();

  private static final String ZZ_ATTRIBUTE_PACKED_0 =
    "\1\0\2\11\3\1\1\11\3\1\3\11\1\1\1\11"+
    "\5\1\2\11\3\1\3\11\17\1\1\11\1\0\1\11"+
    "\1\0\1\11\2\0\2\11\1\0\1\1\1\11\1\1"+
    "\2\0\3\11\25\1\2\11\2\0\104\1";

  private static int [] zzUnpackAttribute() {
    int [] result = new int[154];
    int offset = 0;
    offset = zzUnpackAttribute(ZZ_ATTRIBUTE_PACKED_0, offset, result);
    return result;
  }

  private static int zzUnpackAttribute(String packed, int offset, int [] result) {
    int i = 0;       /* index in packed string  */
    int j = offset;  /* index in unpacked array */
    int l = packed.length();
    while (i < l) {
      int count = packed.charAt(i++);
      int value = packed.charAt(i++);
      do result[j++] = value; while (--count > 0);
    }
    return j;
  }

  /** Input device. */
  private java.io.Reader zzReader;

  /** Current state of the DFA. */
  private int zzState;

  /** Current lexical state. */
  private int zzLexicalState = YYINITIAL;

  /**
   * This buffer contains the current text to be matched and is the source of the {@link #yytext()}
   * string.
   */
  private char zzBuffer[] = new char[ZZ_BUFFERSIZE];

  /** Text position at the last accepting state. */
  private int zzMarkedPos;

  /** Current text position in the buffer. */
  private int zzCurrentPos;

  /** Marks the beginning of the {@link #yytext()} string in the buffer. */
  private int zzStartRead;

  /** Marks the last character in the buffer, that has been read from input. */
  private int zzEndRead;

  /**
   * Whether the scanner is at the end of file.
   * @see #yyatEOF
   */
  private boolean zzAtEOF;

  /**
   * The number of occupied positions in {@link #zzBuffer} beyond {@link #zzEndRead}.
   *
   * <p>When a lead/high surrogate has been read from the input stream into the final
   * {@link #zzBuffer} position, this will have a value of 1; otherwise, it will have a value of 0.
   */
  private int zzFinalHighSurrogate = 0;

  /** Number of newlines encountered up to the start of the matched text. */
  private int yyline;

  /** Number of characters from the last newline up to the start of the matched text. */
  private int yycolumn;

  /** Number of characters up to the start of the matched text. */
  @SuppressWarnings("unused")
  private long yychar;

  /** Whether the scanner is currently at the beginning of a line. */
  @SuppressWarnings("unused")
  private boolean zzAtBOL = true;

  /** Whether the user-EOF-code has already been executed. */
  private boolean zzEOFDone;

  /* user code: */
   StringBuffer readstring = new StringBuffer();

   private Symbol symbol( int type ) { 
      return new Symbol( type, yyline, yycolumn ); 
   }

   private Symbol symbol( int type, Object value )
   {
      return new Symbol( type, yyline, yycolumn, value ); 
   }


  /**
   * Creates a new scanner
   *
   * @param   in  the java.io.Reader to read input from.
   */
  Lexer(java.io.Reader in) {
    this.zzReader = in;
  }

  /**
   * Translates raw input code points to DFA table row
   */
  private static int zzCMap(int input) {
    int offset = input & 255;
    return offset == input ? ZZ_CMAP_BLOCKS[offset] : ZZ_CMAP_BLOCKS[ZZ_CMAP_TOP[input >> 8] | offset];
  }

  /**
   * Refills the input buffer.
   *
   * @return {@code false} iff there was new input.
   * @exception java.io.IOException  if any I/O-Error occurs
   */
  private boolean zzRefill() throws java.io.IOException {

    /* first: make room (if you can) */
    if (zzStartRead > 0) {
      zzEndRead += zzFinalHighSurrogate;
      zzFinalHighSurrogate = 0;
      System.arraycopy(zzBuffer, zzStartRead,
                       zzBuffer, 0,
                       zzEndRead - zzStartRead);

      /* translate stored positions */
      zzEndRead -= zzStartRead;
      zzCurrentPos -= zzStartRead;
      zzMarkedPos -= zzStartRead;
      zzStartRead = 0;
    }

    /* is the buffer big enough? */
    if (zzCurrentPos >= zzBuffer.length - zzFinalHighSurrogate) {
      /* if not: blow it up */
      char newBuffer[] = new char[zzBuffer.length * 2];
      System.arraycopy(zzBuffer, 0, newBuffer, 0, zzBuffer.length);
      zzBuffer = newBuffer;
      zzEndRead += zzFinalHighSurrogate;
      zzFinalHighSurrogate = 0;
    }

    /* fill the buffer with new input */
    int requested = zzBuffer.length - zzEndRead;
    int numRead = zzReader.read(zzBuffer, zzEndRead, requested);

    /* not supposed to occur according to specification of java.io.Reader */
    if (numRead == 0) {
      throw new java.io.IOException(
          "Reader returned 0 characters. See JFlex examples/zero-reader for a workaround.");
    }
    if (numRead > 0) {
      zzEndRead += numRead;
      if (Character.isHighSurrogate(zzBuffer[zzEndRead - 1])) {
        if (numRead == requested) { // We requested too few chars to encode a full Unicode character
          --zzEndRead;
          zzFinalHighSurrogate = 1;
        } else {                    // There is room in the buffer for at least one more char
          int c = zzReader.read();  // Expecting to read a paired low surrogate char
          if (c == -1) {
            return true;
          } else {
            zzBuffer[zzEndRead++] = (char)c;
          }
        }
      }
      /* potentially more input available */
      return false;
    }

    /* numRead < 0 ==> end of stream */
    return true;
  }


  /**
   * Closes the input reader.
   *
   * @throws java.io.IOException if the reader could not be closed.
   */
  public final void yyclose() throws java.io.IOException {
    zzAtEOF = true; // indicate end of file
    zzEndRead = zzStartRead; // invalidate buffer

    if (zzReader != null) {
      zzReader.close();
    }
  }


  /**
   * Resets the scanner to read from a new input stream.
   *
   * <p>Does not close the old reader.
   *
   * <p>All internal variables are reset, the old input stream <b>cannot</b> be reused (internal
   * buffer is discarded and lost). Lexical state is set to {@code ZZ_INITIAL}.
   *
   * <p>Internal scan buffer is resized down to its initial length, if it has grown.
   *
   * @param reader The new input stream.
   */
  public final void yyreset(java.io.Reader reader) {
    zzReader = reader;
    zzEOFDone = false;
    yyResetPosition();
    zzLexicalState = YYINITIAL;
    if (zzBuffer.length > ZZ_BUFFERSIZE) {
      zzBuffer = new char[ZZ_BUFFERSIZE];
    }
  }

  /**
   * Resets the input position.
   */
  private final void yyResetPosition() {
      zzAtBOL  = true;
      zzAtEOF  = false;
      zzCurrentPos = 0;
      zzMarkedPos = 0;
      zzStartRead = 0;
      zzEndRead = 0;
      zzFinalHighSurrogate = 0;
      yyline = 0;
      yycolumn = 0;
      yychar = 0L;
  }


  /**
   * Returns whether the scanner has reached the end of the reader it reads from.
   *
   * @return whether the scanner has reached EOF.
   */
  public final boolean yyatEOF() {
    return zzAtEOF;
  }


  /**
   * Returns the current lexical state.
   *
   * @return the current lexical state.
   */
  public final int yystate() {
    return zzLexicalState;
  }


  /**
   * Enters a new lexical state.
   *
   * @param newState the new lexical state
   */
  public final void yybegin(int newState) {
    zzLexicalState = newState;
  }


  /**
   * Returns the text matched by the current regular expression.
   *
   * @return the matched text.
   */
  public final String yytext() {
    return new String(zzBuffer, zzStartRead, zzMarkedPos-zzStartRead);
  }


  /**
   * Returns the character at the given position from the matched text.
   *
   * <p>It is equivalent to {@code yytext().charAt(pos)}, but faster.
   *
   * @param position the position of the character to fetch. A value from 0 to {@code yylength()-1}.
   *
   * @return the character at {@code position}.
   */
  public final char yycharat(int position) {
    return zzBuffer[zzStartRead + position];
  }


  /**
   * How many characters were matched.
   *
   * @return the length of the matched text region.
   */
  public final int yylength() {
    return zzMarkedPos-zzStartRead;
  }


  /**
   * Reports an error that occurred while scanning.
   *
   * <p>In a well-formed scanner (no or only correct usage of {@code yypushback(int)} and a
   * match-all fallback rule) this method will only be called with things that
   * "Can't Possibly Happen".
   *
   * <p>If this method is called, something is seriously wrong (e.g. a JFlex bug producing a faulty
   * scanner etc.).
   *
   * <p>Usual syntax/scanner level error handling should be done in error fallback rules.
   *
   * @param errorCode the code of the error message to display.
   */
  private static void zzScanError(int errorCode) {
    String message;
    try {
      message = ZZ_ERROR_MSG[errorCode];
    } catch (ArrayIndexOutOfBoundsException e) {
      message = ZZ_ERROR_MSG[ZZ_UNKNOWN_ERROR];
    }

    throw new Error(message);
  }


  /**
   * Pushes the specified amount of characters back into the input stream.
   *
   * <p>They will be read again by then next call of the scanning method.
   *
   * @param number the number of characters to be read again. This number must not be greater than
   *     {@link #yylength()}.
   */
  public void yypushback(int number)  {
    if ( number > yylength() )
      zzScanError(ZZ_PUSHBACK_2BIG);

    zzMarkedPos -= number;
  }


  /**
   * Contains user EOF-code, which will be executed exactly once,
   * when the end of file is reached
   */
  private void zzDoEOF() throws java.io.IOException {
    if (!zzEOFDone) {
      zzEOFDone = true;
    
  yyclose();    }
  }




  /**
   * Resumes scanning until the next regular expression is matched, the end of input is encountered
   * or an I/O-Error occurs.
   *
   * @return the next token.
   * @exception java.io.IOException if any I/O-Error occurs.
   */
  @Override  public java_cup.runtime.Symbol next_token() throws java.io.IOException, ScanError {
    int zzInput;
    int zzAction;

    // cached fields:
    int zzCurrentPosL;
    int zzMarkedPosL;
    int zzEndReadL = zzEndRead;
    char[] zzBufferL = zzBuffer;

    int [] zzTransL = ZZ_TRANS;
    int [] zzRowMapL = ZZ_ROWMAP;
    int [] zzAttrL = ZZ_ATTRIBUTE;

    while (true) {
      zzMarkedPosL = zzMarkedPos;

      boolean zzR = false;
      int zzCh;
      int zzCharCount;
      for (zzCurrentPosL = zzStartRead  ;
           zzCurrentPosL < zzMarkedPosL ;
           zzCurrentPosL += zzCharCount ) {
        zzCh = Character.codePointAt(zzBufferL, zzCurrentPosL, zzMarkedPosL);
        zzCharCount = Character.charCount(zzCh);
        switch (zzCh) {
        case '\u000B':  // fall through
        case '\u000C':  // fall through
        case '\u0085':  // fall through
        case '\u2028':  // fall through
        case '\u2029':
          yyline++;
          yycolumn = 0;
          zzR = false;
          break;
        case '\r':
          yyline++;
          yycolumn = 0;
          zzR = true;
          break;
        case '\n':
          if (zzR)
            zzR = false;
          else {
            yyline++;
            yycolumn = 0;
          }
          break;
        default:
          zzR = false;
          yycolumn += zzCharCount;
        }
      }

      if (zzR) {
        // peek one character ahead if it is
        // (if we have counted one line too much)
        boolean zzPeek;
        if (zzMarkedPosL < zzEndReadL)
          zzPeek = zzBufferL[zzMarkedPosL] == '\n';
        else if (zzAtEOF)
          zzPeek = false;
        else {
          boolean eof = zzRefill();
          zzEndReadL = zzEndRead;
          zzMarkedPosL = zzMarkedPos;
          zzBufferL = zzBuffer;
          if (eof)
            zzPeek = false;
          else
            zzPeek = zzBufferL[zzMarkedPosL] == '\n';
        }
        if (zzPeek) yyline--;
      }
      zzAction = -1;

      zzCurrentPosL = zzCurrentPos = zzStartRead = zzMarkedPosL;

      zzState = ZZ_LEXSTATE[zzLexicalState];

      // set up zzAction for empty match case:
      int zzAttributes = zzAttrL[zzState];
      if ( (zzAttributes & 1) == 1 ) {
        zzAction = zzState;
      }


      zzForAction: {
        while (true) {

          if (zzCurrentPosL < zzEndReadL) {
            zzInput = Character.codePointAt(zzBufferL, zzCurrentPosL, zzEndReadL);
            zzCurrentPosL += Character.charCount(zzInput);
          }
          else if (zzAtEOF) {
            zzInput = YYEOF;
            break zzForAction;
          }
          else {
            // store back cached positions
            zzCurrentPos  = zzCurrentPosL;
            zzMarkedPos   = zzMarkedPosL;
            boolean eof = zzRefill();
            // get translated positions and possibly new buffer
            zzCurrentPosL  = zzCurrentPos;
            zzMarkedPosL   = zzMarkedPos;
            zzBufferL      = zzBuffer;
            zzEndReadL     = zzEndRead;
            if (eof) {
              zzInput = YYEOF;
              break zzForAction;
            }
            else {
              zzInput = Character.codePointAt(zzBufferL, zzCurrentPosL, zzEndReadL);
              zzCurrentPosL += Character.charCount(zzInput);
            }
          }
          int zzNext = zzTransL[ zzRowMapL[zzState] + zzCMap(zzInput) ];
          if (zzNext == -1) break zzForAction;
          zzState = zzNext;

          zzAttributes = zzAttrL[zzState];
          if ( (zzAttributes & 1) == 1 ) {
            zzAction = zzState;
            zzMarkedPosL = zzCurrentPosL;
            if ( (zzAttributes & 8) == 8 ) break zzForAction;
          }

        }
      }

      // store back cached position
      zzMarkedPos = zzMarkedPosL;

      if (zzInput == YYEOF && zzStartRead == zzCurrentPos) {
        zzAtEOF = true;
            zzDoEOF();
          { return new java_cup.runtime.Symbol(sym.EOF); }
      }
      else {
        switch (zzAction < 0 ? zzAction : ZZ_ACTION[zzAction]) {
          case 1:
            { throw new ScanError( "Unrecognized character <" + yytext( ) + ">",
                              yyline, yycolumn );
            }
            // fall through
          case 58: break;
          case 2:
            { 
            }
            // fall through
          case 59: break;
          case 3:
            { return symbol( sym. NOT );
            }
            // fall through
          case 60: break;
          case 4:
            { return symbol( sym. EOF );
            }
            // fall through
          case 61: break;
          case 5:
            { return symbol( sym. IDENTIFIER, new ast.Identifier( yytext( ) ));
            }
            // fall through
          case 62: break;
          case 6:
            { return symbol( sym. AMPERSAND );
            }
            // fall through
          case 63: break;
          case 7:
            { return symbol( sym. LPAR );
            }
            // fall through
          case 64: break;
          case 8:
            { return symbol( sym. RPAR );
            }
            // fall through
          case 65: break;
          case 9:
            { return symbol( sym. MUL );
            }
            // fall through
          case 66: break;
          case 10:
            { return symbol( sym. ADD );
            }
            // fall through
          case 67: break;
          case 11:
            { return symbol( sym. COMMA );
            }
            // fall through
          case 68: break;
          case 12:
            { return symbol( sym. SUB );
            }
            // fall through
          case 69: break;
          case 13:
            { return symbol( sym. DOT );
            }
            // fall through
          case 70: break;
          case 14:
            { return symbol( sym. TRUEDIV );
            }
            // fall through
          case 71: break;
          case 15:
            { return symbol( sym.INTEGERCONST,
                     new ast.Integer( new java.lang.Integer( yytext( ) )));
            }
            // fall through
          case 72: break;
          case 16:
            { return symbol( sym. COLON );
            }
            // fall through
          case 73: break;
          case 17:
            { return symbol( sym. SEMICOLON );
            }
            // fall through
          case 74: break;
          case 18:
            { return symbol( sym. LT );
            }
            // fall through
          case 75: break;
          case 19:
            { return symbol( sym. ASSIGN );
            }
            // fall through
          case 76: break;
          case 20:
            { return symbol( sym. GT );
            }
            // fall through
          case 77: break;
          case 21:
            { return symbol( sym. QUESTION );
            }
            // fall through
          case 78: break;
          case 22:
            { return symbol( sym. LSQPAR );
            }
            // fall through
          case 79: break;
          case 23:
            { return symbol( sym. RSQPAR );
            }
            // fall through
          case 80: break;
          case 24:
            { return symbol( sym. NE );
            }
            // fall through
          case 81: break;
          case 25:
            { return symbol( sym. STRINGCONST, new ast.String(yytext( ).substring(1, yytext().length()-1)) );
            }
            // fall through
          case 82: break;
          case 26:
            { return symbol( sym. AND );
            }
            // fall through
          case 83: break;
          case 27:
            { return symbol( sym. PLUSPLUS );
            }
            // fall through
          case 84: break;
          case 28:
            { return symbol( sym. MINUSMINUS );
            }
            // fall through
          case 85: break;
          case 29:
            { return symbol( sym.DOUBLECONST,
                     new ast.Double( new java.lang.Double( yytext( ) )));
            }
            // fall through
          case 86: break;
          case 30:
            { return symbol( sym. ARROW );
            }
            // fall through
          case 87: break;
          case 31:
            { return symbol( sym. LE );
            }
            // fall through
          case 88: break;
          case 32:
            { return symbol( sym. EQ );
            }
            // fall through
          case 89: break;
          case 33:
            { return symbol( sym. GE );
            }
            // fall through
          case 90: break;
          case 34:
            { return symbol( sym. DO );
            }
            // fall through
          case 91: break;
          case 35:
            { return symbol( sym. IF );
            }
            // fall through
          case 92: break;
          case 36:
            { return symbol( sym. OR );
            }
            // fall through
          case 93: break;
          case 37:
            { return symbol( sym. CHARCONST, new ast.Char(yytext( ).charAt(1)) );
            }
            // fall through
          case 94: break;
          case 38:
            { return symbol( sym. END );
            }
            // fall through
          case 95: break;
          case 39:
            { return symbol( sym. BOOL );
            }
            // fall through
          case 96: break;
          case 40:
            { return symbol( sym. CHAR );
            }
            // fall through
          case 97: break;
          case 41:
            { return symbol( sym. ELSE );
            }
            // fall through
          case 98: break;
          case 42:
            { return symbol( sym. POINTERCONST, new ast.Pointer(0) );
            }
            // fall through
          case 99: break;
          case 43:
            { return symbol( sym. THEN );
            }
            // fall through
          case 100: break;
          case 44:
            { return symbol( sym. BOOLCONST, new ast.Bool(true) );
            }
            // fall through
          case 101: break;
          case 45:
            { return symbol( sym. VOID );
            }
            // fall through
          case 102: break;
          case 46:
            { return symbol( sym. ARRAY );
            }
            // fall through
          case 103: break;
          case 47:
            { return symbol( sym. BEGIN );
            }
            // fall through
          case 104: break;
          case 48:
            { return symbol( sym. BOOLCONST, new ast.Bool(false) );
            }
            // fall through
          case 105: break;
          case 49:
            { return symbol( sym. PRINT );
            }
            // fall through
          case 106: break;
          case 50:
            { return symbol( sym. WHILE );
            }
            // fall through
          case 107: break;
          case 51:
            { return symbol( sym. DOUBLE );
            }
            // fall through
          case 108: break;
          case 52:
            { return symbol( sym. RETURN );
            }
            // fall through
          case 109: break;
          case 53:
            { return symbol( sym. INTEGER );
            }
            // fall through
          case 110: break;
          case 54:
            { return symbol( sym. POINTER );
            }
            // fall through
          case 111: break;
          case 55:
            { return symbol( sym. CONSTANT );
            }
            // fall through
          case 112: break;
          case 56:
            { return symbol( sym. FUNCTION );
            }
            // fall through
          case 113: break;
          case 57:
            { return symbol( sym. STRUCTDEF );
            }
            // fall through
          case 114: break;
          default:
            zzScanError(ZZ_NO_MATCH);
        }
      }
    }
  }


}