Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <GrammarFromXMLParser.h>
Static Public Member Functions | |
template<class SymbolType > | |
static ext::set< SymbolType > | parseNonterminalAlphabet (ext::deque< sax::Token >::iterator &input) |
template<class SymbolType > | |
static ext::set< SymbolType > | parseTerminalAlphabet (ext::deque< sax::Token >::iterator &input) |
template<class SymbolType > | |
static SymbolType | parseInitialSymbol (ext::deque< sax::Token >::iterator &input) |
static bool | parseGeneratesEpsilon (ext::deque< sax::Token >::iterator &input) |
template<class SymbolType > | |
static ext::vector< SymbolType > | parseRuleLContext (ext::deque< sax::Token >::iterator &input) |
template<class SymbolType > | |
static ext::vector< SymbolType > | parseRuleLHS (ext::deque< sax::Token >::iterator &input) |
template<class SymbolType > | |
static ext::vector< SymbolType > | parseRuleRContext (ext::deque< sax::Token >::iterator &input) |
template<class SymbolType > | |
static SymbolType | parseRuleSingleSymbolLHS (ext::deque< sax::Token >::iterator &input) |
template<class SymbolType > | |
static ext::vector< SymbolType > | parseRuleRHS (ext::deque< sax::Token >::iterator &input) |
template<class T > | |
static void | parseRules (ext::deque< sax::Token >::iterator &input, T &grammar) |
Parser used to get general FSM or EpsilonNFA, NFA, DFA from XML parsed into list of Tokens.
|
inlinestatic |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |