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.

79 lines
1.7 KiB

//
// parser.h
//
// parser: Parses a boolean expression tree, retrieving and scoring
// the resulting document list
//
// 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: parser.h,v 1.18 2004/05/28 13:15:25 lha Exp $
//
#ifndef _parser_h_
#define _parser_h_
#include "htsearch.h"
#include "WeightWord.h"
#include "ResultList.h"
#include "DocMatch.h"
#include "Database.h"
#include "htString.h"
#include "Stack.h"
#include "HtWordList.h"
#include <ctype.h>
class Collection;
class Parser
{
public:
Parser();
int checkSyntax(List *);
void parse(List *, ResultList &);
// void setDatabase(const String& db) { words.Open(db, O_RDONLY); }
void setCollection(Collection *collection);
char *getErrorMessage() {return error.get();}
int hadError() {return valid == 0;}
protected:
void fullexpr(int);
int lexan();
void phrase(int);
void expr(int);
void term(int);
void factor(int);
int match(int);
void setError(char *);
void perform_push();
void perform_and();
void perform_not();
void perform_or();
void perform_phrase(List * &);
void score(List *, double weight, unsigned int flags);
List *tokens;
List *result;
WeightWord *current;
int lookahead;
int valid;
Stack stack;
String error;
Collection *collection; // Multiple database support
HtWordList words;
};
extern StringList boolean_keywords;
enum KeywordIndices { AND, OR, NOT };
#endif