grammar.hpp

Go to the documentation of this file.

/*
 * SyntaxTutor - Interactive Tutorial About Syntax Analyzers
 * Copyright (C) 2025 Jose R. (jose-rzm)
 *
 * This program 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.
 *
 * This program 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 this program.  If not, see <https://www.gnu.org/licenses/>.
 */
#pragma once
#include "symbol_table.hpp"
#include <string>
#include <unordered_map>
#include <vector>

using production = std::vector<std::string>;

struct Grammar {
 
    Grammar();
    explicit Grammar(
        const std::unordered_map<std::string, std::vector<production>>&
            grammar);

    void SetAxiom(const std::string& axiom);

    bool HasEmptyProduction(const std::string& antecedent) const;

    std::vector<std::pair<const std::string, production>>
    FilterRulesByConsequent(const std::string& arg) const;

    void Debug() const; // NOSONAR

    void AddProduction(const std::string&              antecedent,
                       const std::vector<std::string>& consequent);

    std::vector<std::string> Split(const std::string& s);

    std::unordered_map<std::string, std::vector<production>> g_;

    std::string axiom_;

    SymbolTable st_;
};