docs: public final QueryParser.greater_equal_return greater_equal() throws RecognitionException {
          QueryParser.greater_equal_return retval = new QueryParser.greater_equal_return();
          retval.start = input.LT(1);
  
          CommonTree root_0 = null;
  
          Token WS61=null;
          Token GREATER_EQUAL62=null;
          Token WS63=null;
          QueryParser.field_return field60 = null;
  
          QueryParser.value_return value64 = null;
  
  
          CommonTree WS61_tree=null;
          CommonTree GREATER_EQUAL62_tree=null;
          CommonTree WS63_tree=null;
  
          try {
              // src/riemann/Query.g:62:2: ( field ( WS )* GREATER_EQUAL ( WS )* value )
              // src/riemann/Query.g:62:4: field ( WS )* GREATER_EQUAL ( WS )* value
              {
              root_0 = (CommonTree)adaptor.nil();
  
              pushFollow(FOLLOW_field_in_greater_equal450);
              field60=field();
  
              state._fsp--;
  
              adaptor.addChild(root_0, field60.getTree());
              // src/riemann/Query.g:62:10: ( WS )*
              loop23:
              do {
                  int alt23=2;
                  int LA23_0 = input.LA(1);
  
                  if ( (LA23_0==WS) ) {
                      alt23=1;
                  }
  
  
                  switch (alt23) {
              	case 1 :
              	    // src/riemann/Query.g:62:10: WS
              	    {
              	    WS61=(Token)match(input,WS,FOLLOW_WS_in_greater_equal452); 
              	    WS61_tree = (CommonTree)adaptor.create(WS61);
              	    adaptor.addChild(root_0, WS61_tree);
  
  
              	    }
              	    break;
  
              	default :
              	    break loop23;
                  }
              } while (true);
  
              GREATER_EQUAL62=(Token)match(input,GREATER_EQUAL,FOLLOW_GREATER_EQUAL_in_greater_equal455); 
              GREATER_EQUAL62_tree = (CommonTree)adaptor.create(GREATER_EQUAL62);
              root_0 = (CommonTree)adaptor.becomeRoot(GREATER_EQUAL62_tree, root_0);
  
              // src/riemann/Query.g:62:29: ( WS )*
              loop24:
              do {
                  int alt24=2;
                  int LA24_0 = input.LA(1);
  
                  if ( (LA24_0==WS) ) {
                      alt24=1;
                  }
  
  
                  switch (alt24) {
              	case 1 :
              	    // src/riemann/Query.g:62:29: WS
              	    {
              	    WS63=(Token)match(input,WS,FOLLOW_WS_in_greater_equal458); 
              	    WS63_tree = (CommonTree)adaptor.create(WS63);
              	    adaptor.addChild(root_0, WS63_tree);
  
  
              	    }
              	    break;
  
              	default :
              	    break loop24;
                  }
              } while (true);
  
              pushFollow(FOLLOW_value_in_greater_equal461);
              value64=value();
  
              state._fsp--;
  
              adaptor.addChild(root_0, value64.getTree());
  
              }
  
              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;
      }