27#include "../common/GrammarFromXMLParser.h"
28#include "../common/GrammarToXMLComposer.h"
32template <
class SymbolType >
42 return "UnrestrictedGrammar";
90template <
class SymbolType >
94 ext::set < SymbolType > nonterminalAlphabet = grammar::GrammarFromXMLParser::parseNonterminalAlphabet < SymbolType > ( input );
95 ext::set < SymbolType > terminalAlphabet = grammar::GrammarFromXMLParser::parseTerminalAlphabet < SymbolType > ( input );
96 SymbolType initialSymbol = grammar::GrammarFromXMLParser::parseInitialSymbol < SymbolType > ( input );
100 grammar.setNonterminalAlphabet ( std::move ( nonterminalAlphabet ) );
101 grammar.setTerminalAlphabet ( std::move ( terminalAlphabet ) );
109template <
class SymbolType >
114 grammar.addRule ( std::move ( lhs ), std::move ( rhs ) );
117template <
class SymbolType >
129template <
class SymbolType >
133 for (
const auto & rule :
grammar.getRules ( ) )
135 for (
const auto & rhs : rule.second ) {
Class extending the deque class from the standard library. Original reason is to allow printing of th...
Definition: deque.hpp:44
Class extending the vector class from the standard library. Original reason is to allow printing of t...
Definition: vector.hpp:45
static void parseRules(ext::deque< sax::Token >::iterator &input, T &grammar)
Definition: GrammarFromXMLParser.h:157
static void composeNonterminalAlphabet(ext::deque< sax::Token > &out, const ext::set< SymbolType > &symbols)
Definition: GrammarToXMLComposer.h:66
static void composeRuleLHS(ext::deque< sax::Token > &out, const ext::vector< SymbolType > &symbols)
Definition: GrammarToXMLComposer.h:103
static void composeTerminalAlphabet(ext::deque< sax::Token > &out, const ext::set< SymbolType > &symbols)
Definition: GrammarToXMLComposer.h:75
static void composeInitialSymbol(ext::deque< sax::Token > &out, const SymbolType &symbol)
Definition: GrammarToXMLComposer.h:84
static void composeRuleRHS(ext::deque< sax::Token > &out, const ext::vector< SymbolType > &symbols)
Definition: GrammarToXMLComposer.h:134
Unrestricted grammar. Type 0 in Chomsky hierarchy. Generates recursively enumerable languages.
Definition: UnrestrictedGrammar.h:64
static void popToken(ext::deque< Token >::iterator &input, Token::TokenType type, const std::string &data)
Definition: FromXMLParserHelper.cpp:39
static bool isToken(ext::deque< Token >::const_iterator input, Token::TokenType type, const std::string &data)
Definition: FromXMLParserHelper.cpp:29
return grammar
Definition: ToGrammarLeftRG.h:99
typename T::SymbolType SymbolType
Definition: ReachableStates.h:176
Definition: normalize.hpp:10
Definition: ToAutomaton.h:24
static std::string xmlTagName()
The XML tag name of class.
Definition: UnrestrictedGrammar.h:41
static bool first(const ext::deque< sax::Token >::const_iterator &input)
Tests whether the token stream starts with this type.
Definition: UnrestrictedGrammar.h:52
Definition: xmlApi.hpp:27