ilusha/Modules
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

TODO : Make RE Grammar template independent. Difine Unified grammar format.

Browse source
This commit is contained in:
IlyaShurupov 2023-11-02 15:55:55 +03:00 • committed by Ilya Shurupov
parent 53b690dad9
commit 419ebb43d1
4 changed files with 115 additions and 11 deletions
Download patch file Download diff file Expand all files Collapse all files

63
Language/public/Grammar.hpp
View file

@ -3,11 +3,70 @@
#include "Buffer.hpp"
#include "LanguageCommon.hpp"
#include "Utils.hpp"
#include "Map.hpp"
#include "Strings.hpp"
namespace tp {
class ContextFreeGrammar {};
class ContextFreeGrammar {
public:
struct Arg {
friend class Rule;
public:
Arg() = default;
explicit Arg(const String& id, bool terminal = true, bool epsilon = false);
public:
bool operator==(const Arg& in) const;
[[nodiscard]] const String& getId() const;
private:
String mId;
bool mIsTerminal = false;
bool mIsEpsilon = false;
};
class Rule {
public:
Rule() = default;
Rule(const String& id, const InitialierList<Arg>& args);
public:
bool operator==(const Rule& in) const;
[[nodiscard]] bool isProductive() const;
private:
String mId;
Buffer<Arg> mArgs;
};
private:
// cache data
struct NonTerminal {
Buffer<Rule*> rules;
Map<String, NonTerminal*> references;
Map<String, NonTerminal*> referencing;
public:
[[nodiscard]] bool isProductive() const;
[[nodiscard]] bool isLooped(Map<String, ualni>& processed, const String& id) const;
};
public:
ContextFreeGrammar() = default;
public:
void addRule(const Rule& rule);
void addRule(const String& id, const InitialierList<Arg>& args);
void setStart(const String& startRule);
private:
Map<String, NonTerminal> mNonTerminals;
Buffer<Rule> mRules;
String mStartTerminal;
bool mIsLooped = false;
};
template <typename tAlphabetType, typename tTokType>
class RegularGrammar {