public final HiveParser_IdentifiersParser.nonReserved_return nonReserved() throws RecognitionException { HiveParser_IdentifiersParser.nonReserved_return retval = new HiveParser_IdentifiersParser.nonReserved_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); set310=input.LT(1); if ( (input.LA(1) >= KW_ABORT && input.LA(1) <= KW_AFTER)||input.LA(1)==KW_ALLOC_FRACTION||input.LA(1)==KW_ANALYZE||input.LA(1)==KW_ARCHIVE||(input.LA(1) >= KW_ASC && input.LA(1) <= KW_AST)||(input.LA(1) >= KW_AUTOCOMMIT && input.LA(1) <= KW_BEFORE)||(input.LA(1) >= KW_BUCKET && input.LA(1) <= KW_BUCKETS)||(input.LA(1) >= KW_CACHE && input.LA(1) <= KW_CASCADE)||(input.LA(1) >= KW_CBO && input.LA(1) <= KW_CHANGE)||(input.LA(1) >= KW_CHECK && input.LA(1) <= KW_COLLECTION)||(input.LA(1) >= KW_COLUMNS && input.LA(1) <= KW_COMMENT)||(input.LA(1) >= KW_COMPACT && input.LA(1) <= KW_CONCATENATE)||input.LA(1)==KW_CONTINUE||input.LA(1)==KW_DATA||input.LA(1)==KW_DATABASES||(input.LA(1) >= KW_DATETIME && input.LA(1) <= KW_DEBUG)||(input.LA(1) >= KW_DEFAULT && input.LA(1) <= KW_DEFINED)||(input.LA(1) >= KW_DELIMITED && input.LA(1) <= KW_DESC)||(input.LA(1) >= KW_DETAIL && input.LA(1) <= KW_DISABLE)||(input.LA(1) >= KW_DISTRIBUTE && input.LA(1) <= KW_DO)||input.LA(1)==KW_DOW||(input.LA(1) >= KW_DUMP && input.LA(1) <= KW_ELEM_TYPE)||input.LA(1)==KW_ENABLE||(input.LA(1) >= KW_ENFORCED && input.LA(1) <= KW_ESCAPED)||input.LA(1)==KW_EXCLUSIVE||(input.LA(1) >= KW_EXPLAIN && input.LA(1) <= KW_EXPRESSION)||(input.LA(1) >= KW_FIELDS && input.LA(1) <= KW_FIRST)||(input.LA(1) >= KW_FORMAT && input.LA(1) <= KW_FORMATTED)||input.LA(1)==KW_FUNCTIONS||(input.LA(1) >= KW_HOUR && input.LA(1) <= KW_IDXPROPERTIES)||(input.LA(1) >= KW_INDEX && input.LA(1) <= KW_INDEXES)||(input.LA(1) >= KW_INPATH && input.LA(1) <= KW_INPUTFORMAT)||(input.LA(1) >= KW_ISOLATION && input.LA(1) <= KW_JAR)||(input.LA(1) >= KW_KEY && input.LA(1) <= KW_LAST)||input.LA(1)==KW_LEVEL||(input.LA(1) >= KW_LIMIT && input.LA(1) <= KW_LOAD)||(input.LA(1) >= KW_LOCATION && input.LA(1) <= KW_LONG)||input.LA(1)==KW_MANAGEMENT||(input.LA(1) >= KW_MAPJOIN && input.LA(1) <= KW_MATERIALIZED)||input.LA(1)==KW_METADATA||(input.LA(1) >= KW_MINUTE && input.LA(1) <= KW_MONTH)||(input.LA(1) >= KW_MOVE && input.LA(1) <= KW_MSCK)||(input.LA(1) >= KW_NORELY && input.LA(1) <= KW_NOSCAN)||input.LA(1)==KW_NOVALIDATE||input.LA(1)==KW_NULLS||input.LA(1)==KW_OFFSET||(input.LA(1) >= KW_OPERATOR && input.LA(1) <= KW_OPTION)||(input.LA(1) >= KW_OUTPUTDRIVER && input.LA(1) <= KW_OUTPUTFORMAT)||(input.LA(1) >= KW_OVERWRITE && input.LA(1) <= KW_OWNER)||(input.LA(1) >= KW_PARTITIONED && input.LA(1) <= KW_PATH)||(input.LA(1) >= KW_PLAN && input.LA(1) <= KW_POOL)||input.LA(1)==KW_PRINCIPALS||(input.LA(1) >= KW_PURGE && input.LA(1) <= KW_QUERY_PARALLELISM)||input.LA(1)==KW_READ||(input.LA(1) >= KW_REBUILD && input.LA(1) <= KW_RECORDWRITER)||(input.LA(1) >= KW_RELOAD && input.LA(1) <= KW_RESTRICT)||input.LA(1)==KW_REWRITE||(input.LA(1) >= KW_ROLE && input.LA(1) <= KW_ROLES)||(input.LA(1) >= KW_SCHEDULING_POLICY && input.LA(1) <= KW_SECOND)||(input.LA(1) >= KW_SEMI && input.LA(1) <= KW_SERVER)||(input.LA(1) >= KW_SETS && input.LA(1) <= KW_SKEWED)||(input.LA(1) >= KW_SNAPSHOT && input.LA(1) <= KW_SSL)||(input.LA(1) >= KW_STATISTICS && input.LA(1) <= KW_SUMMARY)||input.LA(1)==KW_TABLES||(input.LA(1) >= KW_TBLPROPERTIES && input.LA(1) <= KW_TERMINATED)||input.LA(1)==KW_TINYINT||(input.LA(1) >= KW_TOUCH && input.LA(1) <= KW_TRANSACTIONS)||input.LA(1)==KW_UNARCHIVE||input.LA(1)==KW_UNDO||input.LA(1)==KW_UNIONTYPE||(input.LA(1) >= KW_UNKNOWN && input.LA(1) <= KW_UNSIGNED)||(input.LA(1) >= KW_URI && input.LA(1) <= KW_USE)||(input.LA(1) >= KW_UTC && input.LA(1) <= KW_VALIDATE)||input.LA(1)==KW_VALUE_TYPE||(input.LA(1) >= KW_VECTORIZATION && input.LA(1) <= KW_WEEK)||input.LA(1)==KW_WHILE||(input.LA(1) >= KW_WORK && input.LA(1) <= KW_ZONE)||input.LA(1)==KW_BATCH||input.LA(1)==KW_DAYOFWEEK||input.LA(1)==KW_HOLD_DDLTIME||input.LA(1)==KW_IGNORE||input.LA(1)==KW_NO_DROP||input.LA(1)==KW_OFFLINE||input.LA(1)==KW_PROTECTION||input.LA(1)==KW_READONLY||input.LA(1)==KW_TIMESTAMPTZ ) { input.consume(); if ( state.backtracking==0 ) adaptor.addChild(root_0, (ASTNode)adaptor.create(set310)); state.errorRecovery=false; state.failed=false; retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.sysFuncNames_return sysFuncNames() throws RecognitionException { HiveParser_IdentifiersParser.sysFuncNames_return retval = new HiveParser_IdentifiersParser.sysFuncNames_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); set300=input.LT(1); if ( (input.LA(1) >= AMPERSAND && input.LA(1) <= BITWISEXOR)||(input.LA(1) >= DIV && input.LA(1) <= DIVIDE)||(input.LA(1) >= EQUAL && input.LA(1) <= EQUAL_NS)||(input.LA(1) >= GREATERTHAN && input.LA(1) <= GREATERTHANOREQUALTO)||input.LA(1)==KW_AND||input.LA(1)==KW_ARRAY||(input.LA(1) >= KW_BETWEEN && input.LA(1) <= KW_BOOLEAN)||input.LA(1)==KW_CASE||input.LA(1)==KW_DOUBLE||(input.LA(1) >= KW_FLOAT && input.LA(1) <= KW_FLOOR)||input.LA(1)==KW_IF||input.LA(1)==KW_IN||input.LA(1)==KW_INT||input.LA(1)==KW_LIKE||input.LA(1)==KW_MAP||input.LA(1)==KW_NOT||input.LA(1)==KW_OR||input.LA(1)==KW_REAL||input.LA(1)==KW_REGEXP||input.LA(1)==KW_RLIKE||input.LA(1)==KW_SMALLINT||(input.LA(1) >= KW_STRING && input.LA(1) <= KW_STRUCT)||input.LA(1)==KW_TINYINT||input.LA(1)==KW_UNIONTYPE||input.LA(1)==KW_WHEN||(input.LA(1) >= LESSTHAN && input.LA(1) <= LESSTHANOREQUALTO)||(input.LA(1) >= MINUS && input.LA(1) <= NOTEQUAL)||input.LA(1)==PLUS||input.LA(1)==STAR||input.LA(1)==TILDE ) { input.consume(); if ( state.backtracking==0 ) adaptor.addChild(root_0, (ASTNode)adaptor.create(set300)); state.errorRecovery=false; state.failed=false; retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.sql11ReservedKeywordsUsedAsFunctionName_return sql11ReservedKeywordsUsedAsFunctionName() throws RecognitionException { HiveParser_IdentifiersParser.sql11ReservedKeywordsUsedAsFunctionName_return retval = new HiveParser_IdentifiersParser.sql11ReservedKeywordsUsedAsFunctionName_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); set311=input.LT(1); if ( input.LA(1)==KW_ARRAY||(input.LA(1) >= KW_BIGINT && input.LA(1) <= KW_BOOLEAN)||(input.LA(1) >= KW_CURRENT_DATE && input.LA(1) <= KW_CURRENT_TIMESTAMP)||input.LA(1)==KW_DATE||input.LA(1)==KW_DOUBLE||input.LA(1)==KW_FLOAT||input.LA(1)==KW_GROUPING||input.LA(1)==KW_IF||input.LA(1)==KW_INT||input.LA(1)==KW_MAP||input.LA(1)==KW_REAL||input.LA(1)==KW_SMALLINT||input.LA(1)==KW_TIMESTAMP ) { input.consume(); if ( state.backtracking==0 ) adaptor.addChild(root_0, (ASTNode)adaptor.create(set311)); state.errorRecovery=false; state.failed=false; retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.precedenceAndOperator_return precedenceAndOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedenceAndOperator_return retval = new HiveParser_IdentifiersParser.precedenceAndOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); KW_AND266_tree = (ASTNode)adaptor.create(KW_AND266); adaptor.addChild(root_0, KW_AND266_tree); retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.dropPartitionOperator_return dropPartitionOperator() throws RecognitionException { HiveParser_IdentifiersParser.dropPartitionOperator_return retval = new HiveParser_IdentifiersParser.dropPartitionOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); set299=input.LT(1); if ( input.LA(1)==EQUAL||(input.LA(1) >= GREATERTHAN && input.LA(1) <= GREATERTHANOREQUALTO)||(input.LA(1) >= LESSTHAN && input.LA(1) <= LESSTHANOREQUALTO)||input.LA(1)==NOTEQUAL ) { input.consume(); if ( state.backtracking==0 ) adaptor.addChild(root_0, (ASTNode)adaptor.create(set299)); state.errorRecovery=false; state.failed=false; retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.precedenceConcatenateOperator_return precedenceConcatenateOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedenceConcatenateOperator_return retval = new HiveParser_IdentifiersParser.precedenceConcatenateOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); CONCATENATE214_tree = (ASTNode)adaptor.create(CONCATENATE214); adaptor.addChild(root_0, CONCATENATE214_tree); retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.precedenceNotOperator_return precedenceNotOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedenceNotOperator_return retval = new HiveParser_IdentifiersParser.precedenceNotOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); KW_NOT263_tree = (ASTNode)adaptor.create(KW_NOT263); adaptor.addChild(root_0, KW_NOT263_tree); retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.precedenceOrOperator_return precedenceOrOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedenceOrOperator_return retval = new HiveParser_IdentifiersParser.precedenceOrOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); KW_OR270_tree = (ASTNode)adaptor.create(KW_OR270); adaptor.addChild(root_0, KW_OR270_tree); retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.precedenceBitwiseXorOperator_return precedenceBitwiseXorOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedenceBitwiseXorOperator_return retval = new HiveParser_IdentifiersParser.precedenceBitwiseXorOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); BITWISEXOR202_tree = (ASTNode)adaptor.create(BITWISEXOR202); adaptor.addChild(root_0, BITWISEXOR202_tree); retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.precedenceAmpersandOperator_return precedenceAmpersandOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedenceAmpersandOperator_return retval = new HiveParser_IdentifiersParser.precedenceAmpersandOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); AMPERSAND217_tree = (ASTNode)adaptor.create(AMPERSAND217); adaptor.addChild(root_0, AMPERSAND217_tree); retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.precedenceBitwiseOrOperator_return precedenceBitwiseOrOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedenceBitwiseOrOperator_return retval = new HiveParser_IdentifiersParser.precedenceBitwiseOrOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); BITWISEOR221_tree = (ASTNode)adaptor.create(BITWISEOR221); adaptor.addChild(root_0, BITWISEOR221_tree); retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final smaliParser.array_descriptor_return array_descriptor() throws RecognitionException { smaliParser.array_descriptor_return retval = new smaliParser.array_descriptor_return(); retval.start = input.LT(1); root_0 = (CommonTree)adaptor.nil(); ARRAY_TYPE_PREFIX100_tree = (CommonTree)adaptor.create(ARRAY_TYPE_PREFIX100); adaptor.addChild(root_0, ARRAY_TYPE_PREFIX100_tree); set101=input.LT(1); if ( input.LA(1)==CLASS_DESCRIPTOR||input.LA(1)==PRIMITIVE_TYPE ) { input.consume(); adaptor.addChild(root_0, (CommonTree)adaptor.create(set101)); state.errorRecovery=false; retval.stop = input.LT(-1); retval.tree = (CommonTree)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop); reportError(re); recover(input,re); retval.tree = (CommonTree)adaptor.errorNode(input, retval.start, input.LT(-1), re);
public final HiveParser_IdentifiersParser.precedenceStarOperator_return precedenceStarOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedenceStarOperator_return retval = new HiveParser_IdentifiersParser.precedenceStarOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); set206=input.LT(1); if ( (input.LA(1) >= DIV && input.LA(1) <= DIVIDE)||input.LA(1)==MOD||input.LA(1)==STAR ) { input.consume(); if ( state.backtracking==0 ) adaptor.addChild(root_0, (ASTNode)adaptor.create(set206)); state.errorRecovery=false; state.failed=false; retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.precedenceUnaryOperator_return precedenceUnaryOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedenceUnaryOperator_return retval = new HiveParser_IdentifiersParser.precedenceUnaryOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); set185=input.LT(1); if ( input.LA(1)==MINUS||input.LA(1)==PLUS||input.LA(1)==TILDE ) { input.consume(); if ( state.backtracking==0 ) adaptor.addChild(root_0, (ASTNode)adaptor.create(set185)); state.errorRecovery=false; state.failed=false; retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.precedenceRegexpOperator_return precedenceRegexpOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedenceRegexpOperator_return retval = new HiveParser_IdentifiersParser.precedenceRegexpOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); set225=input.LT(1); if ( input.LA(1)==KW_LIKE||input.LA(1)==KW_REGEXP||input.LA(1)==KW_RLIKE ) { input.consume(); if ( state.backtracking==0 ) adaptor.addChild(root_0, (ASTNode)adaptor.create(set225)); state.errorRecovery=false; state.failed=false; retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.intervalValue_return intervalValue() throws RecognitionException { HiveParser_IdentifiersParser.intervalValue_return retval = new HiveParser_IdentifiersParser.intervalValue_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); set148=input.LT(1); if ( input.LA(1)==Number||input.LA(1)==StringLiteral ) { input.consume(); if ( state.backtracking==0 ) adaptor.addChild(root_0, (ASTNode)adaptor.create(set148)); state.errorRecovery=false; state.failed=false; retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.precedencePlusOperator_return precedencePlusOperator() throws RecognitionException { HiveParser_IdentifiersParser.precedencePlusOperator_return retval = new HiveParser_IdentifiersParser.precedencePlusOperator_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); set210=input.LT(1); if ( input.LA(1)==MINUS||input.LA(1)==PLUS ) { input.consume(); if ( state.backtracking==0 ) adaptor.addChild(root_0, (ASTNode)adaptor.create(set210)); state.errorRecovery=false; state.failed=false; retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HiveParser_IdentifiersParser.groupByEmpty_return groupByEmpty() throws RecognitionException { HiveParser_IdentifiersParser.groupByEmpty_return retval = new HiveParser_IdentifiersParser.groupByEmpty_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); LPAREN7_tree = (ASTNode)adaptor.create(LPAREN7); adaptor.addChild(root_0, LPAREN7_tree); RPAREN8_tree = (ASTNode)adaptor.create(RPAREN8); adaptor.addChild(root_0, RPAREN8_tree); retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
public final HintParser.hintArgName_return hintArgName() throws RecognitionException { HintParser.hintArgName_return retval = new HintParser.hintArgName_return(); retval.start = input.LT(1); root_0 = (ASTNode)adaptor.nil(); set16=input.LT(1); if ( input.LA(1)==Identifier||input.LA(1)==KW_NONE||input.LA(1)==Number ) { input.consume(); adaptor.addChild(root_0, (ASTNode)adaptor.create(set16)); state.errorRecovery=false; retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop); reportError(re); recover(input,re); retval.tree = (ASTNode)adaptor.errorNode(input, retval.start, input.LT(-1), re);
public final RecordPathParser.filterFunctionNames_return filterFunctionNames() throws RecognitionException { RecordPathParser.filterFunctionNames_return retval = new RecordPathParser.filterFunctionNames_return(); retval.start = input.LT(1); root_0 = (Object)adaptor.nil(); set44=input.LT(1); if ( (input.LA(1) >= CONTAINS && input.LA(1) <= CONTAINS_REGEX)||input.LA(1)==ENDS_WITH||(input.LA(1) >= IS_BLANK && input.LA(1) <= IS_EMPTY)||input.LA(1)==MATCHES_REGEX||input.LA(1)==STARTS_WITH ) { input.consume(); adaptor.addChild(root_0, (Object)adaptor.create(set44)); state.errorRecovery=false; retval.stop = input.LT(-1); retval.tree = (Object)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop); reportError(re); recover(input,re); retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);