GrammarIteration.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/ContextFree/CFG.h>
#include <common/createUnique.hpp>
 
#include <label/InitialStateLabel.h>
 
namespace grammar::transform {
 
class GrammarIteration {
public:
    template < class TerminalSymbolType, class NonterminalSymbolType >
    static grammar::CFG < TerminalSymbolType, NonterminalSymbolType > iteration ( const grammar::CFG < TerminalSymbolType, NonterminalSymbolType > & grammar );
};
 
template < class TerminalSymbolType, class NonterminalSymbolType >
grammar::CFG < TerminalSymbolType, NonterminalSymbolType > GrammarIteration::iteration ( const grammar::CFG < TerminalSymbolType, NonterminalSymbolType > & grammar ) {
    NonterminalSymbolType S = common::createUnique ( label::InitialStateLabel::instance < NonterminalSymbolType > ( ), grammar.getNonterminalAlphabet ( ) );
    grammar::CFG < TerminalSymbolType, NonterminalSymbolType > res = grammar;
 
    res.addNonterminalSymbol ( S );
    res.setInitialSymbol ( S );
    res.addRule ( S, { } );
    res.addRule ( S, { grammar.getInitialSymbol ( ), S } );
 
    return res;
}
 
} /* namespace grammar::transform */