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

net.thisptr.jackson.jq.internal.javacc.JsonQueryParserConstants Maven / Gradle / Ivy

There is a newer version: 198
Show newest version
/* Generated By:JavaCC: Do not edit this line. JsonQueryParserConstants.java */
package net.thisptr.jackson.jq.internal.javacc;


/**
 * Token literal values and constants.
 * Generated by org.javacc.parser.OtherFilesGen#start()
 */
public interface JsonQueryParserConstants {

  /** End of File. */
  int EOF = 0;
  /** RegularExpression Id. */
  int SPACES = 1;
  /** RegularExpression Id. */
  int OP_AND = 2;
  /** RegularExpression Id. */
  int OP_OR = 3;
  /** RegularExpression Id. */
  int OP_DEFAULT = 4;
  /** RegularExpression Id. */
  int COMP_EQUAL = 5;
  /** RegularExpression Id. */
  int COMP_NOT_EQUAL = 6;
  /** RegularExpression Id. */
  int COMP_GREATER = 7;
  /** RegularExpression Id. */
  int COMP_GREATER_EQUAL = 8;
  /** RegularExpression Id. */
  int COMP_LESS = 9;
  /** RegularExpression Id. */
  int COMP_LESS_EQUAL = 10;
  /** RegularExpression Id. */
  int PLUS = 11;
  /** RegularExpression Id. */
  int MINUS = 12;
  /** RegularExpression Id. */
  int TIMES = 13;
  /** RegularExpression Id. */
  int DIVIDE = 14;
  /** RegularExpression Id. */
  int MODULO = 15;
  /** RegularExpression Id. */
  int ASSIGN_OP = 16;
  /** RegularExpression Id. */
  int UPDATE_OP = 17;
  /** RegularExpression Id. */
  int PLUS_EQUAL = 18;
  /** RegularExpression Id. */
  int MINUS_EQUAL = 19;
  /** RegularExpression Id. */
  int TIMES_EQUAL = 20;
  /** RegularExpression Id. */
  int DIVIDE_EQUAL = 21;
  /** RegularExpression Id. */
  int MODULO_EQUAL = 22;
  /** RegularExpression Id. */
  int DEFAULT_EQUAL = 23;
  /** RegularExpression Id. */
  int OPEN_PAR = 24;
  /** RegularExpression Id. */
  int CLOSE_PAR = 25;
  /** RegularExpression Id. */
  int SEMICOLON = 26;
  /** RegularExpression Id. */
  int DOT = 27;
  /** RegularExpression Id. */
  int RECURSION = 28;
  /** RegularExpression Id. */
  int OPEN_BRACKET = 29;
  /** RegularExpression Id. */
  int CLOSE_BRACKET = 30;
  /** RegularExpression Id. */
  int QUESTION = 31;
  /** RegularExpression Id. */
  int DOLLAR = 32;
  /** RegularExpression Id. */
  int PIPE = 33;
  /** RegularExpression Id. */
  int ATSIGN = 34;
  /** RegularExpression Id. */
  int OPEN_BRACE = 35;
  /** RegularExpression Id. */
  int CLOSE_BRACE = 36;
  /** RegularExpression Id. */
  int COLON = 37;
  /** RegularExpression Id. */
  int COMMA = 38;
  /** RegularExpression Id. */
  int BOOLEAN_LITERAL_TRUE = 39;
  /** RegularExpression Id. */
  int BOOLEAN_LITERAL_FALSE = 40;
  /** RegularExpression Id. */
  int NULL_LITERAL = 41;
  /** RegularExpression Id. */
  int INTEGER_LITERAL = 42;
  /** RegularExpression Id. */
  int FLOAT_LITERAL = 43;
  /** RegularExpression Id. */
  int EXPONENT = 44;
  /** RegularExpression Id. */
  int QUOTE = 45;
  /** RegularExpression Id. */
  int ENDQUOTE = 46;
  /** RegularExpression Id. */
  int VISIBLE_CHAR = 47;
  /** RegularExpression Id. */
  int ESCAPE_CHAR = 49;
  /** RegularExpression Id. */
  int OPEN_INTERP = 50;
  /** RegularExpression Id. */
  int CODEPOINT_CHAR = 51;
  /** RegularExpression Id. */
  int KEYWORD_IF = 52;
  /** RegularExpression Id. */
  int KEYWORD_THEN = 53;
  /** RegularExpression Id. */
  int KEYWORD_ELIF = 54;
  /** RegularExpression Id. */
  int KEYWORD_ELSE = 55;
  /** RegularExpression Id. */
  int KEYWORD_END = 56;
  /** RegularExpression Id. */
  int KEYWORD_AS = 57;
  /** RegularExpression Id. */
  int KEYWORD_DEF = 58;
  /** RegularExpression Id. */
  int KEYWORD_REDUCE = 59;
  /** RegularExpression Id. */
  int KEYWORD_FOREACH = 60;
  /** RegularExpression Id. */
  int KEYWORD_TRY = 61;
  /** RegularExpression Id. */
  int KEYWORD_CATCH = 62;
  /** RegularExpression Id. */
  int IDENTIFIER = 63;
  /** RegularExpression Id. */
  int LETTER = 64;
  /** RegularExpression Id. */
  int DIGIT = 65;

  /** Lexical state. */
  int DEFAULT = 0;
  /** Lexical state. */
  int STATE_STRING = 1;
  /** Lexical state. */
  int STATE_STRING_ESCAPE = 2;

  /** Literal token values. */
  String[] tokenImage = {
    "",
    "",
    "\"and\"",
    "\"or\"",
    "\"//\"",
    "\"==\"",
    "\"!=\"",
    "\">\"",
    "\">=\"",
    "\"<\"",
    "\"<=\"",
    "\"+\"",
    "\"-\"",
    "\"*\"",
    "\"/\"",
    "\"%\"",
    "\"=\"",
    "\"|=\"",
    "\"+=\"",
    "\"-=\"",
    "\"*=\"",
    "\"/=\"",
    "\"%=\"",
    "\"//=\"",
    "\"(\"",
    "\")\"",
    "\";\"",
    "\".\"",
    "\"..\"",
    "\"[\"",
    "\"]\"",
    "\"?\"",
    "\"$\"",
    "\"|\"",
    "\"@\"",
    "\"{\"",
    "\"}\"",
    "\":\"",
    "\",\"",
    "\"true\"",
    "\"false\"",
    "\"null\"",
    "",
    "",
    "",
    "\"\\\"\"",
    "",
    "",
    "\"\\\\\"",
    "",
    "",
    "",
    "\"if\"",
    "\"then\"",
    "\"elif\"",
    "\"else\"",
    "\"end\"",
    "\"as\"",
    "\"def\"",
    "\"reduce\"",
    "\"foreach\"",
    "\"try\"",
    "\"catch\"",
    "",
    "",
    "",
  };

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy