/* The following code was generated by JFlex 1.4.2 on 27/10/2024, 17:47 */ /* * Copyright (C) 2018 Eric Koskinen * Copyright (C) 2018 Daniel Dietsch (dietsch@informatik.uni-freiburg.de) * Copyright (C) 2018 University of Freiburg * * This file is part of the ULTIMATE Crocotta plug-in. * * The ULTIMATE Crocotta plug-in is free software: you can redistribute it and/or modify * it under the terms of the GNU Lesser General Public License as published * by the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * The ULTIMATE Crocotta plug-in is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with the ULTIMATE Crocotta plug-in. If not, see . * * Additional permission under GNU GPL version 3 section 7: * If you modify the ULTIMATE Crocotta plug-in, or any covered work, by linking * or combining it with Eclipse RCP (or a modified version of Eclipse RCP), * containing parts covered by the terms of the Eclipse Public License, the * licensors of the ULTIMATE Crocotta plug-in grant you additional permission * to convey the resulting work. */ package de.uni_freiburg.informatik.ultimate.crocotta.parser; import com.github.jhoenicke.javacup.runtime.Symbol; /** * This class is a scanner generated by * JFlex 1.4.2 * on 27/10/2024, 17:47 from the specification file * CrocParser.flex */ public class CrocLexer implements com.github.jhoenicke.javacup.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 }; /** * Translates characters to character classes */ private static final String ZZ_CMAP_PACKED = "\11\0\1\3\1\2\1\0\1\3\1\1\22\0\1\3\1\0\1\31"+ "\2\6\2\0\1\6\1\10\1\11\1\5\3\0\1\0\1\4\1\7"+ "\11\7\2\0\1\13\1\12\1\0\1\6\1\0\32\6\1\27\1\6"+ "\1\30\2\6\1\0\1\15\1\6\1\20\1\6\1\26\3\6\1\16"+ "\4\6\1\22\1\21\1\14\1\6\1\17\1\25\1\23\1\24\5\6"+ "\3\0\1\6\53\0\1\6\12\0\1\6\4\0\1\6\5\0\27\6"+ "\1\0\37\6\1\0\u01ca\6\4\0\14\6\16\0\5\6\7\0\1\6"+ "\1\0\1\6\201\0\5\6\1\0\2\6\2\0\4\6\1\0\1\6"+ "\6\0\1\6\1\0\3\6\1\0\1\6\1\0\24\6\1\0\123\6"+ "\1\0\213\6\10\0\246\6\1\0\46\6\2\0\1\6\7\0\47\6"+ "\110\0\33\6\5\0\3\6\55\0\53\6\25\0\12\7\4\0\2\6"+ "\1\0\143\6\1\0\1\6\17\0\2\6\7\0\2\6\12\7\3\6"+ "\2\0\1\6\20\0\1\6\1\0\36\6\35\0\131\6\13\0\1\6"+ "\16\0\12\7\41\6\11\0\2\6\4\0\1\6\5\0\26\6\4\0"+ "\1\6\11\0\1\6\3\0\1\6\27\0\31\6\7\0\13\6\65\0"+ "\25\6\1\0\10\6\106\0\66\6\3\0\1\6\22\0\1\6\7\0"+ "\12\6\4\0\12\7\1\0\20\6\4\0\10\6\2\0\2\6\2\0"+ "\26\6\1\0\7\6\1\0\1\6\3\0\4\6\3\0\1\6\20\0"+ "\1\6\15\0\2\6\1\0\3\6\4\0\12\7\2\6\12\0\1\6"+ "\10\0\6\6\4\0\2\6\2\0\26\6\1\0\7\6\1\0\2\6"+ "\1\0\2\6\1\0\2\6\37\0\4\6\1\0\1\6\7\0\12\7"+ "\2\0\3\6\20\0\11\6\1\0\3\6\1\0\26\6\1\0\7\6"+ "\1\0\2\6\1\0\5\6\3\0\1\6\22\0\1\6\17\0\2\6"+ "\4\0\12\7\11\0\1\6\13\0\10\6\2\0\2\6\2\0\26\6"+ "\1\0\7\6\1\0\2\6\1\0\5\6\3\0\1\6\36\0\2\6"+ "\1\0\3\6\4\0\12\7\1\0\1\6\21\0\1\6\1\0\6\6"+ "\3\0\3\6\1\0\4\6\3\0\2\6\1\0\1\6\1\0\2\6"+ "\3\0\2\6\3\0\3\6\3\0\14\6\26\0\1\6\25\0\12\7"+ "\25\0\10\6\1\0\3\6\1\0\27\6\1\0\20\6\3\0\1\6"+ "\32\0\3\6\5\0\2\6\4\0\12\7\20\0\1\6\4\0\10\6"+ "\1\0\3\6\1\0\27\6\1\0\12\6\1\0\5\6\3\0\1\6"+ "\40\0\1\6\1\0\2\6\4\0\12\7\1\0\2\6\22\0\10\6"+ "\1\0\3\6\1\0\51\6\2\0\1\6\20\0\1\6\5\0\3\6"+ "\10\0\3\6\4\0\12\7\12\0\6\6\5\0\22\6\3\0\30\6"+ "\1\0\11\6\1\0\1\6\2\0\7\6\37\0\12\7\21\0\60\6"+ "\1\0\2\6\14\0\7\6\11\0\12\7\47\0\2\6\1\0\1\6"+ "\2\0\2\6\1\0\1\6\2\0\1\6\6\0\4\6\1\0\7\6"+ "\1\0\3\6\1\0\1\6\1\0\1\6\2\0\2\6\1\0\4\6"+ "\1\0\2\6\11\0\1\6\2\0\5\6\1\0\1\6\11\0\12\7"+ "\2\0\4\6\40\0\1\6\37\0\12\7\26\0\10\6\1\0\44\6"+ "\33\0\5\6\163\0\53\6\24\0\1\6\12\7\6\0\6\6\4\0"+ "\4\6\3\0\1\6\3\0\2\6\7\0\3\6\4\0\15\6\14\0"+ "\1\6\1\0\12\7\6\0\46\6\1\0\1\6\5\0\1\6\2\0"+ "\53\6\1\0\u014d\6\1\0\4\6\2\0\7\6\1\0\1\6\1\0"+ "\4\6\2\0\51\6\1\0\4\6\2\0\41\6\1\0\4\6\2\0"+ "\7\6\1\0\1\6\1\0\4\6\2\0\17\6\1\0\71\6\1\0"+ "\4\6\2\0\103\6\45\0\20\6\20\0\126\6\2\0\6\6\3\0"+ "\u026c\6\2\0\21\6\1\0\32\6\5\0\113\6\6\0\10\6\7\0"+ "\15\6\1\0\4\6\16\0\22\6\16\0\22\6\16\0\15\6\1\0"+ "\3\6\17\0\64\6\43\0\1\6\4\0\1\6\3\0\12\7\46\0"+ "\12\7\6\0\130\6\10\0\5\6\2\0\42\6\1\0\1\6\5\0"+ "\106\6\12\0\37\6\47\0\12\7\36\6\2\0\5\6\13\0\54\6"+ "\4\0\32\6\6\0\12\7\46\0\27\6\11\0\65\6\53\0\12\7"+ "\6\0\12\7\15\0\1\6\135\0\57\6\21\0\7\6\4\0\12\7"+ "\51\0\36\6\15\0\2\6\12\7\54\6\32\0\44\6\34\0\12\7"+ "\3\0\3\6\12\7\44\6\2\0\11\6\140\0\4\6\1\0\4\6"+ "\3\0\2\6\11\0\300\6\100\0\u0116\6\2\0\6\6\2\0\46\6"+ "\2\0\6\6\2\0\10\6\1\0\1\6\1\0\1\6\1\0\1\6"+ "\1\0\37\6\2\0\65\6\1\0\7\6\1\0\1\6\3\0\3\6"+ "\1\0\7\6\3\0\4\6\2\0\6\6\4\0\15\6\5\0\3\6"+ "\1\0\7\6\164\0\1\6\15\0\1\6\20\0\15\6\145\0\1\6"+ "\4\0\1\6\2\0\12\6\1\0\1\6\3\0\5\6\6\0\1\6"+ "\1\0\1\6\1\0\1\6\1\0\4\6\1\0\13\6\2\0\4\6"+ "\5\0\5\6\4\0\1\6\64\0\2\6\u0a7b\0\57\6\1\0\57\6"+ "\1\0\205\6\6\0\4\6\3\0\2\6\14\0\46\6\1\0\1\6"+ "\5\0\1\6\2\0\70\6\7\0\1\6\20\0\27\6\11\0\7\6"+ "\1\0\7\6\1\0\7\6\1\0\7\6\1\0\7\6\1\0\7\6"+ "\1\0\7\6\1\0\7\6\120\0\1\6\u01d5\0\2\6\52\0\5\6"+ "\5\0\2\6\4\0\126\6\6\0\3\6\1\0\132\6\1\0\4\6"+ "\5\0\52\6\2\0\136\6\21\0\33\6\65\0\20\6\u0200\0\u19b6\6"+ "\112\0\u51f0\6\20\0\u048d\6\103\0\56\6\2\0\u010d\6\3\0\20\6"+ "\12\7\2\6\24\0\57\6\20\0\37\6\2\0\106\6\61\0\11\6"+ "\2\0\147\6\2\0\44\6\1\0\10\6\77\0\13\6\1\0\3\6"+ "\1\0\4\6\1\0\27\6\35\0\64\6\16\0\62\6\34\0\12\7"+ "\30\0\6\6\3\0\1\6\1\0\1\6\2\0\12\7\34\6\12\0"+ "\27\6\31\0\35\6\7\0\57\6\34\0\1\6\12\7\6\0\5\6"+ "\1\0\12\6\12\7\5\6\1\0\51\6\27\0\3\6\1\0\10\6"+ "\4\0\12\7\6\0\27\6\3\0\1\6\3\0\62\6\1\0\1\6"+ "\3\0\2\6\2\0\5\6\2\0\1\6\1\0\1\6\30\0\3\6"+ "\2\0\13\6\7\0\3\6\14\0\6\6\2\0\6\6\2\0\6\6"+ "\11\0\7\6\1\0\7\6\1\0\53\6\1\0\12\6\12\0\163\6"+ "\15\0\12\7\6\0\u2ba4\6\14\0\27\6\4\0\61\6\u2104\0\u016e\6"+ "\2\0\152\6\46\0\7\6\14\0\5\6\5\0\1\6\1\0\12\6"+ "\1\0\15\6\1\0\5\6\1\0\1\6\1\0\2\6\1\0\2\6"+ "\1\0\154\6\41\0\u016b\6\22\0\100\6\2\0\66\6\50\0\14\6"+ "\164\0\5\6\1\0\207\6\23\0\12\7\7\0\32\6\6\0\32\6"+ "\13\0\131\6\3\0\6\6\2\0\6\6\2\0\6\6\2\0\3\6"+ "\43\0"; /** * Translates characters to character classes */ private static final char [] ZZ_CMAP = zzUnpackCMap(ZZ_CMAP_PACKED); /** * 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\1\1\3\1\4\1\5\1\6"+ "\1\1\4\3\1\7\1\10\1\11\1\2\1\0\1\12"+ "\4\3\1\0\4\3\1\13\4\3\1\14\2\3\1\15"+ "\1\16\5\3\1\17"; private static int [] zzUnpackAction() { int [] result = new int[45]; 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\32\0\64\0\32\0\116\0\150\0\32\0\32"+ "\0\32\0\202\0\234\0\266\0\320\0\352\0\32\0\32"+ "\0\32\0\u0104\0\u011e\0\32\0\u0138\0\u0152\0\u016c\0\u0186"+ "\0\u01a0\0\u01ba\0\u01d4\0\u01ee\0\u0208\0\150\0\u0222\0\u023c"+ "\0\u0256\0\u0270\0\150\0\u028a\0\u02a4\0\150\0\150\0\u02be"+ "\0\u02d8\0\u02f2\0\u030c\0\u0326\0\150"; private static int [] zzUnpackRowMap() { int [] result = new int[45]; 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\1\3\2\4\1\5\1\2\1\6\1\2\1\7"+ "\1\10\1\11\1\12\1\13\1\6\1\14\1\6\1\15"+ "\3\6\1\16\2\6\1\17\1\20\1\21\34\0\1\4"+ "\33\0\1\22\1\23\32\0\2\6\4\0\13\6\15\0"+ "\1\24\25\0\2\6\4\0\1\6\1\25\11\6\11\0"+ "\2\6\4\0\11\6\1\26\1\6\11\0\2\6\4\0"+ "\5\6\1\27\5\6\11\0\2\6\4\0\6\6\1\30"+ "\4\6\3\0\1\22\1\3\1\4\27\22\5\23\1\31"+ "\24\23\6\0\2\6\4\0\2\6\1\32\10\6\11\0"+ "\2\6\4\0\12\6\1\33\11\0\2\6\4\0\6\6"+ "\1\34\4\6\11\0\2\6\4\0\2\6\1\35\10\6"+ "\3\0\4\23\1\4\1\31\24\23\6\0\2\6\4\0"+ "\3\6\1\36\7\6\11\0\2\6\4\0\4\6\1\37"+ "\6\6\11\0\2\6\4\0\4\6\1\40\4\6\1\41"+ "\1\6\11\0\2\6\4\0\5\6\1\42\5\6\11\0"+ "\2\6\4\0\7\6\1\43\3\6\11\0\2\6\4\0"+ "\1\6\1\44\11\6\11\0\2\6\4\0\7\6\1\45"+ "\3\6\11\0\2\6\4\0\6\6\1\46\4\6\11\0"+ "\2\6\4\0\7\6\1\47\3\6\11\0\2\6\4\0"+ "\3\6\1\50\7\6\11\0\2\6\4\0\1\6\1\51"+ "\11\6\11\0\2\6\4\0\2\6\1\52\10\6\11\0"+ "\2\6\4\0\6\6\1\53\4\6\11\0\2\6\4\0"+ "\7\6\1\54\3\6\11\0\2\6\4\0\11\6\1\55"+ "\1\6\3\0"; private static int [] zzUnpackTrans() { int [] result = new int[832]; 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 codes */ private static final int ZZ_UNKNOWN_ERROR = 0; private static final int ZZ_NO_MATCH = 1; private static final int ZZ_PUSHBACK_2BIG = 2; /* error messages for the codes above */ private static final String ZZ_ERROR_MSG[] = { "Unkown internal scanner error", "Error: could not match input", "Error: pushback value was too large" }; /** * ZZ_ATTRIBUTE[aState] contains the attributes of state aState */ private static final int [] ZZ_ATTRIBUTE = zzUnpackAttribute(); private static final String ZZ_ATTRIBUTE_PACKED_0 = "\1\0\1\11\1\1\1\11\2\1\3\11\5\1\3\11"+ "\1\1\1\0\1\11\4\1\1\0\24\1"; private static int [] zzUnpackAttribute() { int [] result = new int[45]; 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; } /** the input device */ private java.io.Reader zzReader; /** the current state of the DFA */ private int zzState; /** the current lexical state */ private int zzLexicalState = YYINITIAL; /** this buffer contains the current text to be matched and is the source of the yytext() string */ private char zzBuffer[] = new char[ZZ_BUFFERSIZE]; /** the textposition at the last accepting state */ private int zzMarkedPos; /** the current text position in the buffer */ private int zzCurrentPos; /** startRead marks the beginning of the yytext() string in the buffer */ private int zzStartRead; /** endRead marks the last character in the buffer, that has been read from input */ private int zzEndRead; /** number of newlines encountered up to the start of the matched text */ private int yyline; /** the number of characters up to the start of the matched text */ private int yychar; /** * the number of characters from the last newline up to the start of the * matched text */ private int yycolumn; /** * zzAtBOL == true <=> the scanner is currently at the beginning of a line */ private boolean zzAtBOL = true; /** zzAtEOF == true <=> the scanner is at the EOF */ private boolean zzAtEOF; /* user code: */ private CrocSymbolFactory mSymFactory = new CrocSymbolFactory(); private Symbol symbol(int type) { return mSymFactory.newSymbol(yytext(), type, yyline+1, yycolumn, yyline+1, yycolumn+yylength()); } private Symbol symbol(int type, String value) { return mSymFactory.newSymbol(value, type, yyline+1, yycolumn, yyline+1, yycolumn+yylength(), value); } /** * Creates a new scanner * There is also a java.io.InputStream version of this constructor. * * @param in the java.io.Reader to read input from. */ public CrocLexer(java.io.Reader in) { this.zzReader = in; } /** * Creates a new scanner. * There is also java.io.Reader version of this constructor. * * @param in the java.io.Inputstream to read input from. */ public CrocLexer(java.io.InputStream in) { this(new java.io.InputStreamReader(in)); } /** * Unpacks the compressed character translation table. * * @param packed the packed character translation table * @return the unpacked character translation table */ private static char [] zzUnpackCMap(String packed) { char [] map = new char[0x10000]; int i = 0; /* index in packed string */ int j = 0; /* index in unpacked array */ while (i < 1742) { int count = packed.charAt(i++); char value = packed.charAt(i++); do map[j++] = value; while (--count > 0); } return map; } /** * Refills the input buffer. * * @return 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) { 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) { /* if not: blow it up */ char newBuffer[] = new char[zzCurrentPos*2]; System.arraycopy(zzBuffer, 0, newBuffer, 0, zzBuffer.length); zzBuffer = newBuffer; } /* finally: fill the buffer with new input */ int numRead = zzReader.read(zzBuffer, zzEndRead, zzBuffer.length-zzEndRead); if (numRead > 0) { zzEndRead+= numRead; return false; } // unlikely but not impossible: read 0 characters, but not at end of stream if (numRead == 0) { int c = zzReader.read(); if (c == -1) { return true; } else { zzBuffer[zzEndRead++] = (char) c; return false; } } // numRead < 0 return true; } /** * Closes the input stream. */ 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. * Does not close the old reader. * * All internal variables are reset, the old input stream * cannot be reused (internal buffer is discarded and lost). * Lexical state is set to ZZ_INITIAL. * * @param reader the new input stream */ public final void yyreset(java.io.Reader reader) { zzReader = reader; zzAtBOL = true; zzAtEOF = false; zzEndRead = zzStartRead = 0; zzCurrentPos = zzMarkedPos = 0; yyline = yychar = yycolumn = 0; zzLexicalState = YYINITIAL; } /** * Returns 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. */ public final String yytext() { return new String( zzBuffer, zzStartRead, zzMarkedPos-zzStartRead ); } /** * Returns the character at position pos from the * matched text. * * It is equivalent to yytext().charAt(pos), but faster * * @param pos the position of the character to fetch. * A value from 0 to yylength()-1. * * @return the character at position pos */ public final char yycharat(int pos) { return zzBuffer[zzStartRead+pos]; } /** * Returns the length of the matched text region. */ public final int yylength() { return zzMarkedPos-zzStartRead; } /** * Reports an error that occured while scanning. * * In a wellformed scanner (no or only correct usage of * yypushback(int) and a match-all fallback rule) this method * will only be called with things that "Can't Possibly Happen". * If this method is called, something is seriously wrong * (e.g. a JFlex bug producing a faulty scanner etc.). * * Usual syntax/scanner level error handling should be done * in error fallback rules. * * @param errorCode the code of the errormessage to display */ private 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. * * 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 yylength()! */ public void yypushback(int number) { if ( number > yylength() ) zzScanError(ZZ_PUSHBACK_2BIG); zzMarkedPos -= number; } /** * 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 */ public com.github.jhoenicke.javacup.runtime.Symbol next_token() throws java.io.IOException { int zzInput; int zzAction; // cached fields: int zzCurrentPosL; int zzMarkedPosL; int zzEndReadL = zzEndRead; char [] zzBufferL = zzBuffer; char [] zzCMapL = ZZ_CMAP; int [] zzTransL = ZZ_TRANS; int [] zzRowMapL = ZZ_ROWMAP; int [] zzAttrL = ZZ_ATTRIBUTE; while (true) { zzMarkedPosL = zzMarkedPos; boolean zzR = false; for (zzCurrentPosL = zzStartRead; zzCurrentPosL < zzMarkedPosL; zzCurrentPosL++) { switch (zzBufferL[zzCurrentPosL]) { case '\u000B': case '\u000C': case '\u0085': case '\u2028': 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++; } } if (zzR) { // peek one character ahead if it is \n (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]; zzForAction: { while (true) { if (zzCurrentPosL < zzEndReadL) zzInput = zzBufferL[zzCurrentPosL++]; 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 = zzBufferL[zzCurrentPosL++]; } } int zzNext = zzTransL[ zzRowMapL[zzState] + zzCMapL[zzInput] ]; if (zzNext == -1) break zzForAction; zzState = zzNext; int zzAttributes = zzAttrL[zzState]; if ( (zzAttributes & 1) == 1 ) { zzAction = zzState; zzMarkedPosL = zzCurrentPosL; if ( (zzAttributes & 8) == 8 ) break zzForAction; } } } // store back cached position zzMarkedPos = zzMarkedPosL; switch (zzAction < 0 ? zzAction : ZZ_ACTION[zzAction]) { case 3: { return symbol(CrocSymbols.ID, yytext().intern()); } case 16: break; case 11: { return symbol(CrocSymbols.PAIR, yytext()); } case 17: break; case 15: { return symbol(CrocSymbols.CONSTRAINTS, yytext()); } case 18: break; case 9: { return symbol(CrocSymbols.QUOTE); } case 19: break; case 2: { /* ignore */ } case 20: break; case 14: { return symbol(CrocSymbols.CONCAT, yytext()); } case 21: break; case 6: { return symbol(CrocSymbols.EQUALS, yytext()); } case 22: break; case 5: { return symbol(CrocSymbols.RPAR); } case 23: break; case 13: { return symbol(CrocSymbols.UNION, yytext()); } case 24: break; case 7: { return symbol(CrocSymbols.LBRAK); } case 25: break; case 1: { return symbol(CrocSymbols.error, yytext()); } case 26: break; case 4: { return symbol(CrocSymbols.LPAR); } case 27: break; case 10: { return symbol(CrocSymbols.INCLUSION, yytext()); } case 28: break; case 12: { return symbol(CrocSymbols.ISECT, yytext()); } case 29: break; case 8: { return symbol(CrocSymbols.RBRAK); } case 30: break; default: if (zzInput == YYEOF && zzStartRead == zzCurrentPos) { zzAtEOF = true; { return symbol(CrocSymbols.EOF); } } else { zzScanError(ZZ_NO_MATCH); } } } } }