/* The following code was generated by JFlex 1.4.1 on 1/20/09 10:04 AM */
/*
* 11/07/2008
*
* PlainTextTokenMaker.flex - Scanner for plain text files.
* Copyright (C) 2008 Robert Futrell
* robert_futrell at users.sourceforge.net
* http://fifesoft.com/rsyntaxtextarea
*
* This library 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 2.1 of the License, or (at your option) any later version.
*
* This library 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 this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
package org.fife.ui.rsyntaxtextarea.modes;
import java.io.*;
import javax.swing.text.Segment;
import org.fife.ui.rsyntaxtextarea.*;
/**
* Scanner for plain text files.
*
* This implementation was created using <a href="http://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
*
*/
public class PlainTextTokenMaker extends AbstractJFlexTokenMaker {
/** This character denotes the end of file */
public static final int YYEOF = -1;
/** lexical states */
public static final int YYINITIAL = 0;
/**
* Translates characters to character classes
*/
private static final String ZZ_CMAP_PACKED =
"\11\0\1\3\1\2\25\0\1\3\1\4\1\0\1\4\1\6\1\4" +
"\7\4\1\4\1\21\1\5\12\1\1\17\1\4\1\0\1\4\1\0" +
"\2\4\32\1\1\4\1\0\1\4\3\0\4\1\1\16\1\13\1\1" +
"\1\7\1\14\2\1\1\15\3\1\1\11\2\1\1\12\1\10\2\1" +
"\1\20\3\1\3\0\1\4\uff81\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\2\1\1\2\1\3\14\1\1\0\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\1\5\3\2\1\6\3\3\1\7" +
"\3\3\1\2\1\10\1\2\23\0\1\3\5\0\10\3" +
"\1\0\1\3\4\0\1\5\17\0\1\3\5\0\1\3" +
"\1\11\6\3\1\0\1\3\2\0\1\3\5\0\1\3" +
"\1\12\3\3\1\13\2\3\1\0\1\3\2\0\1\3" +
"\5\0\10\3\1\0\1\14\2\0\1\3\5\0\1\3" +
"\1\15\6\3\1\0\1\3\2\0\1\3\5\0\2\3" +
"\1\16\5\3\1\0\1\3\2\0\1\3\5\0\6\3" +
"\1\17\1\3\1\0\1\3\2\0\1\3\5\0\10\3" +
"\1\0\1\20\2\0\1\3\5\0\2\3\1\21\5\3" +
"\1\0\1\3\2\0\1\3\5\0\10\3\1\22\1\3" +
"\2\0\1\3\5\0\7\3\1\16\1\0\1\3\2\0" +
"\1\3\5\0\10\3\1\0\1\3\1\23\1\0\1\3" +
"\5\0\3\3\1\16\4\3\1\22\1\3\6\0\1\24" +
"\15\0\1\23\2\0\1\25\12\23\1\25\1\23\1\25" +
"\5\0\1\23\14\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 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 <code>aState</code>
*/
private static final int[] ZZ_ATTRIBUTE = zzUnpackAttribute();
private static final String ZZ_ATTRIBUTE_PACKED_0 =
"\1\0\1\11\1\1\1\11\15\1\1\0\1\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;
}
/** 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[];
/** 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;
/** zzAtEOF == true <=> the scanner is at the EOF */
private boolean zzAtEOF;
/* user code: */
/**
* Constructor. This must be here because JFlex does not generate a no-parameter constructor.
*/
public PlainTextTokenMaker() {
}
/**
* 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>Token.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>Token.NULL</code>.
*/
public int getLastTokenTypeOnLine(Segment text, int initialTokenType) {
return Token.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.
*/
public String[] getLineCommentStartAndEnd() {
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.
*/
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 DefaultToken();
}
}
/**
* Refills the input buffer.
*
* @return <code>true</code> if EOF was reached, otherwise <code>false</code>.
* @exception IOException
* if any I/O-Error occurs.
*/
private boolean zzRefill() throws java.io.IOException {
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) throws java.io.IOException {
// '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 = s.offset;
zzLexicalState = YYINITIAL;
zzReader = reader;
zzAtEOF = false;
}
/**
* 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 PlainTextTokenMaker(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 PlainTextTokenMaker(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 < 90) {
int count = packed.charAt(i++);
char value = packed.charAt(i++);
do
map[j++] = value;
while (--count > 0);
}
return map;
}
/**
* 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();
}
/**
* 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 <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[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 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;
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 = 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: {
addToken(Token.WHITESPACE, false);
}
case 5:
break;
case 2: {
addNullToken();
return firstToken;
}
case 6:
break;
case 4: {
addToken(Token.IDENTIFIER, true);
}
case 7:
break;
case 1: {
addToken(Token.IDENTIFIER, false);
}
case 8:
break;
default:
if (zzInput == YYEOF && zzStartRead == zzCurrentPos) {
zzAtEOF = true;
switch (zzLexicalState) {
case YYINITIAL: {
addNullToken();
return firstToken;
}
case 22:
break;
default:
return null;
}
}
else {
zzScanError(ZZ_NO_MATCH);
}
}
}
}
}