public final smaliTreeWalker.method_handle_type_return method_handle_type() throws RecognitionException { smaliTreeWalker.method_handle_type_return retval = new smaliTreeWalker.method_handle_type_return(); retval.start = input.LT(1); try { // smaliTreeWalker.g:525:3: ( ( METHOD_HANDLE_TYPE_FIELD | METHOD_HANDLE_TYPE_METHOD | INSTRUCTION_FORMAT35c_METHOD_OR_METHOD_HANDLE_TYPE ) ) // smaliTreeWalker.g:525:5: ( METHOD_HANDLE_TYPE_FIELD | METHOD_HANDLE_TYPE_METHOD | INSTRUCTION_FORMAT35c_METHOD_OR_METHOD_HANDLE_TYPE ) { if ( input.LA(1)==INSTRUCTION_FORMAT35c_METHOD_OR_METHOD_HANDLE_TYPE||(input.LA(1) >= METHOD_HANDLE_TYPE_FIELD && input.LA(1) <= METHOD_HANDLE_TYPE_METHOD) ) { input.consume(); state.errorRecovery=false; } else { MismatchedSetException mse = new MismatchedSetException(null,input); throw mse; } retval.methodHandleType = MethodHandleType.getMethodHandleType(input.getTokenStream().toString(input.getTreeAdaptor().getTokenStartIndex(retval.start),input.getTreeAdaptor().getTokenStopIndex(retval.start))); } } catch (RecognitionException re) { reportError(re); recover(input,re); } finally { // do for sure before leaving } return retval; } // $ANTLR end "method_handle_type"
switch ( input.LA(1) ) { case CLASS_DESCRIPTOR: int LA37_1 = input.LA(2); if ( (LA37_1==UP) ) { alt37=1; int LA37_3 = input.LA(3); if ( (LA37_3==ARRAY_TYPE_PREFIX||LA37_3==CLASS_DESCRIPTOR||LA37_3==PRIMITIVE_TYPE) ) { alt37=2; int LA37_2 = input.LA(2); if ( (LA37_2==PRIMITIVE_TYPE) ) { int LA37_5 = input.LA(3); if ( (LA37_5==SIMPLE_NAME) ) { int LA37_3 = input.LA(4); if ( (LA37_3==ARRAY_TYPE_PREFIX||LA37_3==CLASS_DESCRIPTOR||LA37_3==PRIMITIVE_TYPE) ) { alt37=2; int LA37_6 = input.LA(3); if ( (LA37_6==SIMPLE_NAME) ) { int LA37_3 = input.LA(4); if ( (LA37_3==ARRAY_TYPE_PREFIX||LA37_3==CLASS_DESCRIPTOR||LA37_3==PRIMITIVE_TYPE) ) { alt37=2; int LA37_3 = input.LA(2); if ( (LA37_3==ARRAY_TYPE_PREFIX||LA37_3==CLASS_DESCRIPTOR||LA37_3==PRIMITIVE_TYPE) ) { alt37=2;
int LA42_0 = input.LA(1); if ( (LA42_0==VOID_TYPE) ) { alt42=1; new NoViableAltException("", 42, 0, input); throw nvae;
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);
public final smaliTreeWalker.registers_directive_return registers_directive() throws RecognitionException { smaliTreeWalker.registers_directive_return retval = new smaliTreeWalker.registers_directive_return(); retval.start = input.LT(1); int LA21_0 = input.LA(1); if ( (LA21_0==I_REGISTERS) ) { alt21=1; new NoViableAltException("", 21, 0, input); throw nvae;
switch ( input.LA(1) ) { case VT_OR_PREFIX: default: NoViableAltException nvae = new NoViableAltException("", 30, 0, input); do { int alt27=2; int LA27_0 = input.LA(1); if ( cnt27 >= 1 ) break loop27; EarlyExitException eee = new EarlyExitException(27, input); throw eee; do { int alt28=2; int LA28_0 = input.LA(1); if ( cnt28 >= 1 ) break loop28; EarlyExitException eee = new EarlyExitException(28, input); throw eee; do { int alt29=2; int LA29_0 = input.LA(1);
public final GrammarTreeVisitor.throwsSpec_return throwsSpec() throws RecognitionException { GrammarTreeVisitor.throwsSpec_return retval = new GrammarTreeVisitor.throwsSpec_return(); retval.start = input.LT(1); while (true) { int alt23=2; int LA23_0 = input.LA(1); if ( (LA23_0==ID) ) { alt23=1; EarlyExitException eee = new EarlyExitException(23, input); throw eee;
public final void ruleModifier() throws RecognitionException { try { // org/antlr/v4/parse/LeftRecursiveRuleWalker.g:96:5: ( PUBLIC | PRIVATE | PROTECTED ) // org/antlr/v4/parse/LeftRecursiveRuleWalker.g: { if ( (input.LA(1) >= PRIVATE && input.LA(1) <= PUBLIC) ) { input.consume(); state.errorRecovery=false; state.failed=false; } else { if (state.backtracking>0) {state.failed=true; return;} MismatchedSetException mse = new MismatchedSetException(null,input); throw mse; } } } finally { // do for sure before leaving } } // $ANTLR end "ruleModifier"
public final smaliTreeWalker.register_range_return register_range() throws RecognitionException { smaliTreeWalker.register_range_return retval = new smaliTreeWalker.register_range_return(); retval.start = input.LT(1); if ( input.LA(1)==Token.DOWN ) { match(input, Token.DOWN, null); int LA36_0 = input.LA(1); if ( (LA36_0==REGISTER) ) { alt36=1; int LA35_0 = input.LA(1); if ( (LA35_0==REGISTER) ) { alt35=1;
public final ANTLRTreePrinter.modifier_return modifier() throws RecognitionException { ANTLRTreePrinter.modifier_return retval = new ANTLRTreePrinter.modifier_return(); retval.start = input.LT(1); out(((GrammarAST)retval.start).getText()); out(" "); try { // org/antlr/grammar/v3/ANTLRTreePrinter.g:282:2: ( 'protected' | 'public' | 'private' | 'fragment' ) // org/antlr/grammar/v3/ANTLRTreePrinter.g: { if ( input.LA(1)==FRAGMENT||(input.LA(1) >= PRIVATE && input.LA(1) <= PUBLIC) ) { input.consume(); state.errorRecovery=false; } else { MismatchedSetException mse = new MismatchedSetException(null,input); throw mse; } } } catch (RecognitionException re) { reportError(re); recover(input,re); } finally { // do for sure before leaving } return retval; } // $ANTLR end "modifier"
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;
public final smaliTreeWalker.reference_type_descriptor_return reference_type_descriptor() throws RecognitionException { smaliTreeWalker.reference_type_descriptor_return retval = new smaliTreeWalker.reference_type_descriptor_return(); retval.start = input.LT(1); int LA41_0 = input.LA(1); if ( (LA41_0==CLASS_DESCRIPTOR) ) { alt41=1; new NoViableAltException("", 41, 0, input); throw nvae;
int LA8_0 = input.LA(1); if ( (LA8_0==I_FIELD_INITIAL_VALUE) ) { alt8=1; new NoViableAltException("", 8, 0, input); throw nvae;
switch ( input.LA(1) ) { case DOUBLE_PIPE: do { int alt38=2; int LA38_0 = input.LA(1); int LA39_0 = input.LA(1); do { int alt40=2; int LA40_0 = input.LA(1); int LA41_0 = input.LA(1); int LA42_0 = input.LA(1); int LA43_0 = input.LA(1); int LA44_0 = input.LA(1); int LA45_0 = input.LA(1); do { int alt46=2; int LA46_0 = input.LA(1);
switch ( input.LA(1) ) { case CLASS_DESCRIPTOR: int LA18_1 = input.LA(2); if ( (LA18_1==SIMPLE_NAME) ) { int LA18_3 = input.LA(3); if ( (LA18_3==ARRAY_TYPE_PREFIX||LA18_3==CLASS_DESCRIPTOR||LA18_3==PRIMITIVE_TYPE) ) { alt18=1; case ARRAY_TYPE_PREFIX: int LA18_2 = input.LA(2); if ( (LA18_2==PRIMITIVE_TYPE) ) { int LA18_4 = input.LA(3); if ( (LA18_4==SIMPLE_NAME) ) { int LA18_3 = input.LA(4); if ( (LA18_3==ARRAY_TYPE_PREFIX||LA18_3==CLASS_DESCRIPTOR||LA18_3==PRIMITIVE_TYPE) ) { alt18=1; int LA18_5 = input.LA(3); if ( (LA18_5==SIMPLE_NAME) ) { int LA18_3 = input.LA(4); if ( (LA18_3==ARRAY_TYPE_PREFIX||LA18_3==CLASS_DESCRIPTOR||LA18_3==PRIMITIVE_TYPE) ) { alt18=1; int LA18_3 = input.LA(2); if ( (LA18_3==ARRAY_TYPE_PREFIX||LA18_3==CLASS_DESCRIPTOR||LA18_3==PRIMITIVE_TYPE) ) { alt18=1;
public final GrammarTreeVisitor.tokensSpec_return tokensSpec() throws RecognitionException { GrammarTreeVisitor.tokensSpec_return retval = new GrammarTreeVisitor.tokensSpec_return(); retval.start = input.LT(1); while (true) { int alt8=2; int LA8_0 = input.LA(1); if ( (LA8_0==ID) ) { alt8=1; EarlyExitException eee = new EarlyExitException(8, input); throw eee;
public final void ruleModifier() throws RecognitionException { try { // org\\antlr\\v4\\parse\\LeftRecursiveRuleWalker.g:72:5: ( PUBLIC | PRIVATE | PROTECTED ) // org\\antlr\\v4\\parse\\LeftRecursiveRuleWalker.g: { if ( (input.LA(1) >= PRIVATE && input.LA(1) <= PUBLIC) ) { input.consume(); state.errorRecovery=false; state.failed=false; } else { if (state.backtracking>0) {state.failed=true; return;} MismatchedSetException mse = new MismatchedSetException(null,input); throw mse; } } } finally { // do for sure before leaving } } // $ANTLR end "ruleModifier"
public final smaliTreeWalker.register_list_return register_list() throws RecognitionException { smaliTreeWalker.register_list_return retval = new smaliTreeWalker.register_list_return(); retval.start = input.LT(1); if ( input.LA(1)==Token.DOWN ) { match(input, Token.DOWN, null); while (true) { int alt34=2; int LA34_0 = input.LA(1); if ( (LA34_0==REGISTER) ) { alt34=1;
public final ANTLRTreePrinter.modifier_return modifier() throws RecognitionException { ANTLRTreePrinter.modifier_return retval = new ANTLRTreePrinter.modifier_return(); retval.start = input.LT(1); out(((GrammarAST)retval.start).getText()); out(" "); try { // org/antlr/grammar/v3/ANTLRTreePrinter.g:282:2: ( 'protected' | 'public' | 'private' | 'fragment' ) // org/antlr/grammar/v3/ANTLRTreePrinter.g: { if ( input.LA(1)==FRAGMENT||(input.LA(1) >= PRIVATE && input.LA(1) <= PUBLIC) ) { input.consume(); state.errorRecovery=false; } else { MismatchedSetException mse = new MismatchedSetException(null,input); throw mse; } } } catch (RecognitionException re) { reportError(re); recover(input,re); } finally { // do for sure before leaving } return retval; } // $ANTLR end "modifier"