docs: public final QueryParser.tagged_return tagged() throws RecognitionException {
          QueryParser.tagged_return retval = new QueryParser.tagged_return();
          retval.start = input.LT(1);
  
          CommonTree root_0 = null;
  
          Token TAGGED75=null;
          Token WS76=null;
          Token String77=null;
  
          CommonTree TAGGED75_tree=null;
          CommonTree WS76_tree=null;
          CommonTree String77_tree=null;
  
          try {
              // src/riemann/Query.g:67:8: ( TAGGED ( WS )* String )
              // src/riemann/Query.g:67:10: TAGGED ( WS )* String
              {
              root_0 = (CommonTree)adaptor.nil();
  
              TAGGED75=(Token)match(input,TAGGED,FOLLOW_TAGGED_in_tagged507); 
              TAGGED75_tree = (CommonTree)adaptor.create(TAGGED75);
              root_0 = (CommonTree)adaptor.becomeRoot(TAGGED75_tree, root_0);
  
              // src/riemann/Query.g:67:18: ( WS )*
              loop29:
              do {
                  int alt29=2;
                  int LA29_0 = input.LA(1);
  
                  if ( (LA29_0==WS) ) {
                      alt29=1;
                  }
  
  
                  switch (alt29) {
              	case 1 :
              	    // src/riemann/Query.g:67:18: WS
              	    {
              	    WS76=(Token)match(input,WS,FOLLOW_WS_in_tagged510); 
              	    WS76_tree = (CommonTree)adaptor.create(WS76);
              	    adaptor.addChild(root_0, WS76_tree);
  
  
              	    }
              	    break;
  
              	default :
              	    break loop29;
                  }
              } while (true);
  
              String77=(Token)match(input,String,FOLLOW_String_in_tagged513); 
              String77_tree = (CommonTree)adaptor.create(String77);
              adaptor.addChild(root_0, String77_tree);
  
  
              }
  
              retval.stop = input.LT(-1);
  
              retval.tree = (CommonTree)adaptor.rulePostProcessing(root_0);
              adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
  
          }
          catch (RecognitionException re) {
              reportError(re);
              recover(input,re);
      	retval.tree = (CommonTree)adaptor.errorNode(input, retval.start, input.LT(-1), re);
  
          }
          finally {
          }
          return retval;
      }