Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <RegExpOptimize.h>
Public Member Functions | |
template<class SymbolType > | |
FormalRegExp< SymbolType > | optimize (const FormalRegExp< SymbolType > ®exp) |
template<class SymbolType > | |
FormalRegExpStructure< SymbolType > | optimize (const FormalRegExpStructure< SymbolType > ®exp) |
template<class SymbolType > | |
UnboundedRegExp< SymbolType > | optimize (const UnboundedRegExp< SymbolType > ®exp) |
template<class SymbolType > | |
UnboundedRegExpStructure< SymbolType > | optimize (const UnboundedRegExpStructure< SymbolType > ®exp) |
template<class SymbolType > | |
ext::smart_ptr< FormalRegExpElement< SymbolType > > | optimizeInner (const FormalRegExpElement< SymbolType > &node) |
Static Public Member Functions | |
template<class SymbolType > | |
static regexp::UnboundedRegExp< SymbolType > | optimize (const regexp::UnboundedRegExp< SymbolType > ®exp) |
template<class SymbolType > | |
static regexp::UnboundedRegExpStructure< SymbolType > | optimize (const regexp::UnboundedRegExpStructure< SymbolType > ®exp) |
template<class SymbolType > | |
static void | optimize (regexp::UnboundedRegExpAlternation< SymbolType > &alt, bool recursive=true) |
template<class SymbolType > | |
static void | optimize (regexp::UnboundedRegExpConcatenation< SymbolType > &concat, bool recursive=true) |
template<class SymbolType > | |
static void | optimize (regexp::UnboundedRegExpIteration< SymbolType > &iter, bool recursive=true) |
template<class SymbolType > | |
static regexp::FormalRegExp< SymbolType > | optimize (const regexp::FormalRegExp< SymbolType > ®exp) |
template<class SymbolType > | |
static regexp::FormalRegExpStructure< SymbolType > | optimize (const regexp::FormalRegExpStructure< SymbolType > ®exp) |
template<class SymbolType > | |
static void | optimize (regexp::FormalRegExpElement< SymbolType > &element) |
FormalRegExp< SymbolType > regexp::simplify::RegExpOptimize::optimize | ( | const FormalRegExp< SymbolType > & | regexp | ) |
FormalRegExpStructure< SymbolType > regexp::simplify::RegExpOptimize::optimize | ( | const FormalRegExpStructure< SymbolType > & | regexp | ) |
|
static |
|
static |
|
static |
Implements a regexp simplification algorithm that is transforming the regular expression to be smaller.
SymbolType | the type of symbols in the regular expression |
regexp | the simplified regexp |
|
static |
\override
UnboundedRegExp< SymbolType > regexp::simplify::RegExpOptimize::optimize | ( | const UnboundedRegExp< SymbolType > & | regexp | ) |
UnboundedRegExpStructure< SymbolType > regexp::simplify::RegExpOptimize::optimize | ( | const UnboundedRegExpStructure< SymbolType > & | regexp | ) |
|
static |
|
static |
\override
|
static |
\override
|
static |
\override
ext::smart_ptr< FormalRegExpElement< SymbolType > > regexp::simplify::RegExpOptimize::optimizeInner | ( | const FormalRegExpElement< SymbolType > & | node | ) |