|
Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
Namespaces | |
| namespace | convert |
| namespace | simplify |
Data Structures | |
| class | FormalRTE |
| Formal regular tree expression represents regular tree expression. It describes regular tree languages. The expression consists of the following nodes: More... | |
| class | FormalRTEAlternation |
| Represents the alternation operator in the regular tree expression. The node must have exactly two children. More... | |
| class | FormalRTEElement |
| class | FormalRTEEmpty |
| Represents the empty expression in the regular tree expression. The node can't have any children. More... | |
| class | FormalRTEIteration |
| Represents the iteration operator in the regular tree expression. The node has exactly one child. More... | |
| class | FormalRTEStructure |
| Represents unbounded regular expression structure. Regular expression is stored as a tree of UnboundedRegExpElements. More... | |
| class | FormalRTESubstitution |
| Represents the concatenation operator in the regular tree expression. The node must have exactly two children. More... | |
| class | FormalRTESymbol |
| Represents the common part of SubstitutionSymbol and TerminalSymbol. More... | |
| class | FormalRTESymbolAlphabet |
| Represents the terminal symbol in the regular tree expression. The number of children must be the same as the arity of the symbol of the node. More... | |
| class | FormalRTESymbolSubst |
| Represents the substitution symbol in the regular tree expression. The node can't have any children. More... | |
| class | GlushkovFirst |
| class | GlushkovFollow |
| class | GlushkovFollowNaive |
| class | GlushkovIndexate |
| class | GlushkovPos |
| class | RTEFromStringLexer |
| class | RTEFromXmlParser |
| class | RTEToXmlComposer |
Typedefs | |
| template<class SymbolType > | |
| using | TFollowTuple = ext::vector< ext::set< common::ranked_symbol< ext::pair< SymbolType, unsigned > > > > |
| template<class SymbolType > | |
| using | TSetOfSymbols = ext::set< common::ranked_symbol< ext::pair< SymbolType, unsigned > > > |
| template<class SymbolType > | |
| using | TSubstMap = ext::map< common::ranked_symbol< ext::pair< SymbolType, unsigned > >, TSetOfSymbols< SymbolType > > |
| template<class SymbolType > | |
| using | TFollowMap = ext::map< common::ranked_symbol< ext::pair< SymbolType, unsigned > >, TFollowTuple< SymbolType > > |
| using rte::TFollowMap = typedef ext::map < common::ranked_symbol < ext::pair < SymbolType, unsigned > >, TFollowTuple < SymbolType > > |
| using rte::TFollowTuple = typedef ext::vector < ext::set < common::ranked_symbol < ext::pair < SymbolType, unsigned > > > > |
| using rte::TSetOfSymbols = typedef ext::set < common::ranked_symbol < ext::pair < SymbolType, unsigned > > > |
| using rte::TSubstMap = typedef ext::map < common::ranked_symbol < ext::pair < SymbolType, unsigned > >, TSetOfSymbols < SymbolType > > |