Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <GlushkovIndexate.h>
Data Structures | |
class | Formal |
class | Unbounded |
Public Member Functions | |
template<class SymbolType > | |
UnboundedRegExp< ext::pair< SymbolType, unsigned > > | index (const regexp::UnboundedRegExp< SymbolType > &re) |
template<class SymbolType > | |
FormalRegExp< ext::pair< SymbolType, unsigned > > | index (const regexp::FormalRegExp< SymbolType > &re) |
Static Public Member Functions | |
template<class SymbolType > | |
static regexp::UnboundedRegExp< ext::pair< SymbolType, unsigned > > | index (const regexp::UnboundedRegExp< SymbolType > &re) |
template<class SymbolType > | |
static regexp::FormalRegExp< ext::pair< SymbolType, unsigned > > | index (const regexp::FormalRegExp< SymbolType > &re) |
RegExp tree traversal utils for Glushkov algorithm.
|
static |
re | RegExp to index |
FormalRegExp< ext::pair< SymbolType, unsigned > > regexp::GlushkovIndexate::index | ( | const regexp::FormalRegExp< SymbolType > & | re | ) |
|
static |
re | RegExp to index |
UnboundedRegExp< ext::pair< SymbolType, unsigned > > regexp::GlushkovIndexate::index | ( | const regexp::UnboundedRegExp< SymbolType > & | re | ) |