Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <RegExpEmpty.h>
Data Structures | |
class | Formal |
class | Unbounded |
Static Public Member Functions | |
template<class SymbolType > | |
static bool | languageIsEmpty (const regexp::FormalRegExpElement< SymbolType > ®exp) |
template<class SymbolType > | |
static bool | languageIsEmpty (const regexp::FormalRegExpStructure< SymbolType > ®exp) |
template<class SymbolType > | |
static bool | languageIsEmpty (const regexp::FormalRegExp< SymbolType > ®exp) |
template<class SymbolType > | |
static bool | languageIsEmpty (const regexp::UnboundedRegExpElement< SymbolType > ®exp) |
template<class SymbolType > | |
static bool | languageIsEmpty (const regexp::UnboundedRegExpStructure< SymbolType > ®exp) |
template<class SymbolType > | |
static bool | languageIsEmpty (const regexp::UnboundedRegExp< SymbolType > ®exp) |
Determines whether regular expression (or its subtree) describes an empty language (regexp == \0)
|
static |
\override
|
static |
Determines whether regular expression is describes an empty language (regexp == \0)
SymbolType | the type of symbol in the tested regular expression |
regexp | the regexp to test |
|
static |
\override
|
static |
\override
|
static |
\override
|
static |
\override