18template<
class SymbolType >
25template<
class SymbolType >
31 return grammar::GrammarFromStringParserCommon::parseCSLikeGrammar < grammar::UnrestrictedGrammar < SymbolType > > ( input );
34template<
class SymbolType >
42template<
class SymbolType >
44 output <<
"UNRESTRICTED_GRAMMAR";
Basic exception from which all other exceptions are derived.
Definition: CommonException.h:21
static void putback(ext::istream &input, const Token &token)
Definition: lexer.hpp:61
static Token next(ext::istream &input)
Definition: GrammarFromStringLexer.cpp:10
static void composeCSLikeGrammar(ext::ostream &output, const T &grammar)
Definition: GrammarToStringComposerCommon.h:81
Unrestricted grammar. Type 0 in Chomsky hierarchy. Generates recursively enumerable languages.
Definition: UnrestrictedGrammar.h:64
return res
Definition: MinimizeByPartitioning.h:145
Definition: normalize.hpp:10
Definition: ToAutomaton.h:24
Definition: stringApi.hpp:26