/* The following code was generated by JFlex 1.4.3 on 7/9/15 11:24 AM */
// Copyright 2015 ThoughtWorks, Inc.
// This file is part of getgauge/Intellij-plugin.
// getgauge/Intellij-plugin is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// getgauge/Intellij-plugin 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 General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with getgauge/Intellij-plugin. If not, see <http://www.gnu.org/licenses/>.
package com.thoughtworks.gauge.lexer;
import com.intellij.lexer.FlexLexer;
import com.intellij.psi.tree.IElementType;
import static com.thoughtworks.gauge.language.token.ConceptTokenTypes.*;
/**
* This class is a scanner generated by
* <a href="http://www.jflex.de/">JFlex</a> 1.4.3
* on 7/9/15 11:24 AM from the specification file
* <tt>/Users/prateekb/Workspace/gauge/Intellij-Plugin/src/com/thoughtworks/gauge/lexer/_ConceptLexer.flex</tt>
*/
public class _ConceptLexer implements FlexLexer {
/**
* initial size of the lookahead buffer
*/
private static final int ZZ_BUFFERSIZE = 16384;
/**
* lexical states
*/
public static final int INDYNAMICCONCEPTARG = 18;
public static final int INTABLEBODY = 10;
public static final int INDYNAMIC = 6;
public static final int INTABLECELL = 20;
public static final int INTABLEBODYROW = 12;
public static final int YYINITIAL = 0;
public static final int INTABLEHEADER = 8;
public static final int INARG = 4;
public static final int INDYNAMICTABLEITEM = 14;
public static final int INSTEP = 2;
public static final int INCONCEPTHEADING = 16;
/**
* 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, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7,
8, 8, 9, 9, 10, 10
};
/**
* Translates characters to character classes
*/
private static final String ZZ_CMAP_PACKED =
"\11\0\1\4\1\2\1\0\1\4\1\1\22\0\1\4\1\0\1\11" +
"\1\3\6\0\1\6\2\0\1\14\16\0\1\10\1\7\1\13\35\0" +
"\1\12\37\0\1\5\uff83\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\1\2\1\3\1\4\1\0\1\5\1\0" +
"\1\6\1\3\1\7\3\10\1\11\1\10\1\12\1\13" +
"\1\1\2\14\1\15\1\16\1\2\1\17\1\2\2\3" +
"\1\20\1\4\2\21\1\22\1\4\1\23\1\24\1\7" +
"\2\25\1\5\1\26\1\7\1\24\4\27\1\30\1\6" +
"\2\31\1\32\1\33\2\7\3\0\1\10\5\0\2\10" +
"\2\0\2\34";
private static int[] zzUnpackAction() {
int[] result = new int[70];
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\15\0\32\0\47\0\64\0\101\0\116\0\133" +
"\0\150\0\165\0\202\0\217\0\234\0\251\0\266\0\303" +
"\0\266\0\266\0\320\0\335\0\266\0\266\0\266\0\352" +
"\0\266\0\367\0\u0104\0\u0111\0\266\0\u011e\0\u012b\0\u0138" +
"\0\266\0\u0145\0\266\0\266\0\266\0\u0152\0\u015f\0\u016c" +
"\0\266\0\u0179\0\u0186\0\266\0\u012b\0\u0138\0\u0193\0\266" +
"\0\u01a0\0\u01ad\0\266\0\266\0\266\0\u01ba\0\u01c7\0\217" +
"\0\u01d4\0\u01e1\0\u01ee\0\u01fb\0\u0208\0\251\0\303\0\u0215" +
"\0\u0222\0\266\0\u022f\0\u023c\0\u0249\0\266";
private static int[] zzUnpackRowMap() {
int[] result = new int[70];
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\14\1\15\1\16\1\17\1\20\1\21\1\22\6\14" +
"\1\23\1\24\1\25\5\23\1\26\1\27\3\23\11\30" +
"\1\31\1\32\2\30\12\33\1\34\1\35\1\33\1\36" +
"\1\37\1\40\2\36\1\41\4\36\1\42\2\36\5\43" +
"\1\44\7\43\1\45\1\46\1\47\1\45\1\50\1\44" +
"\2\45\1\51\1\45\1\52\1\45\1\53\1\54\1\55" +
"\1\56\7\54\1\57\1\60\1\54\1\61\1\62\1\63" +
"\5\61\1\64\4\61\12\33\1\34\1\65\1\33\1\66" +
"\1\46\1\47\2\66\1\44\4\66\1\67\2\66\1\70" +
"\1\71\1\72\1\73\1\74\2\73\6\70\1\75\1\0" +
"\1\76\1\0\1\76\2\0\7\75\3\0\1\76\2\0" +
"\6\75\15\0\1\70\1\71\1\72\1\0\1\77\2\0" +
"\6\70\1\23\2\0\5\23\2\0\3\23\2\0\1\25" +
"\12\0\11\30\1\0\1\32\14\30\1\32\2\30\12\33" +
"\1\34\1\0\13\33\1\34\2\33\1\36\2\0\2\36" +
"\1\0\4\36\1\42\2\36\2\0\1\40\1\0\1\40" +
"\14\0\1\40\10\0\1\36\2\0\7\36\1\42\2\36" +
"\2\0\1\47\1\0\1\47\14\0\1\47\14\0\1\50" +
"\15\0\1\45\23\0\1\53\10\0\1\54\2\0\1\54" +
"\1\0\1\61\2\0\5\61\1\0\4\61\2\0\1\63" +
"\12\0\1\66\2\0\2\66\1\0\4\66\1\67\3\66" +
"\2\0\7\66\1\67\2\66\2\0\1\72\4\0\1\100" +
"\14\0\1\100\5\0\1\73\1\101\1\102\12\73\1\103" +
"\1\71\1\72\1\73\1\74\2\73\6\103\1\75\2\0" +
"\1\73\1\104\2\73\6\75\1\0\1\105\1\106\4\0" +
"\1\100\7\0\1\102\12\0\1\103\1\71\1\72\1\0" +
"\1\103\2\0\6\103\3\0\1\73\1\104\2\73\10\0" +
"\1\106\12\0";
private static int[] zzUnpackTrans() {
int[] result = new int[598];
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;
private static final char[] EMPTY_BUFFER = new char[0];
private static final int YYEOF = -1;
private static java.io.Reader zzReader = null; // Fake
/* 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 <code>aState</code>
*/
private static final int[] ZZ_ATTRIBUTE = zzUnpackAttribute();
private static final String ZZ_ATTRIBUTE_PACKED_0 =
"\1\0\4\1\1\0\1\1\1\0\6\1\1\11\1\1" +
"\2\11\2\1\3\11\1\1\1\11\3\1\1\11\3\1" +
"\1\11\1\1\3\11\3\1\1\11\2\1\1\11\3\1" +
"\1\11\2\1\3\11\2\1\3\0\1\1\5\0\1\1" +
"\1\11\2\0\1\1\1\11";
private static int[] zzUnpackAttribute() {
int[] result = new int[70];
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 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 = "";
/**
* this buffer may contains the current text array to be matched when it is cheap to acquire it
*/
private char[] zzBufferArray;
/**
* the textposition at the last accepting state
*/
private int zzMarkedPos;
/**
* the textposition at the last state to be included in yytext
*/
private int zzPushbackPos;
/**
* 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;
/* user code: */
public _ConceptLexer() {
this((java.io.Reader) null);
}
/**
* Creates a new scanner
*
* @param in the java.io.Reader to read input from.
*/
public _ConceptLexer(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) {
char[] map = new char[0x10000];
int i = 0; /* index in packed string */
int j = 0; /* index in unpacked array */
while (i < 48) {
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;
zzBufferArray = com.intellij.util.text.CharArrayUtil.fromSequenceWithoutCopying(buffer);
zzCurrentPos = zzMarkedPos = zzStartRead = start;
zzPushbackPos = 0;
zzAtEOF = false;
zzAtBOL = true;
zzEndRead = end;
yybegin(initialState);
}
/**
* Refills the input buffer.
*
* @return <code>false</code>, iff there was new input.
* @throws 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.
* <p/>
* 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 zzBufferArray != null ? zzBufferArray[zzStartRead + pos] : 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.
* <p/>
* 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.).
* <p/>
* 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.
* <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 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
* @throws 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;
char[] zzBufferArrayL = zzBufferArray;
char[] zzCMapL = ZZ_CMAP;
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];
zzForAction:
{
while (true) {
if (zzCurrentPosL < zzEndReadL)
zzInput = (zzBufferArrayL != null ? zzBufferArrayL[zzCurrentPosL++] : zzBufferL.charAt(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 = (zzBufferArrayL != null ? zzBufferArrayL[zzCurrentPosL++] : zzBufferL.charAt(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 9: {
yybegin(INCONCEPTHEADING);
return CONCEPT_HEADING_IDENTIFIER;
}
case 29:
break;
case 23: {
yybegin(INDYNAMICTABLEITEM);
return DYNAMIC_ARG;
}
case 30:
break;
case 27: {
yybegin(INCONCEPTHEADING);
return DYNAMIC_ARG_END;
}
case 31:
break;
case 4: {
yybegin(INTABLEHEADER);
return TABLE_HEADER;
}
case 32:
break;
case 8: {
return COMMENT;
}
case 33:
break;
case 26: {
yybegin(INDYNAMICCONCEPTARG);
return DYNAMIC_ARG_START;
}
case 34:
break;
case 7: {
yybegin(INTABLECELL);
return TABLE_ROW_VALUE;
}
case 35:
break;
case 12: {
yybegin(YYINITIAL);
return STEP;
}
case 36:
break;
case 16: {
yybegin(INSTEP);
return DYNAMIC_ARG_END;
}
case 37:
break;
case 22: {
yybegin(INDYNAMICTABLEITEM);
return DYNAMIC_ARG_START;
}
case 38:
break;
case 5: {
yybegin(INTABLEBODYROW);
return WHITESPACE;
}
case 39:
break;
case 19: {
yypushback(1);
yybegin(YYINITIAL);
}
case 40:
break;
case 6: {
yybegin(INCONCEPTHEADING);
return CONCEPT_HEADING;
}
case 41:
break;
case 3: {
return DYNAMIC_ARG;
}
case 42:
break;
case 21: {
yybegin(INTABLEBODY);
return NEW_LINE;
}
case 43:
break;
case 10: {
yybegin(INTABLEHEADER);
return TABLE_BORDER;
}
case 44:
break;
case 14: {
yybegin(INARG);
return ARG_START;
}
case 45:
break;
case 2: {
return ARG;
}
case 46:
break;
case 15: {
yybegin(INSTEP);
return ARG_END;
}
case 47:
break;
case 28: {
yybegin(YYINITIAL);
return CONCEPT_HEADING;
}
case 48:
break;
case 18: {
yybegin(INTABLEHEADER);
return TABLE_BORDER;
}
case 49:
break;
case 17: {
yybegin(INTABLEBODY);
return NEW_LINE;
}
case 50:
break;
case 20: {
yybegin(INTABLEBODYROW);
return TABLE_BORDER;
}
case 51:
break;
case 25: {
yybegin(YYINITIAL);
return NEW_LINE;
}
case 52:
break;
case 11: {
yybegin(INSTEP);
return STEP_IDENTIFIER;
}
case 53:
break;
case 1: {
yybegin(INSTEP);
return STEP;
}
case 54:
break;
case 13: {
yybegin(INDYNAMIC);
return DYNAMIC_ARG_START;
}
case 55:
break;
case 24: {
yybegin(INTABLEBODYROW);
return DYNAMIC_ARG_END;
}
case 56:
break;
default:
if (zzInput == YYEOF && zzStartRead == zzCurrentPos) {
zzAtEOF = true;
return null;
} else {
zzScanError(ZZ_NO_MATCH);
}
}
}
}
}