blob: 606fcc335e267c2c13850cc36df0040e26af80a1 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
#pragma once
#include "Production.hpp"
#include <unordered_map>
#include <vector>
namespace cru::parse {
class Grammar : public Object {
public:
Grammar();
CRU_DELETE_COPY(Grammar)
CRU_DELETE_MOVE(Grammar)
~Grammar() override;
public:
void SetStartSymbol(Nonterminal* start_symbol);
Terminal* CreateTerminal(String name);
Nonterminal* CreateNonterminal(String name);
Production* CreateProduction(String name, Nonterminal* left,
std::vector<Symbol*> right);
bool RemoveSymbol(Symbol* symbol);
bool RemoveProduction(Production* production);
public: // Getters
Nonterminal* GetStartSymbol() const { return start_symbol_; }
const std::vector<Terminal*>& GetTerminals() const { return terminals_; }
const std::vector<Nonterminal*>& GetNonterminals() const {
return nonterminals_;
}
const std::vector<Symbol*>& GetSymbols() const { return symbols_; }
const std::vector<Production*>& GetProductions() const {
return productions_;
}
Grammar* Clone() const;
public: // Algorithms
std::unordered_map<Nonterminal*, std::vector<Production*>>
GenerateLeftProductionMap() const;
// Algorithm 4.19.
// Require grammar has no cycles or empty-productions.
void EliminateLeftRecursions();
// Algorithm 4.21
void LeftFactor();
public:
String ProductionsToString() const;
private:
Nonterminal* start_symbol_ = nullptr;
std::vector<Terminal*> terminals_;
std::vector<Nonterminal*> nonterminals_;
std::vector<Symbol*> symbols_;
std::vector<Production*> productions_;
};
} // namespace cru::parse
|
