#include <mbma_brackets.h>
|
| | BracketNest (CLEX::Type, Compound::Type, int, TiCC::LogStream &) |
| |
| BaseBracket * | append (BaseBracket *) |
| |
| BracketNest * | clone () const |
| |
| | ~BracketNest () |
| |
| bool | isNested () |
| |
| void | clearEmptyNodes () |
| |
| icu::UnicodeString | put (bool=true) const |
| |
| icu::UnicodeString | pretty_put () const |
| |
| bool | testMatch (std::list< BaseBracket * > &result, const std::list< BaseBracket * >::iterator &rpos, std::list< BaseBracket * >::iterator &bpos) |
| |
| std::list< BaseBracket * >::iterator | glue (std::list< BaseBracket * > &, const std::list< BaseBracket * >::iterator &) |
| |
| std::list< BaseBracket * >::iterator | resolveAffix (std::list< BaseBracket * > &, const std::list< BaseBracket * >::iterator &) |
| |
| void | resolveGlue () |
| |
| void | resolveNouns () |
| |
| void | resolveLead () |
| |
| void | resolveTail () |
| |
| void | resolveMiddle () |
| |
| Compound::Type | getCompoundType () |
| |
| CLEX::Type | getFinalTag () |
| |
| folia::Morpheme * | createMorpheme (folia::Document *) const |
| |
| folia::Morpheme * | createMorpheme (folia::Document *, std::string &, int &) const |
| |
| Compound::Type | compound () const |
| |
| | BaseBracket (CLEX::Type t, const std::vector< CLEX::Type > &R, int flag, TiCC::LogStream &l) |
| |
| | BaseBracket (CLEX::Type t, int flag, TiCC::LogStream &l) |
| |
| virtual | ~BaseBracket () |
| |
| Status | status () const |
| |
| void | set_status (const Status s) |
| |
| virtual icu::UnicodeString | morpheme () const |
| |
| virtual std::string | inflection () const |
| |
| virtual std::string | original () const |
| |
| virtual int | infixpos () const |
| |
| virtual bool | isglue () const |
| |
| CLEX::Type | tag () const |
| |
| void | setTag (CLEX::Type t) |
| |
◆ BracketNest()
◆ ~BracketNest()
| BracketNest::~BracketNest |
( |
| ) |
|
◆ append()
append a Bracket structure to this Nest
Reimplemented from BaseBracket.
◆ clearEmptyNodes()
| void BracketNest::clearEmptyNodes |
( |
| ) |
|
|
virtual |
remove all nodes that don't have a morpheme or an inflection
Reimplemented from BaseBracket.
◆ clone()
make a deep copy of the Bracketnest
Implements BaseBracket.
◆ compound()
◆ createMorpheme() [1/2]
| folia::Morpheme * BracketNest::createMorpheme |
( |
folia::Document * |
doc | ) |
const |
|
virtual |
use the data in the Leaf to create a folia::Morpheme node
- Parameters
-
| doc | The FoLiA Document context |
Implements BaseBracket.
◆ createMorpheme() [2/2]
| folia::Morpheme * BracketNest::createMorpheme |
( |
folia::Document * |
doc, |
|
|
std::string & |
desc, |
|
|
int & |
cnt |
|
) |
| const |
|
virtual |
use the data in the Leaf to create a folia::Morpheme node
- Parameters
-
| doc | The FoLiA Document context |
| desc | a decriptien note to add |
| cnt | a counter for the number of handled morphemes |
Implements BaseBracket.
◆ getCompoundType()
◆ getFinalTag()
get the result tag for this rule
◆ glue()
◆ isNested()
| bool BracketNest::isNested |
( |
| ) |
|
|
inlinevirtual |
◆ pretty_put()
| icu::UnicodeString BracketNest::pretty_put |
( |
| ) |
const |
|
virtual |
create a descriptive Unicode string representation for this object
Reimplemented from BaseBracket.
◆ put()
| icu::UnicodeString BracketNest::put |
( |
bool |
full = true | ) |
const |
|
virtual |
create a Unicode string representation for this object
Reimplemented from BaseBracket.
◆ resolveAffix()
try to resolve an Affix rule
- Parameters
-
| result | the output, matches might replace part of it by a new Nest |
| rpos | start posotion for this search |
- Returns
- an iterator where the next resolving step should start
◆ resolveGlue()
| void BracketNest::resolveGlue |
( |
| ) |
|
|
virtual |
◆ resolveLead()
| void BracketNest::resolveLead |
( |
| ) |
|
|
virtual |
resolve rules starting with *
Reimplemented from BaseBracket.
◆ resolveMiddle()
| void BracketNest::resolveMiddle |
( |
| ) |
|
|
virtual |
resolve rules with a * NOT at begin or end
Reimplemented from BaseBracket.
◆ resolveNouns()
| void BracketNest::resolveNouns |
( |
| ) |
|
check for adjacent Nouns and replace by a new Nest
◆ resolveTail()
| void BracketNest::resolveTail |
( |
| ) |
|
|
virtual |
resolve rules ending with *
Reimplemented from BaseBracket.
◆ testMatch()
test if the rule matches at a certain position
- Parameters
-
| result | the current result. A new match will be appended |
| rpos | the position in the rules list we are at. |
| bpos | output parameter to return the END postion of the match |
- Returns
- true if it matches
◆ parts
The documentation for this class was generated from the following files: