All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.thoughtworks.qdox.parser.impl.DefaultJavaCommentLexer Maven / Gradle / Ivy

Go to download

QDox is a high speed, small footprint parser for extracting class/interface/method definitions from source files complete with JavaDoc @tags. It is designed to be used by active code generators or documentation tools.

There is a newer version: 2.2.0
Show newest version
// DO NOT EDIT
// Generated by JFlex 1.8.2 http://jflex.de/
// source: src/grammar/commentlexer.flex

package com.thoughtworks.qdox.parser.impl;

/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */

import com.thoughtworks.qdox.parser.*;

// See https://github.com/jflex-de/jflex/issues/222
@SuppressWarnings("FallThrough")
public class DefaultJavaCommentLexer implements Lexer {

  /** 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;
  public static final int JAVADOC = 2;
  public static final int JAVADOCCONTENT = 4;
  public static final int JAVADOCLINE = 6;
  public static final int JAVADOCTAG = 8;
  public static final int MULTILINECOMMENT = 10;
  public static final int SINGLELINECOMMENT = 12;

  /**
   * 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
  };

  /**
   * 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\37\u0100\1\u0200\267\u0100\10\u0300\u1020\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\2\3\1\4\22\0\1\1\11\0"+
    "\1\5\4\0\1\6\20\0\1\7\104\0\1\3\u01a2\0"+
    "\2\3\326\0\u0100\3";

  private static int [] zzUnpackcmap_blocks() {
    int [] result = new int[1024];
    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 =
    "\13\0\3\1\1\2\1\3\1\4\1\5\1\1\1\5"+
    "\1\6\2\1\1\7\1\0\1\7\1\1\1\10\2\11"+
    "\2\1\2\12\5\0\1\13\1\14\1\3\1\15\1\16"+
    "\1\0\1\17\6\0\2\7\2\0\1\20\1\21\1\22"+
    "\3\0\1\23\1\0\3\24\1\21\1\0\1\23\1\25"+
    "\1\26\1\27";

  private static int [] zzUnpackAction() {
    int [] result = new int[73];
    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\10\0\20\0\30\0\40\0\50\0\60\0\70"+
    "\0\100\0\110\0\120\0\130\0\140\0\150\0\130\0\160"+
    "\0\130\0\130\0\170\0\200\0\130\0\210\0\220\0\230"+
    "\0\240\0\250\0\260\0\270\0\130\0\300\0\310\0\320"+
    "\0\130\0\330\0\70\0\130\0\340\0\350\0\360\0\370"+
    "\0\130\0\u0100\0\130\0\130\0\170\0\130\0\210\0\u0108"+
    "\0\220\0\230\0\u0110\0\u0118\0\130\0\u0120\0\u0128\0\260"+
    "\0\210\0\u0130\0\130\0\u0138\0\350\0\360\0\u0140\0\u0100"+
    "\0\210\0\130\0\u0118\0\u0148\0\u0150\0\u0158\0\130\0\u0130"+
    "\0\130";

  private static int [] zzUnpackRowMap() {
    int [] result = new int[73];
    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 =
    "\3\14\1\0\1\15\1\14\1\16\1\14\1\17\1\14"+
    "\2\17\1\15\1\20\1\17\1\21\1\22\1\23\2\22"+
    "\1\24\2\22\1\25\1\26\1\27\1\30\1\31\1\32"+
    "\1\33\2\26\1\14\1\34\1\35\1\0\1\36\2\14"+
    "\1\37\3\14\1\0\1\15\1\40\4\14\1\41\1\0"+
    "\1\42\3\14\1\43\1\10\3\44\1\10\2\43\6\0"+
    "\1\45\10\0\1\46\6\0\1\47\13\0\1\14\12\0"+
    "\1\50\1\51\2\0\1\52\3\0\1\20\1\53\1\54"+
    "\1\0\1\55\5\0\1\25\2\0\1\56\5\0\2\57"+
    "\1\30\1\31\1\32\1\60\3\57\1\61\1\30\1\31"+
    "\1\32\1\61\2\57\1\0\1\62\3\0\1\63\2\0"+
    "\1\64\1\31\1\65\1\64\1\66\1\67\2\64\1\0"+
    "\1\62\1\65\2\0\1\63\2\0\1\57\1\61\1\30"+
    "\1\31\1\32\1\70\1\71\1\57\1\0\1\34\10\0"+
    "\1\35\5\0\1\72\2\0\1\72\1\0\3\72\6\0"+
    "\1\73\3\0\1\41\12\0\1\74\2\0\1\75\2\0"+
    "\1\75\1\0\3\75\5\0\1\76\7\0\1\77\3\0"+
    "\1\100\5\0\1\54\1\57\1\61\1\30\1\31\1\32"+
    "\1\60\1\101\1\57\5\0\1\63\1\102\1\0\2\64"+
    "\1\65\1\64\1\66\3\64\2\0\1\65\5\0\2\64"+
    "\1\65\1\64\1\66\1\67\1\103\1\64\1\72\2\0"+
    "\1\72\1\0\1\104\2\72\1\0\1\105\3\0\1\74"+
    "\7\0\1\106\1\107\1\0\1\72\2\0\1\72\1\0"+
    "\1\104\1\110\1\72\1\0\1\105\13\0\1\106\1\111"+
    "\1\0";

  private static int [] zzUnpackTrans() {
    int [] result = new int[352];
    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 =
    "\13\0\1\11\2\1\1\11\1\1\2\11\2\1\1\11"+
    "\3\1\1\0\3\1\1\11\3\1\1\11\2\1\1\11"+
    "\3\0\1\1\1\11\1\1\2\11\1\0\1\11\6\0"+
    "\1\11\1\1\2\0\2\1\1\11\4\1\1\0\1\1"+
    "\1\11\4\1\1\11\1\1\1\11";

  private static int [] zzUnpackAttribute() {
    int [] result = new int[73];
    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}.
   *
   * 

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; /** For the backwards DFA of general lookahead statements */ private boolean [] zzFin = new boolean [ZZ_BUFFERSIZE+1]; /** Number of newlines encountered up to the start of the matched text. */ private int yyline; /** Number of characters from the last newline up to the start of the matched text. */ 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. */ private boolean zzEOFDone; /* user code: */ private int lineOffset = 1; private int columnOffset =1; private int stateDepth = 0; private int[] stateStack = new int[10]; private StringBuffer codeBody = new StringBuffer(8192); private boolean appendingToCodeBody; public int lex() throws java.io.IOException { return yylex(); } public String text() { return yytext(); } public int getLine() { return yyline + lineOffset; } public void setLineOffset(int lineOffset) { this.lineOffset = lineOffset; } public int getColumn() { return yycolumn + columnOffset; } public void setColumnOffset(int columnOffset) { this.columnOffset = columnOffset; } public String getCodeBody(){ String s = codeBody.toString(); codeBody = new StringBuffer(8192); return s; } private void pushState(int newState) { stateStack[stateDepth++] = zzLexicalState; yybegin(newState); } private void popState() { yybegin(stateStack[--stateDepth]); } private int peekState(int relative) { if(relative > stateDepth) { return -1; } else { return stateStack[stateDepth - relative]; } } /** * Creates a new scanner * * @param in the java.io.Reader to read input from. */ public DefaultJavaCommentLexer(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. * *

Does not close the old reader. * *

All internal variables are reset, the old input stream cannot be reused (internal * buffer is discarded and lost). Lexical state is set to {@code ZZ_INITIAL}. * *

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. * *

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. * *

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". * *

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 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. * *

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; } /** * Contains user EOF-code, which will be executed exactly once, * when the end of file is reached */ private void zzDoEOF() throws java.io.IOException { if (!zzEOFDone) { zzEOFDone = true; yyclose(); } } /** * 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 int 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; boolean zzR = false; int zzCh; int zzCharCount; for (zzCurrentPosL = zzStartRead ; zzCurrentPosL < zzMarkedPosL ; zzCurrentPosL += zzCharCount ) { zzCh = Character.codePointAt(zzBufferL, zzCurrentPosL, zzMarkedPosL); zzCharCount = Character.charCount(zzCh); switch (zzCh) { case '\u000B': // fall through case '\u000C': // fall through case '\u0085': // fall through case '\u2028': // fall through case '\u2029': yyline++; yycolumn = 0; zzR = false; break; case '\r': yyline++; yycolumn = 0; zzR = true; break; case '\n': if (zzR) zzR = false; else { yyline++; yycolumn = 0; } break; default: zzR = false; yycolumn += zzCharCount; } } if (zzR) { // peek one character ahead if it is // (if we have counted one line too much) boolean zzPeek; if (zzMarkedPosL < zzEndReadL) zzPeek = zzBufferL[zzMarkedPosL] == '\n'; else if (zzAtEOF) zzPeek = false; else { boolean eof = zzRefill(); zzEndReadL = zzEndRead; zzMarkedPosL = zzMarkedPos; zzBufferL = zzBuffer; if (eof) zzPeek = false; else zzPeek = zzBufferL[zzMarkedPosL] == '\n'; } if (zzPeek) yyline--; } 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] + 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; zzDoEOF(); { return 0; } } else { switch (zzAction < 0 ? zzAction : ZZ_ACTION[zzAction]) { case 1: { codeBody.append(yytext()); } // fall through case 24: break; case 2: { yypushback(1); pushState(JAVADOCLINE); } // fall through case 25: break; case 3: { pushState(JAVADOCLINE); } // fall through case 26: break; case 4: { yypushback(1); pushState(JAVADOCTAG); } // fall through case 27: break; case 5: { yypushback(1); popState(); pushState(JAVADOCLINE); } // fall through case 28: break; case 6: { yypushback(1); popState(); pushState(JAVADOCTAG); } // fall through case 29: break; case 7: { popState(); return DefaultJavaCommentParser.JAVADOCLINE; } // fall through case 30: break; case 8: { popState(); pushState(JAVADOCLINE); } // fall through case 31: break; case 9: { popState(); return DefaultJavaCommentParser.JAVADOCLINE; } // fall through case 32: break; case 10: { codeBody.append(yytext()); popState(); } // fall through case 33: break; case 11: { codeBody.append( "/*" ); pushState( MULTILINECOMMENT ); } // fall through case 34: break; case 12: { codeBody.append( "//" ); pushState( SINGLELINECOMMENT ); } // fall through case 35: break; case 13: { popState(); return DefaultJavaCommentParser.JAVADOCEND; } // fall through case 36: break; case 14: // lookahead expression with fixed lookahead length zzMarkedPos = Character.offsetByCodePoints (zzBufferL, zzStartRead, zzEndRead - zzStartRead, zzMarkedPos, -1); { pushState(JAVADOCTAG); } // fall through case 37: break; case 15: { popState(); return DefaultJavaCommentParser.JAVADOCLINE; } // fall through case 38: break; case 16: { popState(); popState(); return DefaultJavaCommentParser.JAVADOCEND; } // fall through case 39: break; case 17: { return DefaultJavaCommentParser.JAVADOCTAG; } // fall through case 40: break; case 18: { codeBody.append("*/"); popState(); } // fall through case 41: break; case 19: { pushState( JAVADOC ); pushState( JAVADOCCONTENT ); return DefaultJavaCommentParser.JAVADOCSTART; } // fall through case 42: break; case 20: // general lookahead, find correct zzMarkedPos { int zzFState = 7; int zzFPos = zzStartRead; if (zzFin.length <= zzBufferL.length) { zzFin = new boolean[zzBufferL.length+1]; } boolean zzFinL[] = zzFin; while (zzFState != -1 && zzFPos < zzMarkedPos) { zzFinL[zzFPos] = ((zzAttrL[zzFState] & 1) == 1); zzInput = Character.codePointAt(zzBufferL, zzFPos, zzMarkedPos); zzFPos += Character.charCount(zzInput); zzFState = zzTransL[ zzRowMapL[zzFState] + zzCMap(zzInput) ]; } if (zzFState != -1) { zzFinL[zzFPos++] = ((zzAttrL[zzFState] & 1) == 1); } while (zzFPos <= zzMarkedPos) { zzFinL[zzFPos++] = false; } zzFState = 8; zzFPos = zzMarkedPos; while (!zzFinL[zzFPos] || (zzAttrL[zzFState] & 1) != 1) { zzInput = Character.codePointBefore(zzBufferL, zzFPos, zzStartRead); zzFPos -= Character.charCount(zzInput); zzFState = zzTransL[ zzRowMapL[zzFState] + zzCMap(zzInput) ]; }; zzMarkedPos = zzFPos; } { popState(); return DefaultJavaCommentParser.JAVADOCLINE; } // fall through case 43: break; case 21: { codeBody.append( "/**/" ); } // fall through case 44: break; case 22: // general lookahead, find correct zzMarkedPos { int zzFState = 9; int zzFPos = zzStartRead; if (zzFin.length <= zzBufferL.length) { zzFin = new boolean[zzBufferL.length+1]; } boolean zzFinL[] = zzFin; while (zzFState != -1 && zzFPos < zzMarkedPos) { zzFinL[zzFPos] = ((zzAttrL[zzFState] & 1) == 1); zzInput = Character.codePointAt(zzBufferL, zzFPos, zzMarkedPos); zzFPos += Character.charCount(zzInput); zzFState = zzTransL[ zzRowMapL[zzFState] + zzCMap(zzInput) ]; } if (zzFState != -1) { zzFinL[zzFPos++] = ((zzAttrL[zzFState] & 1) == 1); } while (zzFPos <= zzMarkedPos) { zzFinL[zzFPos++] = false; } zzFState = 10; zzFPos = zzMarkedPos; while (!zzFinL[zzFPos] || (zzAttrL[zzFState] & 1) != 1) { zzInput = Character.codePointBefore(zzBufferL, zzFPos, zzStartRead); zzFPos -= Character.charCount(zzInput); zzFState = zzTransL[ zzRowMapL[zzFState] + zzCMap(zzInput) ]; }; zzMarkedPos = zzFPos; } { popState(); return DefaultJavaCommentParser.JAVADOCTAG; } // fall through case 45: break; case 23: { yypushback(2); pushState(JAVADOC); return DefaultJavaCommentParser.JAVADOCSTART; } // fall through case 46: break; default: zzScanError(ZZ_NO_MATCH); } } } } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy