UnrestrictedGrammar.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 <ext/algorithm>
 
#include <alib/map>
#include <alib/set>
#include <alib/vector>
 
#include <core/components.hpp>
 
#include <common/DefaultSymbolType.h>
 
#include <grammar/GrammarException.h>
 
#include <core/normalize.hpp>
#include <alphabet/common/SymbolNormalize.h>
#include <grammar/common/GrammarNormalize.h>
 
namespace grammar {
 
class TerminalAlphabet;
class NonterminalAlphabet;
class InitialSymbol;
 
template < class SymbolType = DefaultSymbolType >
class UnrestrictedGrammar final : public core::Components < UnrestrictedGrammar < SymbolType >, ext::set < SymbolType >, component::Set, std::tuple < TerminalAlphabet, NonterminalAlphabet >, SymbolType, component::Value, InitialSymbol > {
    ext::map < ext::vector < SymbolType >, ext::set < ext::vector < SymbolType > > > rules;
 
public:
    explicit UnrestrictedGrammar ( SymbolType initialSymbol );
 
    explicit UnrestrictedGrammar ( ext::set < SymbolType > nonterminalAlphabet, ext::set < SymbolType > terminalAlphabet, SymbolType initialSymbol );
 
    bool addRule ( ext::vector < SymbolType > leftHandSide, ext::vector < SymbolType > rightHandSide );
 
    void addRules ( ext::vector < SymbolType > leftHandSide, ext::set < ext::vector < SymbolType > > rightHandSide );
 
    const ext::map < ext::vector < SymbolType >, ext::set < ext::vector < SymbolType > > > & getRules ( ) const &;
 
    ext::map < ext::vector < SymbolType >, ext::set < ext::vector < SymbolType > > > && getRules ( ) &&;
 
    bool removeRule ( const ext::vector < SymbolType > & leftHandSide, const ext::vector < SymbolType > & rightHandSide );
 
    const SymbolType & getInitialSymbol ( ) const & {
        return this->template accessComponent < InitialSymbol > ( ).get ( );
    }
 
    SymbolType && getInitialSymbol ( ) && {
        return std::move ( this->template accessComponent < InitialSymbol > ( ).get ( ) );
    }
 
    bool setInitialSymbol ( SymbolType symbol ) {
        return this->template accessComponent < InitialSymbol > ( ).set ( std::move ( symbol ) );
    }
 
    const ext::set < SymbolType > & getNonterminalAlphabet ( ) const & {
        return this->template accessComponent < NonterminalAlphabet > ( ).get ( );
    }
 
    ext::set < SymbolType > && getNonterminalAlphabet ( ) && {
        return std::move ( this->template accessComponent < NonterminalAlphabet > ( ).get ( ) );
    }
 
    bool addNonterminalSymbol ( SymbolType symbol ) {
        return this->template accessComponent < NonterminalAlphabet > ( ).add ( std::move ( symbol ) );
    }
 
    void setNonterminalAlphabet ( ext::set < SymbolType > symbols ) {
        this->template accessComponent < NonterminalAlphabet > ( ).set ( std::move ( symbols ) );
    }
 
    const ext::set < SymbolType > & getTerminalAlphabet ( ) const & {
        return this->template accessComponent < TerminalAlphabet > ( ).get ( );
    }
 
    ext::set < SymbolType > && getTerminalAlphabet ( ) && {
        return std::move ( this->template accessComponent < TerminalAlphabet > ( ).get ( ) );
    }
 
    bool addTerminalSymbol ( SymbolType symbol ) {
        return this->template accessComponent < TerminalAlphabet > ( ).add ( std::move ( symbol ) );
    }
 
    void setTerminalAlphabet ( ext::set < SymbolType > symbols ) {
        this->template accessComponent < TerminalAlphabet > ( ).set ( std::move ( symbols ) );
    }
 
    auto operator <=> ( const UnrestrictedGrammar & other ) const {
        return std::tie ( getTerminalAlphabet ( ), getNonterminalAlphabet ( ), getInitialSymbol ( ), rules ) <=> std::tie ( other.getTerminalAlphabet ( ), other.getNonterminalAlphabet ( ), other.getInitialSymbol ( ), other.rules );
    }
 
    bool operator == ( const UnrestrictedGrammar & other ) const {
        return std::tie ( getTerminalAlphabet ( ), getNonterminalAlphabet ( ), getInitialSymbol ( ), rules ) == std::tie ( other.getTerminalAlphabet ( ), other.getNonterminalAlphabet ( ), other.getInitialSymbol ( ), other.rules );
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const UnrestrictedGrammar & instance ) {
        return out << "(UnrestrictedGrammar"
               << " NonterminalAlphabet = " << instance.getNonterminalAlphabet ( )
               << " TerminalAlphabet = " << instance.getTerminalAlphabet ( )
               << " InitialSymbol = " << instance.getInitialSymbol ( )
               << " Rules = " << instance.getRules ( )
               << ")";
    }
};
 
template < class SymbolType >
UnrestrictedGrammar < SymbolType >::UnrestrictedGrammar ( SymbolType initialSymbol ) : UnrestrictedGrammar ( ext::set < SymbolType > { initialSymbol }, ext::set < SymbolType > ( ), initialSymbol ) {
}
 
template < class SymbolType >
UnrestrictedGrammar < SymbolType >::UnrestrictedGrammar ( ext::set < SymbolType > nonterminalAlphabet, ext::set < SymbolType > terminalAlphabet, SymbolType initialSymbol ) : core::Components < UnrestrictedGrammar, ext::set < SymbolType >, component::Set, std::tuple < TerminalAlphabet, NonterminalAlphabet >, SymbolType, component::Value, InitialSymbol > ( std::move ( terminalAlphabet), std::move ( nonterminalAlphabet ), std::move ( initialSymbol ) ) {
}
 
template < class SymbolType >
bool UnrestrictedGrammar < SymbolType >::addRule ( ext::vector < SymbolType > leftHandSide, ext::vector < SymbolType > rightHandSide ) {
    if ( std::all_of ( leftHandSide.begin ( ), leftHandSide.end ( ), [this] ( const SymbolType symbol ) {
            return !getNonterminalAlphabet ( ).count ( symbol );
        } ) )
        throw GrammarException ( "Rule must rewrite nonterminal symbol" );
 
    for ( const SymbolType & symbol : leftHandSide )
        if ( !getTerminalAlphabet ( ).count ( symbol ) && !getNonterminalAlphabet ( ).count ( symbol ) )
            throw GrammarException ( "Symbol \"" + ext::to_string ( symbol ) + "\" is not neither terminal nor nonterminal symbol" );
 
    for ( const SymbolType & symbol : rightHandSide )
        if ( !getTerminalAlphabet ( ).count ( symbol ) && !getNonterminalAlphabet ( ).count ( symbol ) )
            throw GrammarException ( "Symbol \"" + ext::to_string ( symbol ) + "\" is not neither terminal nor nonterminal symbol" );
 
    return rules[std::move ( leftHandSide )].insert ( std::move ( rightHandSide ) ).second;
}
 
template < class SymbolType >
void UnrestrictedGrammar < SymbolType >::addRules ( ext::vector < SymbolType > leftHandSide, ext::set < ext::vector < SymbolType > > rightHandSide ) {
    if ( std::all_of ( leftHandSide.begin ( ), leftHandSide.end ( ), [this] ( const SymbolType symbol ) {
            return !getNonterminalAlphabet ( ).count ( symbol );
        } ) )
        throw GrammarException ( "Rule must rewrite nonterminal symbol" );
 
    for ( const SymbolType & symbol : leftHandSide )
        if ( !getTerminalAlphabet ( ).count ( symbol ) && !getNonterminalAlphabet ( ).count ( symbol ) )
            throw GrammarException ( "Symbol \"" + ext::to_string ( symbol ) + "\" is not neither terminal nor nonterminal symbol" );
 
    for ( const ext::vector < SymbolType > & rhs : rightHandSide )
        for ( const SymbolType & symbol : rhs )
            if ( !getTerminalAlphabet ( ).count ( symbol ) && !getNonterminalAlphabet ( ).count ( symbol ) )
                throw GrammarException ( "Symbol \"" + ext::to_string ( symbol ) + "\" is not neither terminal nor nonterminal symbol" );
 
    rules [ std::move ( leftHandSide ) ].insert ( ext::make_mover ( rightHandSide ).begin ( ), ext::make_mover ( rightHandSide ).end ( ) );
}
 
template < class SymbolType >
const ext::map < ext::vector < SymbolType >, ext::set < ext::vector < SymbolType > > > & UnrestrictedGrammar < SymbolType >::getRules ( ) const & {
    return rules;
}
 
template < class SymbolType >
ext::map < ext::vector < SymbolType >, ext::set < ext::vector < SymbolType > > > && UnrestrictedGrammar < SymbolType >::getRules ( ) && {
    return std::move ( rules );
}
 
template < class SymbolType >
bool UnrestrictedGrammar < SymbolType >::removeRule ( const ext::vector < SymbolType > & leftHandSide, const ext::vector < SymbolType > & rightHandSide ) {
    return rules[leftHandSide].erase ( rightHandSide );
}
 
} /* namespace grammar */
 
namespace core {
 
template < class SymbolType >
class SetConstraint< grammar::UnrestrictedGrammar < SymbolType >, SymbolType, grammar::TerminalAlphabet > {
public:
    static bool used ( const grammar::UnrestrictedGrammar < SymbolType > & grammar, const SymbolType & symbol ) {
        for ( const std::pair < const ext::vector < SymbolType >, ext::set < ext::vector < SymbolType > > > & rule : grammar.getRules ( ) ) {
            if ( std::find ( rule.first.begin ( ), rule.first.end ( ), symbol ) != rule.first.end ( ) )
                return true;
 
            for ( const ext::vector < SymbolType > & rhs : rule.second )
                if ( std::find ( rhs.begin ( ), rhs.end ( ), symbol ) != rhs.end ( ) )
                    return true;
 
        }
 
        return false;
    }
 
    static bool available ( const grammar::UnrestrictedGrammar < SymbolType > &, const SymbolType & ) {
        return true;
    }
 
    static void valid ( const grammar::UnrestrictedGrammar < SymbolType > & grammar, const SymbolType & symbol ) {
        if ( grammar.template accessComponent < grammar::NonterminalAlphabet > ( ).get ( ).count ( symbol ) )
            throw grammar::GrammarException ( "Symbol " + ext::to_string ( symbol ) + " cannot be in the terminal alphabet since it is already in the nonterminal alphabet." );
    }
};
 
template < class SymbolType >
class SetConstraint< grammar::UnrestrictedGrammar < SymbolType >, SymbolType, grammar::NonterminalAlphabet > {
public:
    static bool used ( const grammar::UnrestrictedGrammar < SymbolType > & grammar, const SymbolType & symbol ) {
        for ( const std::pair < const ext::vector < SymbolType >, ext::set < ext::vector < SymbolType > > > & rule : grammar.getRules ( ) ) {
            if ( std::find ( rule.first.begin ( ), rule.first.end ( ), symbol ) != rule.first.end ( ) )
                return true;
 
            for ( const ext::vector < SymbolType > & rhs : rule.second )
                if ( std::find ( rhs.begin ( ), rhs.end ( ), symbol ) != rhs.end ( ) )
                    return true;
 
        }
 
        return grammar.template accessComponent < grammar::InitialSymbol > ( ).get ( ) == symbol;
    }
 
    static bool available ( const grammar::UnrestrictedGrammar < SymbolType > &, const SymbolType & ) {
        return true;
    }
 
    static void valid ( const grammar::UnrestrictedGrammar < SymbolType > & grammar, const SymbolType & symbol ) {
        if ( grammar.template accessComponent < grammar::TerminalAlphabet > ( ).get ( ).count ( symbol ) )
            throw grammar::GrammarException ( "Symbol " + ext::to_string ( symbol ) + " cannot be in the nonterminal alphabet since it is already in the terminal alphabet." );
    }
};
 
template < class SymbolType >
class ElementConstraint< grammar::UnrestrictedGrammar < SymbolType >, SymbolType, grammar::InitialSymbol > {
public:
    static bool available ( const grammar::UnrestrictedGrammar < SymbolType > & grammar, const SymbolType & symbol ) {
        return grammar.template accessComponent < grammar::NonterminalAlphabet > ( ).get ( ).count ( symbol );
    }
 
    static void valid ( const grammar::UnrestrictedGrammar < SymbolType > &, const SymbolType & ) {
    }
};
 
template < class SymbolType >
struct normalize < grammar::UnrestrictedGrammar < SymbolType > > {
    static grammar::UnrestrictedGrammar < > eval ( grammar::UnrestrictedGrammar < SymbolType > && value ) {
        ext::set < DefaultSymbolType > nonterminals = alphabet::SymbolNormalize::normalizeAlphabet ( std::move ( value ).getNonterminalAlphabet ( ) );
        ext::set < DefaultSymbolType > terminals = alphabet::SymbolNormalize::normalizeAlphabet ( std::move ( value ).getTerminalAlphabet ( ) );
        DefaultSymbolType initialSymbol = alphabet::SymbolNormalize::normalizeSymbol ( std::move ( value ).getInitialSymbol ( ) );
 
        grammar::UnrestrictedGrammar < > res ( std::move ( nonterminals ), std::move ( terminals ), std::move ( initialSymbol ) );
 
        for ( std::pair < ext::vector < SymbolType >, ext::set < ext::vector < SymbolType > > > && rule : ext::make_mover ( std::move ( value ).getRules ( ) ) ) {
 
            ext::set < ext::vector < DefaultSymbolType > > rhs;
            for ( ext::vector < SymbolType > && target : ext::make_mover ( rule.second ) )
                rhs.insert ( alphabet::SymbolNormalize::normalizeSymbols ( std::move ( target ) ) );
 
            ext::vector < DefaultSymbolType > lhs = alphabet::SymbolNormalize::normalizeSymbols ( std::move ( rule.first ) );
 
            res.addRules ( std::move ( lhs ), std::move ( rhs ) );
        }
 
        return res;
    }
};
 
} /* namespace core */
 
extern template class grammar::UnrestrictedGrammar < >;