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.
53 lines
1.2 KiB
53 lines
1.2 KiB
#ifndef _SimpleQueryParser_h_
|
|
#define _SimpleQueryParser_h_
|
|
|
|
//
|
|
// SimpleQueryParser.h
|
|
//
|
|
// SimpleQueryParser: (abstract) a family of parsers that generate queries
|
|
// for strings with the syntax (word|phrase){(word|phrase)}
|
|
// combining them in a single operator.
|
|
// The operator to apply is tbd by concrete classes.
|
|
//
|
|
// 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: SimpleQueryParser.h,v 1.4 2004/05/28 13:15:24 lha Exp $
|
|
//
|
|
|
|
#include "QueryParser.h"
|
|
#include "SimpleLexer.h"
|
|
|
|
// abstract
|
|
class OperatorQuery;
|
|
|
|
class SimpleQueryParser : public QueryParser
|
|
{
|
|
public:
|
|
virtual ~SimpleQueryParser() {}
|
|
|
|
protected:
|
|
SimpleQueryParser() {}
|
|
|
|
// get a combination query
|
|
virtual OperatorQuery *MakeQuery() = 0;
|
|
|
|
private:
|
|
// apply expr == term { term }
|
|
Query *ParseExpression();
|
|
|
|
// apply term == word | phrase
|
|
Query *ParseTerm();
|
|
|
|
// let the parent access the lexer
|
|
QueryLexer &Token() { return token; }
|
|
|
|
// the used lexer
|
|
SimpleLexer token;
|
|
};
|
|
|
|
#endif
|