while (true) { int alt28=3; int LA28_0 = input.LA(1); if ( (LA28_0=='\\') ) { alt28=1; if ( (input.LA(1) >= '\u0000' && input.LA(1) <= '\b')||(input.LA(1) >= '\u000B' && input.LA(1) <= '\f')||(input.LA(1) >= '\u000E' && input.LA(1) <= '\u001F')||(input.LA(1) >= '!' && input.LA(1) <= '\'')||(input.LA(1) >= '*' && input.LA(1) <= '9')||(input.LA(1) >= '<' && input.LA(1) <= '[')||(input.LA(1) >= ']' && input.LA(1) <= '\uFFFF') ) { input.consume(); MismatchedSetException mse = new MismatchedSetException(null,input); recover(mse); throw mse; EarlyExitException eee = new EarlyExitException(28, input); throw eee;
do { int alt5=2; int LA5_0 = input.LA(1); if ( cnt5 >= 1 ) break loop5; EarlyExitException eee = new EarlyExitException(5, input); throw eee;
public final smaliParser.param_list_or_id_return param_list_or_id() throws RecognitionException { smaliParser.param_list_or_id_return retval = new smaliParser.param_list_or_id_return(); retval.start = input.LT(1); root_0 = (CommonTree)adaptor.nil(); while (true) { int alt9=2; int LA9_0 = input.LA(1); if ( (LA9_0==PARAM_LIST_OR_ID_PRIMITIVE_TYPE) ) { alt9=1; adaptor.addChild(root_0, PARAM_LIST_OR_ID_PRIMITIVE_TYPE43_tree); EarlyExitException eee = new EarlyExitException(9, input); throw eee; 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);
do { int alt3=2; int LA3_0 = input.LA(1); if ( cnt3 >= 1 ) break loop3; EarlyExitException eee = new EarlyExitException(3, input); throw eee;
EarlyExitException eee = new EarlyExitException(21, input); throw eee; EarlyExitException eee = new EarlyExitException(22, input); throw eee; EarlyExitException eee = new EarlyExitException(23, input); throw eee; EarlyExitException eee = new EarlyExitException(24, input); throw eee; EarlyExitException eee = new EarlyExitException(25, input); throw eee; EarlyExitException eee = new EarlyExitException(26, input); throw eee; EarlyExitException eee = new EarlyExitException(27, input); throw eee; EarlyExitException eee = new EarlyExitException(28, input); throw eee; EarlyExitException eee = new EarlyExitException(30, input); throw eee; EarlyExitException eee = new EarlyExitException(31, input); throw eee;
while (true) { int alt1=2; int LA1_0 = input.LA(1); if ( (LA1_0==97||LA1_0==100||(LA1_0 >= 103 && LA1_0 <= 104)||(LA1_0 >= 107 && LA1_0 <= 108)||(LA1_0 >= 111 && LA1_0 <= 112)||(LA1_0 >= 121 && LA1_0 <= 123)||LA1_0==126||LA1_0==132||(LA1_0 >= 137 && LA1_0 <= 139)||(LA1_0 >= 141 && LA1_0 <= 142)) ) { alt1=1; EarlyExitException eee = new EarlyExitException(1, input); throw eee; while (true) { int alt2=3; int LA2_0 = input.LA(1); if ( (LA2_0==92) ) { alt2=1; while (true) { int alt3=3; int LA3_0 = input.LA(1); if ( (LA3_0==118) ) { alt3=1;
public final smaliParser.param_list_return param_list() throws RecognitionException { smaliParser.param_list_return retval = new smaliParser.param_list_return(); retval.start = input.LT(1); int LA14_0 = input.LA(1); if ( (LA14_0==PARAM_LIST_OR_ID_PRIMITIVE_TYPE) ) { alt14=1; root_0 = (CommonTree)adaptor.nil(); state._fsp--; adaptor.addChild(root_0, param_list_or_id_primitive_type98.getTree()); EarlyExitException eee = new EarlyExitException(12, input); throw eee; root_0 = (CommonTree)adaptor.nil(); state._fsp--; adaptor.addChild(root_0, nonvoid_type_descriptor99.getTree()); retval.stop = input.LT(-1); retval.tree = (CommonTree)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
while (true) { int alt32=3; int LA32_0 = input.LA(1); if ( (LA32_0=='\\') ) { alt32=1; if ( (input.LA(1) >= '\u0000' && input.LA(1) <= '\b')||(input.LA(1) >= '\u000B' && input.LA(1) <= '\f')||(input.LA(1) >= '\u000E' && input.LA(1) <= '\u001F')||(input.LA(1) >= '!' && input.LA(1) <= '\'')||(input.LA(1) >= '*' && input.LA(1) <= '9')||(input.LA(1) >= '<' && input.LA(1) <= '[')||(input.LA(1) >= ']' && input.LA(1) <= '\uFFFF') ) { input.consume(); MismatchedSetException mse = new MismatchedSetException(null,input); recover(mse); throw mse; EarlyExitException eee = new EarlyExitException(32, input); throw eee;
do { int alt5=2; int LA5_0 = input.LA(1); if ( cnt5 >= 1 ) break loop5; EarlyExitException eee = new EarlyExitException(5, input); throw eee; int LA6_0 = input.LA(1);
int LA142_0 = input.LA(1); if ( (LA142_0==CASE) ) { int LA142_1 = input.LA(2); if ( (LA142_1==ARRAY||LA142_1==BIND_NAME||(LA142_1 >= CASE && LA142_1 <= CAST)||LA142_1==CURRENT||LA142_1==DECIMAL||LA142_1==DOUBLE||LA142_1==FALSE||(LA142_1 >= LONG && LA142_1 <= LPAREN)||LA142_1==MINUS||(LA142_1 >= NAME && LA142_1 <= NEXT)||LA142_1==NULL||LA142_1==NUMBER||LA142_1==QUESTION||LA142_1==STRING_LITERAL||LA142_1==TRUE) ) { alt142=1; while (true) { int alt138=2; int LA138_0 = input.LA(1); if ( (LA138_0==WHEN) ) { alt138=1; if ( cnt138 >= 1 ) break loop138; if (state.backtracking>0) {state.failed=true; return ret;} EarlyExitException eee = new EarlyExitException(138, input); throw eee; if ( cnt140 >= 1 ) break loop140; if (state.backtracking>0) {state.failed=true; return ret;} EarlyExitException eee = new EarlyExitException(140, input); throw eee;
while (true) { int alt54=2; int LA54_0 = input.LA(1); if ( (LA54_0=='[') ) { alt54=1; EarlyExitException eee = new EarlyExitException(54, input); throw eee; while (true) { int alt55=2; int LA55_0 = input.LA(1); if ( (LA55_0=='[') ) { alt55=1; EarlyExitException eee = new EarlyExitException(55, input); throw eee;
public final ProtoParser.parse_return parse(Proto proto) throws RecognitionException { ProtoParser.parse_return retval = new ProtoParser.parse_return(); retval.start = input.LT(1); root_0 = (Object)adaptor.nil(); while (true) { int alt1=2; int LA1_0 = input.LA(1); if ( (LA1_0==AT||LA1_0==DOC||LA1_0==ENUM||LA1_0==EXTEND||LA1_0==IMPORT||LA1_0==MESSAGE||LA1_0==OPTION||LA1_0==PKG||LA1_0==SERVICE||LA1_0==SYNTAX) ) { alt1=1; state._fsp--; if (state.failed) return retval; if ( state.backtracking==0 ) adaptor.addChild(root_0, statement1.getTree()); if ( cnt1 >= 1 ) break loop1; if (state.backtracking>0) {state.failed=true; return retval;} EarlyExitException eee = new EarlyExitException(1, input); throw eee; 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);
if ( input.LA(1)=='E'||input.LA(1)=='e' ) { input.consume(); MismatchedSetException mse = new MismatchedSetException(null,input); recover(mse); throw mse; int LA25_0 = input.LA(1); if ( (LA25_0=='+'||LA25_0=='-') ) { alt25=1; if ( input.LA(1)=='+'||input.LA(1)=='-' ) { input.consume(); MismatchedSetException mse = new MismatchedSetException(null,input); recover(mse); throw mse; if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) { input.consume(); MismatchedSetException mse = new MismatchedSetException(null,input); recover(mse); throw mse; EarlyExitException eee = new EarlyExitException(26, input); throw eee;
int LA20_0 = input.LA(1); do { int alt21=2; int LA21_0 = input.LA(1); if ( cnt21 >= 1 ) break loop21; EarlyExitException eee = new EarlyExitException(21, input); throw eee;
int LA209_0 = input.LA(1); if ( (LA209_0==CASE) ) { int LA209_1 = input.LA(2); if ( (LA209_1==ARRAY||LA209_1==BIND_NAME||(LA209_1 >= CASE && LA209_1 <= CAST)||LA209_1==CURRENT||LA209_1==DECIMAL||LA209_1==DOUBLE||LA209_1==EXISTS||LA209_1==FALSE||LA209_1==LPAREN||LA209_1==MINUS||(LA209_1 >= NAME && LA209_1 <= NEXT)||(LA209_1 >= NOT && LA209_1 <= NULL)||LA209_1==NUMBER||LA209_1==QUESTION||LA209_1==STRING_LITERAL||LA209_1==TRUE) ) { alt209=1; while (true) { int alt205=2; int LA205_0 = input.LA(1); if ( (LA205_0==WHEN) ) { alt205=1; if ( cnt205 >= 1 ) break loop205; if (state.backtracking>0) {state.failed=true; return ret;} EarlyExitException eee = new EarlyExitException(205, input); throw eee; if ( cnt207 >= 1 ) break loop207; if (state.backtracking>0) {state.failed=true; return ret;} EarlyExitException eee = new EarlyExitException(207, input); throw eee;
while (true) { int alt1=2; int LA1_0 = input.LA(1); if ( (LA1_0=='.') ) { alt1=1; EarlyExitException eee = new EarlyExitException(1, input); throw eee;
public final HiveParser_FromClauseParser.fromSource_return fromSource() throws RecognitionException { HiveParser_FromClauseParser.fromSource_return retval = new HiveParser_FromClauseParser.fromSource_return(); retval.start = input.LT(1); int LA5_0 = input.LA(1); if ( (LA5_0==KW_UNIQUEJOIN) ) { alt5=1; root_0 = (ASTNode)adaptor.nil(); state._fsp--; if (state.failed) return retval; if ( state.backtracking==0 ) adaptor.addChild(root_0, uniqueJoinSource15.getTree()); state._fsp--; if (state.failed) return retval; if ( state.backtracking==0 ) adaptor.addChild(root_0, uniqueJoinSource17.getTree()); if ( cnt4 >= 1 ) break loop4; if (state.backtracking>0) {state.failed=true; return retval;} EarlyExitException eee = new EarlyExitException(4, input); throw eee; root_0 = (ASTNode)adaptor.nil(); retval.stop = input.LT(-1); retval.tree = (ASTNode)adaptor.rulePostProcessing(root_0); adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
while (true) { int alt31=2; int LA31_0 = input.LA(1); if ( ((LA31_0 >= '-' && LA31_0 <= '.')||(LA31_0 >= '0' && LA31_0 <= ':')||(LA31_0 >= 'A' && LA31_0 <= 'Z')||LA31_0=='_'||(LA31_0 >= 'a' && LA31_0 <= 'z')) ) { alt31=1; if ( (input.LA(1) >= '-' && input.LA(1) <= '.')||(input.LA(1) >= '0' && input.LA(1) <= ':')||(input.LA(1) >= 'A' && input.LA(1) <= 'Z')||input.LA(1)=='_'||(input.LA(1) >= 'a' && input.LA(1) <= 'z') ) { input.consume(); MismatchedSetException mse = new MismatchedSetException(null,input); recover(mse); throw mse; EarlyExitException eee = new EarlyExitException(31, input); throw eee;
do { int alt48=2; int LA48_0 = input.LA(1); if ( cnt48 >= 1 ) break loop48; EarlyExitException eee = new EarlyExitException(48, input); throw eee; do { int alt49=2; int LA49_0 = input.LA(1);
do { int alt17=2; int LA17_0 = input.LA(1); if (state.backtracking>0) {state.failed=true; return ;} EarlyExitException eee = new EarlyExitException(17, input); throw eee;