RG_Grammar.h

/**
 * @file RG_Grammar.h
 * @author Yacine Smaoui, Florian Hemmelgarn
 *
 * @brief Definition of the Grammar class
 */
#ifndef GRAMMAR_H_
#define GRAMMAR_H_

#include <iostream>

#include "RG_DynArray.h"
#include "RG_Production.h"
#include "FSA_FiniteStateAutomaton.hpp"
#include "RE_RegularExpression.hpp"

using namespace std;

#define EMPTY_STRING "<epsilon>"

/**
 * @class Grammar
 * @brief Represents a Grammar
 *
 * (the fact that the Grammar is a Regular Grammar or not is checked (if wanted) after reading (or creating )
 * with the method Grammar::checkIfRegular()
 *
 * A Grammar is defined through its Terminals, Non-Terminals and the Start Symbol.
 * For this purpose, the chosen container class is a Dynamic Array defined in DynArray.h
 *
 * see checkIfRegular() for more information about a REGULAR Grammar
 */
class Grammar
{
public:
	Grammar();
	~Grammar();

private:
	/** a Dynamic array container to store the Terminals of the Grammar   */
	DynArray<string> Terminals;
	/** a Dynamic array container to store the NonTerminals of the Grammar */
	DynArray<string> NonTerminals;
	/** a dynamic array container to store the Productions of the Grammar */
	DynArray<Production*> Productions;
	/** the Start symbol of the Grammar */
	string StartSymbol;
	/** 1 if Grammar is Regular */
	int isRegular;

public:
	void addProduction(Production* prod);
	void setStartSymbol(string s);
	void addTerminal (string s);
	void addNonTerminal(string s);
	void processGrammarProductions();

	DynArray<string> getTerminals();
	DynArray<string> getNonTerminals();
	string getStartSymbol();
	DynArray<Production*> getProductions();

	int getNumberOfProductions();
	Production* getProduction(int index);
	int isStartSymbol(string symbol);

	void checkIfRegular();

	void initConvert();

	FiniteStateAutomaton* convertToFSA();

	//RegularExpression *convertToRE();

};


#endif /* GRAMMAR_H_ */