Created
October 5, 2016 22:50
-
-
Save DenWav/3ab036fd0841bb9532e11e0f94e4dff8 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* The following code was generated by JFlex 1.7.0-SNAPSHOT tweaked for IntelliJ platform */ | |
package com.demonwav.mcdev.platform.mcp.cfg; | |
import com.intellij.lexer.*; | |
import com.intellij.psi.tree.IElementType; | |
import static com.demonwav.mcdev.platform.mcp.cfg.psi.CfgTypes.*; | |
import static com.intellij.psi.TokenType.*; | |
/** | |
* This class is a scanner generated by | |
* <a href="http://www.jflex.de/">JFlex</a> 1.7.0-SNAPSHOT | |
* from the specification file <tt>src/main/java/com/demonwav/mcdev/platform/mcp/cfg/Cfg.flex</tt> | |
*/ | |
public class CfgLexer 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 [7, 7, 7] | |
* Total runtime size is 1928 bytes | |
*/ | |
public static int ZZ_CMAP(int ch) { | |
return ZZ_CMAP_A[(ZZ_CMAP_Y[ZZ_CMAP_Z[ch>>14]|((ch>>7)&0x7f)]<<7)|(ch&0x7f)]; | |
} | |
/* The ZZ_CMAP_Z table has 68 entries */ | |
static final char ZZ_CMAP_Z[] = zzUnpackCMap( | |
"\1\0\103\200"); | |
/* The ZZ_CMAP_Y table has 256 entries */ | |
static final char ZZ_CMAP_Y[] = zzUnpackCMap( | |
"\1\0\1\1\53\2\1\3\22\2\1\4\37\2\1\3\237\2"); | |
/* The ZZ_CMAP_A table has 640 entries */ | |
static final char ZZ_CMAP_A[] = zzUnpackCMap( | |
"\11\0\1\37\1\34\2\36\1\35\22\0\1\37\2\0\1\33\1\32\3\0\1\40\1\41\1\42\2\0\1"+ | |
"\14\1\31\1\0\12\25\1\0\1\5\1\26\1\0\1\30\2\0\1\25\3\3\1\25\1\3\2\25\2\3\1"+ | |
"\25\1\4\6\25\1\3\2\25\1\1\3\25\1\3\1\2\3\0\1\25\1\0\1\20\1\10\1\13\1\24\1"+ | |
"\22\1\15\2\25\1\12\2\25\1\11\1\25\1\27\1\23\1\6\1\25\1\16\1\25\1\21\1\7\1"+ | |
"\17\4\25\12\0\1\36\32\0\1\37\337\0\1\37\177\0\13\37\35\0\2\36\5\0\1\37\57"+ | |
"\0\1\37\40\0"); | |
/** | |
* 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\3\3\2\1\1\4\1\5"+ | |
"\2\6\1\7\1\10\1\11\1\12\1\0\1\3\2\0"+ | |
"\1\13\2\0\1\3\1\0\1\4\2\3\1\0\1\2"+ | |
"\2\0\1\3\1\0\1\4\3\3\1\0\3\3\1\0"+ | |
"\3\3\1\0\1\14\3\3\1\0\1\3\1\14\1\3"; | |
private static int [] zzUnpackAction() { | |
int [] result = new int[56]; | |
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\43\0\106\0\151\0\214\0\257\0\322\0\365"+ | |
"\0\u0118\0\u0118\0\u013b\0\43\0\u015e\0\43\0\43\0\43"+ | |
"\0\43\0\u0181\0\u01a4\0\u0118\0\151\0\43\0\u01c7\0\u01ea"+ | |
"\0\u020d\0\u0230\0\u0230\0\u0253\0\u0276\0\u0299\0\u02bc\0\u02df"+ | |
"\0\u0302\0\u0325\0\u0348\0\u0348\0\u036b\0\u038e\0\u03b1\0\u03d4"+ | |
"\0\u03f7\0\u041a\0\u043d\0\u0460\0\u0483\0\u04a6\0\u04c9\0\u04ec"+ | |
"\0\u050f\0\u0532\0\u0555\0\43\0\u0578\0\u059b\0\43\0\u05be"; | |
private static int [] zzUnpackRowMap() { | |
int [] result = new int[56]; | |
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\1\4\1\3\1\5\1\2\1\6\5\7"+ | |
"\1\2\11\7\1\10\1\7\1\2\1\11\1\12\1\13"+ | |
"\1\14\1\15\2\16\1\17\1\20\1\21\44\0\1\3"+ | |
"\1\22\1\3\1\23\1\0\6\7\1\0\11\7\1\0"+ | |
"\1\7\1\0\1\24\1\12\12\0\1\25\1\26\1\27"+ | |
"\36\0\1\30\1\31\1\30\2\31\1\0\6\31\1\30"+ | |
"\11\31\1\30\1\31\1\30\1\32\1\33\10\30\1\0"+ | |
"\1\7\1\0\2\7\1\0\1\7\1\34\4\7\1\0"+ | |
"\1\7\1\35\7\7\1\0\1\7\1\0\1\24\1\12"+ | |
"\11\0\1\7\1\0\2\7\1\0\6\7\1\0\11\7"+ | |
"\1\0\1\7\1\0\1\24\1\12\22\0\1\36\31\0"+ | |
"\1\12\1\0\2\12\1\0\6\12\1\0\11\12\1\0"+ | |
"\1\12\1\0\1\24\1\12\10\0\34\13\3\0\4\13"+ | |
"\34\0\1\14\10\0\1\22\1\37\1\40\36\0\1\41"+ | |
"\1\42\1\41\2\42\1\0\6\42\1\41\11\42\1\41"+ | |
"\1\42\1\41\1\43\1\44\10\41\5\30\1\0\42\30"+ | |
"\1\26\36\30\1\31\1\30\2\31\1\26\6\31\1\30"+ | |
"\11\31\1\30\1\31\1\30\1\32\1\33\11\30\1\33"+ | |
"\1\30\2\33\1\26\6\33\1\30\11\33\1\30\1\33"+ | |
"\1\30\1\32\1\33\10\30\1\0\1\7\1\0\2\7"+ | |
"\1\0\2\7\1\45\3\7\1\0\11\7\1\0\1\7"+ | |
"\1\0\1\24\1\12\11\0\1\7\1\0\2\7\1\0"+ | |
"\4\7\1\46\1\7\1\0\6\7\1\47\2\7\1\0"+ | |
"\1\7\1\0\1\24\1\12\37\0\1\50\14\0\1\37"+ | |
"\1\22\1\37\1\40\36\0\5\41\1\0\42\41\1\37"+ | |
"\36\41\1\42\1\41\2\42\1\37\6\42\1\41\11\42"+ | |
"\1\41\1\42\1\41\1\43\1\44\11\41\1\44\1\41"+ | |
"\2\44\1\37\6\44\1\41\11\44\1\41\1\44\1\41"+ | |
"\1\43\1\44\10\41\1\0\1\7\1\0\2\7\1\0"+ | |
"\3\7\1\51\2\7\1\0\11\7\1\0\1\7\1\0"+ | |
"\1\24\1\12\11\0\1\7\1\0\2\7\1\0\6\7"+ | |
"\1\0\2\7\1\52\6\7\1\0\1\7\1\0\1\24"+ | |
"\1\12\11\0\1\7\1\0\2\7\1\0\6\7\1\0"+ | |
"\4\7\1\53\4\7\1\0\1\7\1\0\1\24\1\12"+ | |
"\22\0\1\54\31\0\1\7\1\0\2\7\1\0\4\7"+ | |
"\1\55\1\7\1\0\11\7\1\0\1\7\1\0\1\24"+ | |
"\1\12\11\0\1\7\1\0\2\7\1\0\6\7\1\0"+ | |
"\3\7\1\56\5\7\1\0\1\7\1\0\1\24\1\12"+ | |
"\11\0\1\7\1\0\2\7\1\0\6\7\1\0\5\7"+ | |
"\1\57\3\7\1\0\1\7\1\0\1\24\1\12\31\0"+ | |
"\1\60\22\0\1\7\1\0\2\7\1\0\5\7\1\61"+ | |
"\1\0\11\7\1\0\1\7\1\0\1\24\1\12\11\0"+ | |
"\1\7\1\0\2\7\1\0\6\7\1\0\4\7\1\62"+ | |
"\4\7\1\0\1\7\1\0\1\24\1\12\11\0\1\7"+ | |
"\1\0\2\7\1\0\5\7\1\63\1\0\11\7\1\0"+ | |
"\1\7\1\0\1\24\1\12\40\0\1\64\13\0\1\7"+ | |
"\1\0\2\7\1\0\6\7\1\65\11\7\1\0\1\7"+ | |
"\1\0\1\24\1\12\11\0\1\7\1\0\2\7\1\0"+ | |
"\6\7\1\0\5\7\1\61\3\7\1\0\1\7\1\0"+ | |
"\1\24\1\12\11\0\1\7\1\0\2\7\1\0\6\7"+ | |
"\1\0\4\7\1\66\4\7\1\0\1\7\1\0\1\24"+ | |
"\1\12\25\0\1\67\26\0\1\7\1\0\2\7\1\0"+ | |
"\6\7\1\0\5\7\1\70\3\7\1\0\1\7\1\0"+ | |
"\1\24\1\12\11\0\1\7\1\0\2\7\1\0\6\7"+ | |
"\1\0\7\7\1\61\1\7\1\0\1\7\1\0\1\24"+ | |
"\1\12\10\0"; | |
private static int [] zzUnpackTrans() { | |
int [] result = new int[1505]; | |
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\11\1\1\11\1\1\4\11\1\0\1\1"+ | |
"\2\0\1\11\2\0\1\1\1\0\3\1\1\0\1\1"+ | |
"\2\0\1\1\1\0\4\1\1\0\3\1\1\0\3\1"+ | |
"\1\0\3\1\1\11\1\0\1\1\1\11\1\1"; | |
private static int [] zzUnpackAttribute() { | |
int [] result = new int[56]; | |
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 CfgLexer() { | |
this((java.io.Reader)null); | |
} | |
/** | |
* Creates a new scanner | |
* | |
* @param in the java.io.Reader to read input from. | |
*/ | |
public CfgLexer(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; | |
} | |
/** | |
* 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; | |
return null; | |
} | |
else { | |
switch (zzAction < 0 ? zzAction : ZZ_ACTION[zzAction]) { | |
case 1: | |
{ return BAD_CHARACTER; | |
} | |
case 13: break; | |
case 2: | |
{ zzMarkedPos = zzStartRead + 1; return PRIMITIVE; | |
} | |
case 14: break; | |
case 3: | |
{ return NAME_ELEMENT; | |
} | |
case 15: break; | |
case 4: | |
{ return CLASS_NAME_ELEMENT; | |
} | |
case 16: break; | |
case 5: | |
{ return COMMENT; | |
} | |
case 17: break; | |
case 6: | |
{ return CRLF; | |
} | |
case 18: break; | |
case 7: | |
{ return WHITE_SPACE; | |
} | |
case 19: break; | |
case 8: | |
{ return OPEN_PAREN; | |
} | |
case 20: break; | |
case 9: | |
{ return CLOSE_PAREN; | |
} | |
case 21: break; | |
case 10: | |
{ return ASTERISK_ELEMENT; | |
} | |
case 22: break; | |
case 11: | |
{ return CLASS_VALUE; | |
} | |
case 23: break; | |
case 12: | |
{ return KEYWORD_ELEMENT; | |
} | |
case 24: break; | |
default: | |
zzScanError(ZZ_NO_MATCH); | |
} | |
} | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment