docs: public final QueryParser.lesser_equal_return lesser_equal() throws RecognitionException {
          QueryParser.lesser_equal_return retval = new QueryParser.lesser_equal_return();
          retval.start = input.LT(1);
  
          CommonTree root_0 = null;
  
          Token WS51=null;
          Token LESSER_EQUAL52=null;
          Token WS53=null;
          QueryParser.field_return field50 = null;
  
          QueryParser.value_return value54 = null;
  
  
          CommonTree WS51_tree=null;
          CommonTree LESSER_EQUAL52_tree=null;
          CommonTree WS53_tree=null;
  
          try {
              // src/riemann/Query.g:59:2: ( field ( WS )* LESSER_EQUAL ( WS )* value )
              // src/riemann/Query.g:59:4: field ( WS )* LESSER_EQUAL ( WS )* value
              {
              root_0 = (CommonTree)adaptor.nil();
  
              pushFollow(FOLLOW_field_in_lesser_equal413);
              field50=field();
  
              state._fsp--;
  
              adaptor.addChild(root_0, field50.getTree());
              // src/riemann/Query.g:59:10: ( WS )*
              loop19:
              do {
                  int alt19=2;
                  int LA19_0 = input.LA(1);
  
                  if ( (LA19_0==WS) ) {
                      alt19=1;
                  }
  
  
                  switch (alt19) {
              	case 1 :
              	    // src/riemann/Query.g:59:10: WS
              	    {
              	    WS51=(Token)match(input,WS,FOLLOW_WS_in_lesser_equal415); 
              	    WS51_tree = (CommonTree)adaptor.create(WS51);
              	    adaptor.addChild(root_0, WS51_tree);
  
  
              	    }
              	    break;
  
              	default :
              	    break loop19;
                  }
              } while (true);
  
              LESSER_EQUAL52=(Token)match(input,LESSER_EQUAL,FOLLOW_LESSER_EQUAL_in_lesser_equal418); 
              LESSER_EQUAL52_tree = (CommonTree)adaptor.create(LESSER_EQUAL52);
              root_0 = (CommonTree)adaptor.becomeRoot(LESSER_EQUAL52_tree, root_0);
  
              // src/riemann/Query.g:59:28: ( WS )*
              loop20:
              do {
                  int alt20=2;
                  int LA20_0 = input.LA(1);
  
                  if ( (LA20_0==WS) ) {
                      alt20=1;
                  }
  
  
                  switch (alt20) {
              	case 1 :
              	    // src/riemann/Query.g:59:28: WS
              	    {
              	    WS53=(Token)match(input,WS,FOLLOW_WS_in_lesser_equal421); 
              	    WS53_tree = (CommonTree)adaptor.create(WS53);
              	    adaptor.addChild(root_0, WS53_tree);
  
  
              	    }
              	    break;
  
              	default :
              	    break loop20;
                  }
              } while (true);
  
              pushFollow(FOLLOW_value_in_lesser_equal424);
              value54=value();
  
              state._fsp--;
  
              adaptor.addChild(root_0, value54.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;
      }