Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
GNF.h
Go to the documentation of this file.
1
6/*
7 * This file is part of Algorithms library toolkit.
8 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
9
10 * Algorithms library toolkit is free software: you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation, either version 3 of the License, or
13 * (at your option) any later version.
14
15 * Algorithms library toolkit is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
19
20 * You should have received a copy of the GNU General Public License
21 * along with Algorithms library toolkit. If not, see <http://www.gnu.org/licenses/>.
22 */
23
24#pragma once
25
27#include "../common/GrammarFromXMLParser.h"
28#include "../common/GrammarToXMLComposer.h"
29
30#include <grammar/AddRawRule.h>
31
33
34namespace core {
35
36template < class TerminalSymbolType, class NonterminalSymbolType >
37struct xmlApi < grammar::GNF < TerminalSymbolType, NonterminalSymbolType > > {
45 static std::string xmlTagName() {
46 return "GNF";
47 }
48
56 static bool first ( const ext::deque < sax::Token >::const_iterator & input ) {
58 }
59
68
76
84
92};
93
94template < class TerminalSymbolType, class NonterminalSymbolType >
97
98 ext::set < NonterminalSymbolType > nonterminalAlphabet = grammar::GrammarFromXMLParser::parseNonterminalAlphabet < NonterminalSymbolType > ( input );
99 ext::set < TerminalSymbolType > terminalAlphabet = grammar::GrammarFromXMLParser::parseTerminalAlphabet < TerminalSymbolType > ( input );
100 NonterminalSymbolType initialSymbol = grammar::GrammarFromXMLParser::parseInitialSymbol < NonterminalSymbolType > ( input );
101
103
104 grammar.setNonterminalAlphabet ( std::move ( nonterminalAlphabet ) );
105 grammar.setTerminalAlphabet ( std::move ( terminalAlphabet ) );
106
108
109 bool generatesEpsilon = grammar::GrammarFromXMLParser::parseGeneratesEpsilon ( input );
110 grammar.setGeneratesEpsilon ( generatesEpsilon );
111
113 return grammar;
114}
115
116template < class TerminalSymbolType, class NonterminalSymbolType >
118 NonterminalSymbolType lhs = grammar::GrammarFromXMLParser::parseRuleSingleSymbolLHS < NonterminalSymbolType > ( input );
119 ext::vector < ext::variant < TerminalSymbolType, NonterminalSymbolType > > rhs = grammar::GrammarFromXMLParser::parseRuleRHS < ext::variant < TerminalSymbolType, NonterminalSymbolType > > ( input );
120
121 grammar::AddRawRule::addRawRule ( grammar, std::move ( lhs ), std::move ( rhs ) );
122}
123
124template < class TerminalSymbolType, class NonterminalSymbolType >
126 out.emplace_back ( xmlTagName ( ), sax::Token::TokenType::START_ELEMENT );
127
128 grammar::GrammarToXMLComposer::composeNonterminalAlphabet ( out, grammar.getNonterminalAlphabet ( ) );
131 composeRules ( out, grammar );
133
134 out.emplace_back ( xmlTagName ( ), sax::Token::TokenType::END_ELEMENT );
135}
136
137template < class TerminalSymbolType, class NonterminalSymbolType >
139 out.emplace_back ( "rules", sax::Token::TokenType::START_ELEMENT );
140
141 for ( const auto & rule : grammar.getRules ( ) )
142
143 for ( const auto & rhs : rule.second ) {
144 out.emplace_back ( "rule", sax::Token::TokenType::START_ELEMENT );
145
148
149 out.emplace_back ( "rule", sax::Token::TokenType::END_ELEMENT );
150 }
151
152 out.emplace_back ( "rules", sax::Token::TokenType::END_ELEMENT );
153}
154
155} /* namespace core */
156
Class extending the deque class from the standard library. Original reason is to allow printing of th...
Definition: deque.hpp:44
Definition: set.hpp:44
Class extending the vector class from the standard library. Original reason is to allow printing of t...
Definition: vector.hpp:45
static bool addRawRule(LG< TerminalSymbolType, NonterminalSymbolType > &grammar, NonterminalSymbolType leftHandSide, ext::vector< ext::variant< TerminalSymbolType, NonterminalSymbolType > > rightHandSide)
Definition: AddRawRule.h:92
Greibach normal form of a context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy....
Definition: GNF.h:65
static void parseRules(ext::deque< sax::Token >::iterator &input, T &grammar)
Definition: GrammarFromXMLParser.h:157
static bool parseGeneratesEpsilon(ext::deque< sax::Token >::iterator &input)
Definition: GrammarFromXMLParser.h:31
static void composeNonterminalAlphabet(ext::deque< sax::Token > &out, const ext::set< SymbolType > &symbols)
Definition: GrammarToXMLComposer.h:66
static void composeTerminalAlphabet(ext::deque< sax::Token > &out, const ext::set< SymbolType > &symbols)
Definition: GrammarToXMLComposer.h:75
static void composeRuleGNFRHS(ext::deque< sax::Token > &out, const ext::pair< TerminalSymbolType, ext::vector< NonterminalSymbolType > > &symbols)
Definition: GrammarToXMLComposer.h:159
static void composeRuleSingleSymbolLHS(ext::deque< sax::Token > &out, const SymbolType &symbol)
Definition: GrammarToXMLComposer.h:127
static void composeInitialSymbol(ext::deque< sax::Token > &out, const SymbolType &symbol)
Definition: GrammarToXMLComposer.h:84
static void composeGeneratesEpsilon(ext::deque< sax::Token > &out, bool generatesEpsilon)
Definition: GrammarToXMLComposer.h:31
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
Definition: normalize.hpp:10
Definition: ToAutomaton.h:24
static std::string xmlTagName()
The XML tag name of class.
Definition: GNF.h:45
static bool first(const ext::deque< sax::Token >::const_iterator &input)
Tests whether the token stream starts with this type.
Definition: GNF.h:56
Definition: xmlApi.hpp:27