Parser.H

Go to the documentation of this file.

#ifndef _Parser_H_
#define _Parser_H_

#include "MazMemPool.H"
#include "Timer.H"
#include "ParseStats.H"

#include "Grammar.H"
#include "Logic.H"

class Logic;
class Agenda;

using namespace std;

class Parser : public Dbug {

public:

  enum SearchStrategy {BottomUp, BestFirst};

  // Constructor with a config file.
  Parser(const string& configFile, Grammar* pGrammar = NULL);

  // the grammar is not deleted. You need to delete the 
  // grammar outside Parser.
  virtual ~Parser();

  virtual vector<pair<BilexMTree*, SCORE> > getParse(SentenceTuple&);
  virtual vector<pair<BilexMTree*, SCORE> > getParse();

  // This is useful in cases where some parent process needs info
  // about some subparses, but not necessarily the whole tree.
  // \return bool whether the goal has been reached
  virtual bool silentParse(SentenceTuple&);

//   /// Exports the parsing statistics.
//   virtual ParseStats getStats() const;

  virtual void clear();

  // configure the parser.

  virtual void setGrammar(Grammar* pGrammar);
  virtual Grammar* getGrammar() const;

 protected: // methods

  // no default constructor from outside
  Parser()  {}

  virtual void initialize(SentenceTuple&);

  virtual bool onePassParse();

  /* multiPassParse is a backoff technique that is used when parser fails
     to find a parse tree with sufficiently high probability within a
     sufficiently short time period.  It involves making use of
     partial parses for the sentence tuple and backing off to a
     simpler smoothing model.
  */
  virtual bool multiPassParse();

 private:

  void parse()
  {
    cerr << "Please use either getParse() or silentParse() to avoid confusion." << endl;
    exit(1);
  }
  
 protected:  // components

  Logic* m_pLogic;

  Agenda* m_pAgenda;

  Grammar* m_pGrammar;

  // diagnostic info
  ParseStats m_parseStats;

 protected:  // configuration variables

  bool m_multiPassParse;

};

#endif

---