Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <FormalRegExp.h>
Static Public Member Functions | |
static bool | used (const regexp::FormalRegExp< SymbolType > ®exp, const SymbolType &symbol) |
static bool | available (const regexp::FormalRegExp< SymbolType > &, const SymbolType &) |
static void | valid (const regexp::FormalRegExp< SymbolType > &, const SymbolType &) |
Helper class specifying constraints for the expression's internal alphabet component.
SymbolType | used for the terminal alphabet of the expression. |
|
inlinestatic |
Returns true as all symbols are possibly available to be elements of the alphabet.
regexp | the tested expresion |
symbol | the tested state |
|
inlinestatic |
Returns true if the symbol is still used somewhere in the structure of the expression.
regexp | the tested expresion |
symbol | the tested symbol |
|
inlinestatic |
All symbols are valid as symbols of the alphabet.
regexp | the tested expresion |
symbol | the tested state |