docs: public final QueryParser.not_equal_return not_equal() throws RecognitionException {
          QueryParser.not_equal_return retval = new QueryParser.not_equal_return();
          retval.start = input.LT(1);
  
          CommonTree root_0 = null;
  
          Token WS66=null;
          Token NOT_EQUAL67=null;
          Token WS68=null;
          QueryParser.field_return field65 = null;
  
          QueryParser.value_return value69 = null;
  
  
          CommonTree WS66_tree=null;
          CommonTree NOT_EQUAL67_tree=null;
          CommonTree WS68_tree=null;
  
          try {
              // src/riemann/Query.g:64:2: ( field ( WS )* NOT_EQUAL ( WS )* value )
              // src/riemann/Query.g:64:4: field ( WS )* NOT_EQUAL ( WS )* value
              {
              root_0 = (CommonTree)adaptor.nil();
  
              pushFollow(FOLLOW_field_in_not_equal469);
              field65=field();
  
              state._fsp--;
  
              adaptor.addChild(root_0, field65.getTree());
              // src/riemann/Query.g:64:10: ( WS )*
              loop25:
              do {
                  int alt25=2;
                  int LA25_0 = input.LA(1);
  
                  if ( (LA25_0==WS) ) {
                      alt25=1;
                  }
  
  
                  switch (alt25) {
              	case 1 :
              	    // src/riemann/Query.g:64:10: WS
              	    {
              	    WS66=(Token)match(input,WS,FOLLOW_WS_in_not_equal471); 
              	    WS66_tree = (CommonTree)adaptor.create(WS66);
              	    adaptor.addChild(root_0, WS66_tree);
  
  
              	    }
              	    break;
  
              	default :
              	    break loop25;
                  }
              } while (true);
  
              NOT_EQUAL67=(Token)match(input,NOT_EQUAL,FOLLOW_NOT_EQUAL_in_not_equal474); 
              NOT_EQUAL67_tree = (CommonTree)adaptor.create(NOT_EQUAL67);
              root_0 = (CommonTree)adaptor.becomeRoot(NOT_EQUAL67_tree, root_0);
  
              // src/riemann/Query.g:64:25: ( WS )*
              loop26:
              do {
                  int alt26=2;
                  int LA26_0 = input.LA(1);
  
                  if ( (LA26_0==WS) ) {
                      alt26=1;
                  }
  
  
                  switch (alt26) {
              	case 1 :
              	    // src/riemann/Query.g:64:25: WS
              	    {
              	    WS68=(Token)match(input,WS,FOLLOW_WS_in_not_equal477); 
              	    WS68_tree = (CommonTree)adaptor.create(WS68);
              	    adaptor.addChild(root_0, WS68_tree);
  
  
              	    }
              	    break;
  
              	default :
              	    break loop26;
                  }
              } while (true);
  
              pushFollow(FOLLOW_value_in_not_equal480);
              value69=value();
  
              state._fsp--;
  
              adaptor.addChild(root_0, value69.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;
      }