GitBucket
Newer
// DO NOT EDIT
// Generated by JFlex 1.8.2 http://jflex.de/
// source: my_custom_token_maker.flex
/*
* 11/07/2008
*
* PlainTextTokenMaker.flex - Scanner for plain text files.
*
* This library is distributed under a modified BSD license. See the included
* LICENSE file for details.
*/
package istlab.KisoJikken.Test;
import java.io.IOException;
import javax.swing.text.Segment;
import org.fife.ui.rsyntaxtextarea.AbstractJFlexTokenMaker;
import org.fife.ui.rsyntaxtextarea.Token;
import org.fife.ui.rsyntaxtextarea.TokenImpl;
import org.fife.ui.rsyntaxtextarea.TokenTypes;
/**
* Scanner for plain text files.
*
* This implementation was created using
* <a href="https://www.jflex.de/">JFlex</a> 1.4.1; however, the generated file
* was modified for performance. Memory allocation needs to be almost
* completely removed to be competitive with the handwritten lexers (subclasses
* of <code>AbstractTokenMaker</code>), so this class has been modified so that
* Strings are never allocated (via yytext()), and the scanner never has to
* worry about refilling its buffer (needlessly copying chars around).
* We can achieve this because RText always scans exactly 1 line of tokens at a
* time, and hands the scanner this line as an array of characters (a Segment
* really). Since tokens contain pointers to char arrays instead of Strings
* holding their contents, there is no need for allocating new memory for
* Strings.<p>
*
* The actual algorithm generated for scanning has, of course, not been
* modified.<p>
*
* If you wish to regenerate this file yourself, keep in mind the following:
* <ul>
* <li>The generated <code>PlainTextTokenMaker.java</code> file will contain
* two definitions of both <code>zzRefill</code> and <code>yyreset</code>.
* You should hand-delete the second of each definition (the ones
* generated by the lexer), as these generated methods modify the input
* buffer, which we'll never have to do.</li>
* <li>You should also change the declaration/definition of zzBuffer to NOT
* be initialized. This is a needless memory allocation for us since we
* will be pointing the array somewhere else anyway.</li>
* <li>You should NOT call <code>yylex()</code> on the generated scanner
* directly; rather, you should use <code>getTokenList</code> as you would
* with any other <code>TokenMaker</code> instance.</li>
* </ul>
*
* @author Robert Futrell
* @version 0.5
*
*/
// See https://github.com/jflex-de/jflex/issues/222
@SuppressWarnings("FallThrough")
public class MyCustomTokenMaker extends AbstractJFlexTokenMaker {
/** 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\u10ff\u0100";
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\25\0\1\1\1\3\1\0\1\3"+
"\1\4\11\3\1\5\1\6\12\7\1\10\1\3\1\0"+
"\1\3\1\0\2\3\32\7\1\3\1\0\1\3\1\0"+
"\1\3\1\0\4\7\1\11\1\12\1\7\1\13\1\14"+
"\2\7\1\15\3\7\1\16\2\7\1\17\1\20\2\7"+
"\1\21\3\7\3\0\1\3\u0181\0";
private static int [] zzUnpackcmap_blocks() {
int [] result = new int[512];
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\1\2\1\3\14\1\1\0\1\1\1\4"+
"\2\0";
private static int [] zzUnpackAction() {
int [] result = new int[21];
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\22\0\44\0\22\0\66\0\110\0\132\0\154"+
"\0\176\0\220\0\242\0\264\0\306\0\330\0\352\0\374"+
"\0\u010e\0\u0120\0\u0132\0\u0144\0\u0132";
private static int [] zzUnpackRowMap() {
int [] result = new int[21];
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\4\2\1\5\1\2\1\5\1\6"+
"\1\7\5\5\1\10\23\0\1\3\27\0\1\5\1\0"+
"\11\5\7\0\1\5\1\0\3\5\1\11\3\5\1\12"+
"\1\5\7\0\1\5\1\0\7\5\1\13\1\5\7\0"+
"\1\5\1\0\10\5\1\14\7\0\1\5\1\0\4\5"+
"\1\15\4\5\7\0\1\5\1\0\5\5\1\16\3\5"+
"\7\0\1\5\1\0\7\5\1\17\1\5\7\0\1\5"+
"\1\0\10\5\1\20\7\0\1\5\1\0\1\16\10\5"+
"\7\0\1\5\1\21\11\5\7\0\1\5\1\0\5\5"+
"\1\22\3\5\5\0\1\23\1\0\1\5\1\0\11\5"+
"\6\0\1\24\22\0\1\5\1\21\6\5\1\16\2\5"+
"\3\0\1\25\1\23\1\25\2\23\1\25\11\23\6\0"+
"\1\23\13\0";
private static int [] zzUnpackTrans() {
int [] result = new int[342];
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\1\11\1\1\1\11\14\1\1\0\2\1\2\0";
private static int [] zzUnpackAttribute() {
int [] result = new int[21];
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. */
@SuppressWarnings("unused")
private int yyline;
/** Number of characters from the last newline up to the start of the matched text. */
@SuppressWarnings("unused")
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. */
@SuppressWarnings("unused")
private boolean zzEOFDone;
/* user code: */
/**
* Constructor. This must be here because JFlex does not generate a
* no-parameter constructor.
*/
public MyCustomTokenMaker() {
}
/**
* Adds the token specified to the current linked list of tokens.
*
* @param tokenType The token's type.
* @param link Whether this token is a hyperlink.
*/
private void addToken(int tokenType, boolean link) {
int so = zzStartRead + offsetShift;
super.addToken(zzBuffer, zzStartRead,zzMarkedPos-1, tokenType, so, link);
zzStartRead = zzMarkedPos;
}
/**
* Always returns <code>TokenTypes.NULL</code>, as there are no multiline
* tokens in properties files.
*
* @param text The line of tokens to examine.
* @param initialTokenType The token type to start with (i.e., the value
* of <code>getLastTokenTypeOnLine</code> for the line before
* <code>text</code>).
* @return <code>TokenTypes.NULL</code>.
*/
public int getLastTokenTypeOnLine(Segment text, int initialTokenType) {
return TokenTypes.NULL;
}
/**
* Returns the text to place at the beginning and end of a
* line to "comment" it in a this programming language.
*
* @return <code>null</code>, as there are no comments in plain text.
*/
@Override
public String[] getLineCommentStartAndEnd(int languageIndex) {
return null;
}
/**
* Always returns <tt>false</tt>, as you never want "mark occurrences"
* working in plain text files.
*
* @param type The token type.
* @return Whether tokens of this type should have "mark occurrences"
* enabled.
*/
@Override
public boolean getMarkOccurrencesOfTokenType(int type) {
return false;
}
/**
* Returns the first token in the linked list of tokens generated
* from <code>text</code>. This method must be implemented by
* subclasses so they can correctly implement syntax highlighting.
*
* @param text The text from which to get tokens.
* @param initialTokenType The token type we should start with.
* @param startOffset The offset into the document at which
* <code>text</code> starts.
* @return The first <code>Token</code> in a linked list representing
* the syntax highlighted text.
*/
public Token getTokenList(Segment text, int initialTokenType, int startOffset) {
resetTokenList();
this.offsetShift = -text.offset + startOffset;
// Start off in the proper state.
s = text;
try {
yyreset(zzReader);
yybegin(YYINITIAL);
return yylex();
} catch (IOException ioe) {
ioe.printStackTrace();
return new TokenImpl();
}
}
/**
* Refills the input buffer.
*
* @return <code>true</code> if EOF was reached, otherwise
* <code>false</code>.
*/
private boolean zzRefill() {
return zzCurrentPos>=s.offset+s.count;
}
/**
* 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
* <b>cannot</b> be reused (internal buffer is discarded and lost).
* Lexical state is set to <tt>YY_INITIAL</tt>.
*
* @param reader the new input stream
*/
public final void yyreset(java.io.Reader reader) {
// 's' has been updated.
zzBuffer = s.array;
/*
* We replaced the line below with the two below it because zzRefill
* no longer "refills" the buffer (since the way we do it, it's always
* "full" the first time through, since it points to the segment's
* array). So, we assign zzEndRead here.
*/
//zzStartRead = zzEndRead = s.offset;
zzStartRead = s.offset;
zzEndRead = zzStartRead + s.count - 1;
zzCurrentPos = zzMarkedPos = /*zzPushbackPos =*/ s.offset;
zzLexicalState = YYINITIAL;
zzReader = reader;
zzAtBOL = true;
zzAtEOF = false;
}
/**
* Creates a new scanner
*
* @param in the java.io.Reader to read input from.
*/
public MyCustomTokenMaker(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;
}
/**
* 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 org.fife.ui.rsyntaxtextarea.Token yylex() throws java.io.IOException {
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;
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 = zzBufferL[zzCurrentPosL++];
// 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;
switch (zzLexicalState) {
case YYINITIAL: {
addNullToken(); return firstToken;
} // fall though
case 22: break;
default:
return null;
}
}
else {
switch (zzAction < 0 ? zzAction : ZZ_ACTION[zzAction]) {
case 1:
{ addToken(TokenTypes.IDENTIFIER, false);
}
// fall through
case 5: break;
case 2:
{ addToken(TokenTypes.WHITESPACE, false);
}
// fall through
case 6: break;
case 3:
{ addNullToken(); return firstToken;
}
// fall through
case 7: break;
case 4:
{ addToken(TokenTypes.IDENTIFIER, true);
}
// fall through
case 8: break;
default:
zzScanError(ZZ_NO_MATCH);
}
}
}
}
}