|
Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
Namespaces | |
| namespace | convert |
| namespace | generate |
| namespace | properties |
| namespace | simplify |
| namespace | transform |
Data Structures | |
| class | FormalRegExp |
| Formal regular expression represents regular expression. It describes regular languages. The expression consists of the following nodes: More... | |
| class | FormalRegExpAlternation |
| Represents the alternation operator in the regular expression. The node must have exactly two children. More... | |
| class | FormalRegExpConcatenation |
| Represents the concatenation operator in the regular expression. The node must have exactly two children. More... | |
| class | FormalRegExpElement |
| class | FormalRegExpEmpty |
| Represents the empty expression in the regular expression. The node can't have any children. More... | |
| class | FormalRegExpEpsilon |
| Represents the epsilon expression in the regular expression. The node can't have any children. More... | |
| class | FormalRegExpIteration |
| Represents the iteration operator in the regular expression. The node has exactly one child. More... | |
| class | FormalRegExpStructure |
| Represents formal regular expression structure. Regular expression is stored as a tree of FormalRegExpElements. More... | |
| class | FormalRegExpSymbol |
| Represents the symbol in the regular expression. The can't have any children. More... | |
| class | GlushkovFirst |
| class | GlushkovFollow |
| class | GlushkovIndexate |
| class | GlushkovLast |
| class | GlushkovPos |
| class | RegExpFromStringLexer |
| class | RegExpFromXmlParser |
| class | RegExpToXmlComposer |
| class | UnboundedRegExp |
| Unbounded regular expression represents regular expression. It describes regular languages. The expression consists of the following nodes: More... | |
| class | UnboundedRegExpAlternation |
| Represents the alternation operator in the regular expression. The node can have 0 to n children in list of UnboundedRegExpElement as operands of the alternation. More... | |
| class | UnboundedRegExpConcatenation |
| Represents the concatenation operator in the regular expression. The node can have 0 to n children in list of UnboundedRegExpElement as operands of the concatenation. More... | |
| class | UnboundedRegExpElement |
| class | UnboundedRegExpEmpty |
| Represents the empty expression in the regular expression. The node can't have any children. More... | |
| class | UnboundedRegExpEpsilon |
| Represents the epsilon expression in the regular expression. The node can't have any children. More... | |
| class | UnboundedRegExpIteration |
| Represents the iteration operator in the regular expression. The node has exactly one child. More... | |
| class | UnboundedRegExpStructure |
| Represents unbounded regular expression structure. Regular expression is stored as a tree of UnboundedRegExpElements. More... | |
| class | UnboundedRegExpSymbol |
| Represents the symbol in the regular expression. The can't have any children. More... | |
Typedefs | |
| template<class T > | |
| using | SymbolTypeOfRegexp = typename std::decay< decltype(std::declval< T >().getAlphabet()) >::type::value_type |
Functions | |
| regexp::UnboundedRegExp< char > | regexpFrom (const std::string &string) |
| regexp::UnboundedRegExp< char > | regexpFrom (const char *string) |
| template<class SymbolType > | |
| regexp::UnboundedRegExp< SymbolType > | regexpFrom () |
| template<class SymbolType > | |
| regexp::UnboundedRegExp< SymbolType > | regexpFrom (ext::vector< SymbolType > string) |
| template<class SymbolType > | |
| regexp::UnboundedRegExp< SymbolType > | regexpFrom (string::LinearString< SymbolType > string) |
| template<class SymbolType > | |
| regexp::UnboundedRegExp< SymbolType > | regexpFrom (const SymbolType &symbol) |
| using regexp::SymbolTypeOfRegexp = typedef typename std::decay < decltype (std::declval<T>().getAlphabet()) >::type::value_type |
| regexp::UnboundedRegExp< SymbolType > regexp::regexpFrom | ( | ) |
| regexp::UnboundedRegExp< char > regexp::regexpFrom | ( | const char * | string | ) |
| regexp::UnboundedRegExp< char > regexp::regexpFrom | ( | const std::string & | string | ) |
| regexp::UnboundedRegExp< SymbolType > regexp::regexpFrom | ( | const SymbolType & | symbol | ) |
| regexp::UnboundedRegExp< SymbolType > regexp::regexpFrom | ( | ext::vector< SymbolType > | string | ) |
| regexp::UnboundedRegExp< SymbolType > regexp::regexpFrom | ( | string::LinearString< SymbolType > | string | ) |