/* The following code was generated by JFlex 1.7.0-SNAPSHOT tweaked for IntelliJ platform */
package org.intellij.grammar.parser;
import com.intellij.lexer.FlexLexer;
import com.intellij.psi.tree.IElementType;
import static com.intellij.psi.TokenType.BAD_CHARACTER;
import static com.intellij.psi.TokenType.WHITE_SPACE;
import static org.intellij.grammar.BnfParserDefinition.BNF_BLOCK_COMMENT;
import static org.intellij.grammar.BnfParserDefinition.BNF_LINE_COMMENT;
import static org.intellij.grammar.psi.BnfTypes.*;
/**
* This class is a scanner generated by
* <a href="http://www.jflex.de/">JFlex</a> 1.7.0-SNAPSHOT
* from the specification file <tt>_BnfLexer.flex</tt>
*/
public class _BnfLexer implements FlexLexer {
/** 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
* Chosen bits are [11, 6, 4]
* Total runtime size is 13760 bytes
*/
public static int ZZ_CMAP(int ch) {
return ZZ_CMAP_A[(ZZ_CMAP_Y[(ZZ_CMAP_Z[ch>>10]<<6)|((ch>>4)&0x3f)]<<4)|(ch&0xf)];
}
/* The ZZ_CMAP_Z table has 1088 entries */
static final char ZZ_CMAP_Z[] = zzUnpackCMap(
"\1\0\1\1\1\2\1\3\1\4\1\5\1\6\1\7\1\10\2\11\1\12\1\13\6\14\1\15\23\14\1\16"+
"\1\14\1\17\1\20\12\14\1\21\10\11\1\22\1\23\1\24\1\25\1\26\1\27\1\30\1\31\1"+
"\32\1\11\1\33\1\34\2\11\1\14\1\35\3\11\1\36\10\11\1\37\1\40\20\11\1\41\2\11"+
"\1\42\5\11\1\43\4\11\1\44\1\45\4\11\51\14\1\46\3\14\1\47\1\50\4\14\1\51\12"+
"\11\1\52\u0381\11");
/* The ZZ_CMAP_Y table has 2752 entries */
static final char ZZ_CMAP_Y[] = zzUnpackCMap(
"\1\0\1\1\1\2\1\3\1\4\1\5\1\4\1\6\1\7\1\1\1\10\1\11\1\12\1\13\1\12\1\13\34"+
"\12\1\14\1\15\1\16\10\1\1\17\1\20\1\12\1\21\4\12\1\22\10\12\1\23\12\12\1\24"+
"\1\12\1\25\1\24\1\12\1\26\4\1\1\12\1\27\1\30\2\1\2\12\1\27\1\1\1\31\1\24\5"+
"\12\1\32\1\33\1\34\1\1\1\35\1\12\1\1\1\36\5\12\1\37\1\40\1\41\1\12\1\27\1"+
"\42\1\12\1\43\1\44\1\1\1\12\1\45\4\1\1\12\1\46\4\1\1\47\2\12\1\50\1\1\1\51"+
"\1\52\1\24\1\53\1\54\1\55\1\56\1\57\1\60\1\52\1\15\1\61\1\54\1\55\1\62\1\1"+
"\1\63\1\64\1\65\1\66\1\21\1\55\1\67\1\1\1\70\1\52\1\71\1\72\1\54\1\55\1\67"+
"\1\1\1\60\1\52\1\40\1\73\1\74\1\75\1\76\1\1\1\70\1\64\1\1\1\77\1\35\1\55\1"+
"\50\1\1\1\100\1\52\1\1\1\77\1\35\1\55\1\101\1\1\1\57\1\52\1\102\1\77\1\35"+
"\1\12\1\103\1\57\1\104\1\52\1\105\1\106\1\107\1\12\1\110\1\111\1\1\1\64\1"+
"\1\1\24\2\12\1\112\1\111\1\113\2\1\1\114\1\115\1\116\1\117\1\120\1\121\2\1"+
"\1\70\1\1\1\113\1\1\1\122\1\12\1\123\1\1\1\124\7\1\2\12\1\27\1\104\1\113\1"+
"\125\1\126\1\127\1\130\1\113\2\12\1\131\2\12\1\132\24\12\1\133\1\134\2\12"+
"\1\133\2\12\1\135\1\136\1\13\3\12\1\136\3\12\1\27\2\1\1\12\1\1\5\12\1\137"+
"\1\24\45\12\1\140\1\12\1\24\1\27\4\12\1\27\1\141\1\142\1\15\1\12\1\15\1\12"+
"\1\15\1\142\1\70\3\12\1\143\1\1\1\144\1\113\2\1\1\113\5\12\1\26\2\12\1\145"+
"\4\12\1\37\1\12\1\146\2\1\1\64\1\12\1\147\1\46\2\12\1\150\1\12\1\76\1\113"+
"\2\1\1\12\1\111\3\12\1\46\2\1\2\113\1\151\5\1\1\106\2\12\1\143\1\152\1\113"+
"\2\1\1\153\1\12\1\154\1\41\2\12\1\37\1\1\2\12\1\143\1\1\1\155\1\41\1\12\1"+
"\147\6\1\1\156\1\157\14\12\4\1\21\12\1\137\2\12\1\137\1\160\1\12\1\147\3\12"+
"\1\161\1\162\1\163\1\123\1\162\2\1\1\164\4\1\1\165\1\1\1\123\6\1\1\166\1\167"+
"\1\170\1\171\1\172\3\1\1\173\147\1\2\12\1\146\2\12\1\146\10\12\1\174\1\175"+
"\2\12\1\131\3\12\1\176\1\1\1\12\1\111\4\177\4\1\1\104\35\1\1\200\2\1\1\201"+
"\1\24\4\12\1\202\1\24\4\12\1\132\1\106\1\12\1\147\1\24\4\12\1\146\1\1\1\12"+
"\1\27\3\1\1\12\40\1\133\12\1\37\4\1\135\12\1\37\2\1\10\12\1\123\4\1\2\12\1"+
"\147\20\12\1\123\1\12\1\203\1\1\2\12\1\146\1\104\1\12\1\147\4\12\1\37\2\1"+
"\1\204\1\205\5\12\1\206\1\12\1\147\1\26\3\1\1\204\1\207\1\12\1\30\1\1\3\12"+
"\1\143\1\205\2\12\1\143\1\1\1\113\1\1\1\210\1\41\1\12\1\37\1\12\1\111\1\1"+
"\1\12\1\123\1\47\2\12\1\30\1\104\1\113\1\211\1\212\2\12\1\45\1\1\1\213\1\113"+
"\1\12\1\214\3\12\1\215\1\216\1\217\1\27\1\65\1\220\1\221\1\177\2\12\1\132"+
"\1\37\7\12\1\30\1\113\72\12\1\143\1\12\1\222\2\12\1\150\20\1\26\12\1\147\6"+
"\12\1\76\2\1\1\111\1\223\1\55\1\224\1\225\6\12\1\15\1\1\1\153\25\12\1\147"+
"\1\1\4\12\1\205\2\12\1\26\2\1\1\150\7\1\1\211\7\12\1\123\1\1\1\113\1\24\1"+
"\27\1\24\1\27\1\226\4\12\1\146\1\227\1\230\2\1\1\231\1\12\1\13\1\232\2\147"+
"\2\1\7\12\1\27\30\1\1\12\1\123\3\12\1\70\2\1\2\12\1\1\1\12\1\233\2\12\1\37"+
"\1\12\1\147\2\12\1\234\3\1\11\12\1\147\1\113\5\1\2\12\1\26\3\12\1\143\11\1"+
"\23\12\1\111\1\12\1\37\1\26\11\1\1\235\2\12\1\236\1\12\1\37\1\12\1\111\1\12"+
"\1\146\4\1\1\12\1\237\1\12\1\37\1\12\1\76\4\1\3\12\1\240\4\1\1\70\1\241\1"+
"\12\1\143\2\1\1\12\1\123\1\12\1\123\2\1\1\122\1\12\1\46\1\1\3\12\1\37\1\12"+
"\1\37\1\12\1\30\1\12\1\15\6\1\4\12\1\45\3\1\3\12\1\30\3\12\1\30\60\1\1\153"+
"\2\12\1\26\2\1\1\64\1\1\1\153\2\12\2\1\1\12\1\45\1\113\1\153\1\12\1\111\1"+
"\64\1\1\2\12\1\242\1\153\2\12\1\30\1\243\1\244\2\1\1\12\1\21\1\150\5\1\1\245"+
"\1\246\1\45\2\12\1\146\1\1\1\113\1\72\1\54\1\55\1\67\1\1\1\247\1\15\21\1\3"+
"\12\1\1\1\250\1\113\12\1\2\12\1\146\2\1\1\251\2\1\3\12\1\1\1\252\1\113\2\1"+
"\2\12\1\27\1\1\1\113\3\1\1\12\1\76\1\1\1\113\26\1\4\12\1\113\1\104\34\1\3"+
"\12\1\45\20\1\71\12\1\76\16\1\14\12\1\143\53\1\2\12\1\146\75\1\44\12\1\111"+
"\33\1\43\12\1\45\1\12\1\146\1\113\6\1\1\12\1\147\1\1\3\12\1\1\1\143\1\113"+
"\1\153\1\253\1\12\67\1\4\12\1\46\1\70\3\1\1\153\6\1\1\15\77\1\6\12\1\27\1"+
"\123\1\45\1\76\66\1\5\12\1\211\3\12\1\142\1\254\1\255\1\256\3\12\1\257\1\260"+
"\1\12\1\261\1\262\1\35\24\12\1\263\1\12\1\35\1\132\1\12\1\132\1\12\1\211\1"+
"\12\1\211\1\146\1\12\1\146\1\12\1\55\1\12\1\55\1\12\1\264\3\265\14\12\1\46"+
"\123\1\1\256\1\12\1\266\1\267\1\270\1\271\1\272\1\273\1\274\1\150\1\275\1"+
"\150\24\1\55\12\1\111\2\1\103\12\1\46\15\12\1\147\150\12\1\15\25\1\41\12\1"+
"\147\36\1");
/* The ZZ_CMAP_A table has 3040 entries */
static final char ZZ_CMAP_A[] = zzUnpackCMap(
"\11\0\1\2\1\1\1\4\1\5\1\1\22\0\1\2\1\36\1\21\3\0\1\35\1\20\1\23\1\24\1\6\1"+
"\33\1\0\1\11\1\0\1\3\1\15\11\10\1\31\1\22\1\12\1\32\1\13\1\34\1\0\6\14\24"+
"\7\1\27\1\17\1\30\1\0\1\11\10\7\1\16\2\7\1\25\1\37\1\26\7\0\1\4\24\0\1\7\12"+
"\0\1\7\4\0\1\7\5\0\27\7\1\0\12\7\4\0\14\7\16\0\5\7\7\0\1\7\1\0\1\7\1\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\4\7\1\0\23\7\1\0\13\7"+
"\10\0\6\7\1\0\26\7\2\0\1\7\6\0\10\7\10\0\13\7\5\0\3\7\15\0\12\10\4\0\6\7\1"+
"\0\1\7\17\0\2\7\7\0\2\7\12\10\3\7\2\0\2\7\1\0\16\7\15\0\11\7\13\0\1\7\16\0"+
"\12\10\6\7\4\0\2\7\4\0\1\7\5\0\6\7\4\0\1\7\11\0\1\7\3\0\1\7\7\0\11\7\7\0\5"+
"\7\17\0\26\7\3\0\1\7\2\0\1\7\7\0\12\7\4\0\12\10\1\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\1\7\5\0\6\7\4\0\2"+
"\7\1\0\2\7\1\0\2\7\1\0\2\7\17\0\4\7\1\0\1\7\7\0\12\10\2\0\3\7\20\0\11\7\1"+
"\0\2\7\1\0\2\7\1\0\5\7\3\0\1\7\2\0\1\7\30\0\1\7\13\0\10\7\2\0\1\7\3\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"+
"\13\0\10\7\1\0\2\7\10\0\3\7\5\0\4\7\1\0\5\7\3\0\1\7\3\0\2\7\15\0\13\7\2\0"+
"\1\7\21\0\1\7\12\0\6\7\5\0\22\7\3\0\10\7\1\0\11\7\1\0\1\7\2\0\7\7\11\0\1\7"+
"\1\0\2\7\14\0\12\10\7\0\2\7\1\0\1\7\2\0\2\7\1\0\1\7\2\0\1\7\6\0\4\7\1\0\7"+
"\7\1\0\3\7\1\0\1\7\1\0\1\7\2\0\2\7\1\0\4\7\1\0\2\7\11\0\1\7\2\0\5\7\1\0\1"+
"\7\11\0\12\10\2\0\14\7\1\0\24\7\13\0\5\7\3\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\1\0\6\7\1\0\1\7\5\0\1\7\2\0\13\7\1\0\15\7\1\0\4\7"+
"\2\0\7\7\1\0\1\7\1\0\4\7\2\0\1\7\1\0\4\7\2\0\7\7\1\0\1\7\1\0\4\7\2\0\16\7"+
"\2\0\6\7\2\0\15\7\2\0\1\7\1\0\10\7\7\0\15\7\1\0\6\7\23\0\1\7\4\0\1\7\3\0\11"+
"\7\1\0\1\7\5\0\17\7\1\0\16\7\2\0\14\7\13\0\1\7\15\0\7\7\7\0\16\7\15\0\2\7"+
"\12\10\3\0\3\7\11\0\4\7\1\0\4\7\3\0\2\7\11\0\10\7\1\0\1\7\1\0\1\7\1\0\1\7"+
"\1\0\6\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\14\0\2\4\7\0\1\7"+
"\15\0\1\7\2\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\4\0\2\7\13\0\5\7\6\0\4\7\3\0\2\7"+
"\14\0\10\7\7\0\10\7\1\0\7\7\6\0\2\7\12\0\5\7\5\0\2\7\3\0\7\7\6\0\3\7\12\10"+
"\2\7\13\0\11\7\2\0\27\7\2\0\7\7\1\0\3\7\1\0\4\7\1\0\4\7\2\0\6\7\3\0\1\7\1"+
"\0\1\7\2\0\5\7\1\0\12\7\12\10\5\7\1\0\3\7\1\0\10\7\4\0\7\7\3\0\1\7\3\0\2\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\3\0\6\7\2\0\6\7\2\0\6\7"+
"\11\0\7\7\4\0\5\7\3\0\5\7\5\0\1\7\1\0\10\7\1\0\5\7\1\0\1\7\1\0\2\7\1\0\2\7"+
"\1\0\12\7\6\0\12\7\2\0\6\7\2\0\6\7\2\0\6\7\2\0\3\7\3\0\14\7\1\0\16\7\1\0\2"+
"\7\1\0\2\7\1\0\10\7\6\0\4\7\4\0\16\7\2\0\1\7\1\0\14\7\1\0\2\7\3\0\1\7\2\0"+
"\4\7\1\0\2\7\12\0\10\7\6\0\6\7\1\0\3\7\1\0\12\7\3\0\1\7\12\0\4\7\13\0\12\10"+
"\1\7\1\0\1\7\3\0\7\7\1\0\1\7\1\0\4\7\1\0\17\7\1\0\2\7\14\0\3\7\4\0\2\7\1\0"+
"\1\7\20\0\4\7\10\0\1\7\13\0\10\7\5\0\3\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\21\7\1\0\4\7\2\0\10\7\1\0\7\7\1\0\14\7\1\0\4\7\1\0\5"+
"\7\1\0\1\7\3\0\14\7\2\0\13\7\1\0\10\7\2\0\22\10\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\5\7\1\0\3\7\1\0\5\7\1\0"+
"\5\7");
/**
* 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\1\2\1\1\1\3\1\4\1\5\2\1"+
"\1\5\2\1\1\6\1\7\1\10\1\11\1\12\1\13"+
"\1\14\1\1\1\15\1\16\1\17\1\20\1\21\1\22"+
"\1\23\1\24\1\0\1\25\1\26\1\0\1\27\2\0"+
"\1\24\1\4\1\5\1\30\1\24";
private static int [] zzUnpackAction() {
int [] result = new int[40];
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\40\0\100\0\140\0\40\0\200\0\240\0\300"+
"\0\340\0\u0100\0\u0120\0\u0140\0\40\0\40\0\40\0\40"+
"\0\40\0\40\0\40\0\u0160\0\40\0\40\0\40\0\40"+
"\0\40\0\40\0\u0180\0\u01a0\0\u01c0\0\40\0\40\0\u01e0"+
"\0\40\0\u0200\0\u0220\0\u0240\0\40\0\u01e0\0\40\0\40";
private static int [] zzUnpackRowMap() {
int [] result = new int[40];
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\2\1\3\1\5\1\6\1\7"+
"\1\2\1\10\1\11\1\6\1\12\1\6\1\2\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\41\0"+
"\2\3\2\0\1\3\35\0\1\33\2\0\1\34\40\0"+
"\3\6\2\0\3\6\31\0\1\7\4\0\1\7\22\0"+
"\12\35\1\36\1\0\24\35\13\0\1\37\34\0\1\7"+
"\4\0\1\7\1\40\21\0\1\13\1\0\16\13\1\41"+
"\17\13\1\14\1\0\15\14\1\42\1\14\1\41\16\14"+
"\31\0\1\43\6\0\1\33\1\0\2\33\2\0\32\33"+
"\6\34\1\44\31\34\12\35\1\0\1\45\24\35\10\0"+
"\1\46\3\0\2\46\22\0\40\14\32\0\1\47\5\0"+
"\3\34\1\50\2\34\1\44\31\34";
private static int [] zzUnpackTrans() {
int [] result = new int[608];
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 = {
"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</code>
*/
private static final int [] ZZ_ATTRIBUTE = zzUnpackAttribute();
private static final String ZZ_ATTRIBUTE_PACKED_0 =
"\1\0\1\11\2\1\1\11\7\1\7\11\1\1\6\11"+
"\2\1\1\0\2\11\1\0\1\11\2\0\1\1\1\11"+
"\1\1\2\11";
private static int [] zzUnpackAttribute() {
int [] result = new int[40];
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 CharSequence zzBuffer = "";
/** 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;
/**
* 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;
/** denotes if the user-EOF-code has already been executed */
private boolean zzEOFDone;
/* user code: */
public _BnfLexer() {
this((java.io.Reader)null);
}
/**
* Creates a new scanner
*
* @param in the java.io.Reader to read input from.
*/
public _BnfLexer(java.io.Reader in) {
this.zzReader = 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) {
int size = 0;
for (int i = 0, length = packed.length(); i < length; i += 2) {
size += packed.charAt(i);
}
char[] map = new char[size];
int i = 0; /* index in packed string */
int j = 0; /* index in unpacked array */
while (i < packed.length()) {
int count = packed.charAt(i++);
char value = packed.charAt(i++);
do map[j++] = value; while (--count > 0);
}
return map;
}
public final int getTokenStart() {
return zzStartRead;
}
public final int getTokenEnd() {
return getTokenStart() + yylength();
}
public void reset(CharSequence buffer, int start, int end, int initialState) {
zzBuffer = buffer;
zzCurrentPos = zzMarkedPos = zzStartRead = start;
zzAtEOF = false;
zzAtBOL = true;
zzEndRead = end;
yybegin(initialState);
}
/**
* Refills the input buffer.
*
* @return <code>false</code>, iff there was new input.
*
* @exception java.io.IOException if any I/O-Error occurs
*/
private boolean zzRefill() throws java.io.IOException {
return true;
}
/**
* 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 CharSequence yytext() {
return zzBuffer.subSequence(zzStartRead, zzMarkedPos);
}
/**
* Returns the character at position <tt>pos</tt> 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.charAt(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;
}
/**
* Contains user EOF-code, which will be executed exactly once,
* when the end of file is reached
*/
private void zzDoEOF() {
if (!zzEOFDone) {
zzEOFDone = true;
return;
}
}
/**
* 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 IElementType advance() throws java.io.IOException {
int zzInput;
int zzAction;
// cached fields:
int zzCurrentPosL;
int zzMarkedPosL;
int zzEndReadL = zzEndRead;
CharSequence zzBufferL = zzBuffer;
int [] zzTransL = ZZ_TRANS;
int [] zzRowMapL = ZZ_ROWMAP;
int [] zzAttrL = ZZ_ATTRIBUTE;
while (true) {
zzMarkedPosL = zzMarkedPos;
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] + ZZ_CMAP(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 null;
}
else {
switch (zzAction < 0 ? zzAction : ZZ_ACTION[zzAction]) {
case 1:
{ yybegin(YYINITIAL); return BAD_CHARACTER;
}
case 25: break;
case 2:
{ yybegin(YYINITIAL); return WHITE_SPACE;
}
case 26: break;
case 3:
{ yybegin(YYINITIAL); return BNF_OP_ZEROMORE;
}
case 27: break;
case 4:
{ yybegin(YYINITIAL); return BNF_ID;
}
case 28: break;
case 5:
{ yybegin(YYINITIAL); return BNF_NUMBER;
}
case 29: break;
case 6:
{ yybegin(YYINITIAL); return BNF_SEMICOLON;
}
case 30: break;
case 7:
{ yybegin(YYINITIAL); return BNF_LEFT_PAREN;
}
case 31: break;
case 8:
{ yybegin(YYINITIAL); return BNF_RIGHT_PAREN;
}
case 32: break;
case 9:
{ yybegin(YYINITIAL); return BNF_LEFT_BRACE;
}
case 33: break;
case 10:
{ yybegin(YYINITIAL); return BNF_RIGHT_BRACE;
}
case 34: break;
case 11:
{ yybegin(YYINITIAL); return BNF_LEFT_BRACKET;
}
case 35: break;
case 12:
{ yybegin(YYINITIAL); return BNF_RIGHT_BRACKET;
}
case 36: break;
case 13:
{ yybegin(YYINITIAL); return BNF_OP_EQ;
}
case 37: break;
case 14:
{ yybegin(YYINITIAL); return BNF_OP_ONEMORE;
}
case 38: break;
case 15:
{ yybegin(YYINITIAL); return BNF_OP_OPT;
}
case 39: break;
case 16:
{ yybegin(YYINITIAL); return BNF_OP_AND;
}
case 40: break;
case 17:
{ yybegin(YYINITIAL); return BNF_OP_NOT;
}
case 41: break;
case 18:
{ yybegin(YYINITIAL); return BNF_OP_OR;
}
case 42: break;
case 19:
{ yybegin(YYINITIAL); return BNF_LINE_COMMENT;
}
case 43: break;
case 20:
{ yybegin(YYINITIAL); return BNF_BLOCK_COMMENT;
}
case 44: break;
case 21:
{ yybegin(YYINITIAL); return BNF_EXTERNAL_START;
}
case 45: break;
case 22:
{ yybegin(YYINITIAL); return BNF_EXTERNAL_END;
}
case 46: break;
case 23:
{ yybegin(YYINITIAL); return BNF_STRING;
}
case 47: break;
case 24:
{ yybegin(YYINITIAL); return BNF_OP_IS;
}
case 48: break;
default:
zzScanError(ZZ_NO_MATCH);
}
}
}
}
}