ToGrammarRightRG.h

Go to the documentation of this file.

 
/*
 * This file is part of Algorithms library toolkit.
 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
 
 * Algorithms library toolkit is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 
 * Algorithms library toolkit is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 
 * You should have received a copy of the GNU General Public License
 * along with Algorithms library toolkit.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#pragma once
 
#include <grammar/Regular/RightRG.h>
 
#include <automaton/FSM/NFA.h>
#include <automaton/FSM/DFA.h>
 
#include <common/createUnique.hpp>
 
namespace automaton {
 
namespace convert {
 
class ToGrammarRightRG {
public:
    template < class T >
    requires isDFA < T > || isNFA < T >
    static grammar::RightRG < typename T::SymbolType, typename T::StateType > convert ( const T & automaton );
};
 
template < class T >
requires isDFA < T > || isNFA < T >
grammar::RightRG < typename T::SymbolType, typename T::StateType > ToGrammarRightRG::convert ( const T & automaton ) {
    using SymbolType = typename T::SymbolType;
    using StateType = typename T::StateType;
 
    // step 3 - set start symbol of G
    grammar::RightRG < SymbolType, StateType > grammar ( automaton.getInitialState ( ) );
 
    grammar.setTerminalAlphabet ( automaton.getInputAlphabet ( ) );
    grammar.setNonterminalAlphabet ( automaton.getStates ( ) );
 
    // step 2 - create set of P in G
    for ( const auto& transition : automaton.getTransitions ( ) ) {
        const auto & from = transition.first.first;
        const auto & input = transition.first.second;
        const auto & to = transition.second;
 
        grammar.addRule ( from, ext::make_pair ( input, to ) ); // 2a
 
        if ( automaton.getFinalStates ( ).contains ( to ) ) // 2b
            grammar.addRule ( from, input );
    }
 
    // step 4
    if ( automaton.getFinalStates ( ).contains ( automaton.getInitialState ( ) ) )
        grammar.setGeneratesEpsilon ( true ); // okay this feature makes the algorithm a bit different but at the same time it simplifies the code :))
 
    return grammar;
}
 
} /* namespace convert */
 
} /* namespace automaton */