AutomatonIterationEpsilonTransition.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 <automaton/FSM/EpsilonNFA.h>
 
namespace automaton {
 
namespace transform {
 
class AutomatonIterationEpsilonTransition {
public:
    template < class T >
    static automaton::EpsilonNFA < typename T::SymbolType, typename T::StateType > iteration ( const T & automaton );
};
 
template < class T >
automaton::EpsilonNFA < typename T::SymbolType, typename T::StateType > AutomatonIterationEpsilonTransition::iteration ( const T & automaton ) {
    using SymbolType = typename T::SymbolType;
    using StateType = typename T::StateType;
 
    automaton::EpsilonNFA < SymbolType, StateType > res(automaton);
 
    for(const auto&q : automaton.getFinalStates())
        res.addTransition(q, automaton.getInitialState());
 
    StateType newInitialState = common::createUnique(automaton.getInitialState(), automaton.getStates());
    res.addState(newInitialState);
    res.setInitialState(newInitialState);
    res.addFinalState(newInitialState);
 
    res.addTransition(newInitialState, automaton.getInitialState());
    return res;
}
 
} /* namespace transform */
 
} /* namespace automaton */