You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
48 lines
1.0 KiB
48 lines
1.0 KiB
#ifndef _GParser_h_
|
|
#define _GParser_h_
|
|
|
|
//
|
|
// GParser.h
|
|
//
|
|
// GParser: An alternate boolean parser, does not use operator precedence.
|
|
// -- but why is it called G? :-)
|
|
//
|
|
// Part of the ht://Dig package <http://www.htdig.org/>
|
|
// Copyright (c) 1995-2004 The ht://Dig Group
|
|
// For copyright details, see the file COPYING in your distribution
|
|
// or the GNU Library General Public License (LGPL) version 2 or later
|
|
// <http://www.gnu.org/copyleft/lgpl.html>
|
|
//
|
|
// $Id: GParser.h,v 1.4 2004/05/28 13:15:24 lha Exp $
|
|
//
|
|
|
|
#include "QueryParser.h"
|
|
#include "BooleanLexer.h"
|
|
|
|
class OperatorQuery;
|
|
|
|
class GParser : public QueryParser
|
|
{
|
|
public:
|
|
GParser() {}
|
|
~GParser() {}
|
|
|
|
private:
|
|
// apply the single-level syntax
|
|
Query *ParseExpression();
|
|
|
|
// apply the factor syntax
|
|
Query *ParseFactor();
|
|
|
|
// return the adequate operator for an operator keyword
|
|
OperatorQuery *MakeOperatorQuery(const String &op) const;
|
|
|
|
// give the parent access to the lexical analyzer
|
|
QueryLexer &Token() { return token; }
|
|
|
|
// the lexer
|
|
BooleanLexer token;
|
|
};
|
|
|
|
#endif
|