#include <Parser.H>
Collaboration diagram for Parser:

Public Types | |
| enum | SearchStrategy { BottomUp, BestFirst } |
Public Member Functions | |
| Parser (const string &configFile, Grammar *pGrammar=NULL) | |
| virtual | ~Parser () |
| virtual vector< pair< BilexMTree *, SCORE > > | getParse (SentenceTuple &) |
| compute the parse and return the resulting tree | |
| virtual vector< pair< BilexMTree *, SCORE > > | getParse () |
| virtual bool | silentParse (SentenceTuple &) |
| Attempt to achieve the parsing goal but do not compute or return the tree. | |
| virtual void | clear () |
| Clears the parser's state. Note that this does not include the grammar. | |
| virtual void | setGrammar (Grammar *pGrammar) |
| Set the model for the parser. | |
| virtual Grammar * | getGrammar () const |
Protected Member Functions | |
| Parser () | |
| virtual void | initialize (SentenceTuple &) |
| Initializes the parser for new input. | |
| virtual bool | onePassParse () |
| virtual bool | multiPassParse () |
Protected Attributes | |
| Logic * | m_pLogic |
| The reference to the Logic. | |
| Agenda * | m_pAgenda |
| The reference to the Agenda. | |
| Grammar * | m_pGrammar |
| The reference to the grammar. | |
| ParseStats | m_parseStats |
| bool | m_multiPassParse |
| if true, then we use multi-pass parsing | |
Private Member Functions | |
| void | parse () |
| This method kept private to avoid use/redefinition. | |
|
|
|
|
||||||||||||
|
|
Here is the call graph for this function:

|
|
|
Here is the call graph for this function:

|
|
|
|
|
Clears the parser's state. Note that this does not include the grammar. Clears the parser by clearing the contents of its components. The components are still there, not being deleted. The grammar is not cleared. |
Here is the call graph for this function:

|
|
|
|
|
This overloaded version reparses the currently initialized SentenceTuple. This could be useful if, e.g., the grammar is updated. |
Here is the call graph for this function:

|
|
compute the parse and return the resulting tree
|
Here is the call graph for this function:

|
|
Initializes the parser for new input.
|
Here is the call graph for this function:

|
|
Parse, using multiple passes if necessary until the parsing goal is found. Note that if the multiPassParse in the constructor is false, then it is just ordinary parsing. Use the goal.trace() to see which sub-goal is achieved or whether the parsing fails. Whenever the agenda is empty, the parser restarts!!! |
Here is the call graph for this function:

|
|
One pass parsing until the goal is reached or the parsing fails. Use goal.trace() to see which sub-goal is achieved or whether the parsing fails. Whenever the agenda is empty, the parser restarts!!! |
Here is the call graph for this function:

|
|
This method kept private to avoid use/redefinition.
|
|
|
Set the model for the parser.
|
Here is the call graph for this function:

|
|
Attempt to achieve the parsing goal but do not compute or return the tree.
|
Here is the call graph for this function:

|
|
if true, then we use multi-pass parsing
|
|
|
The reference to the Agenda.
|
|
|
|
|
|
The reference to the grammar.
|
|
|
The reference to the Logic.
|
1.4.1