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
|
#pragma once
#include "minicc.h"
#include "bnf.h"
struct TreeNode {
index_t parent{};
std::vector<index_t> childs; // fill char by char
std::vector<std::string> child_names; // fill always
std::string name;
};
class Tree {
private:
std::map<index_t, TreeNode> nodes; // index 0 = non existing; index starting at 1
index_t node_num{};
index_t root{};
index_t last{};
public:
void clear();
std::string GetType();
bool Valid(const std::string& Top) const;
bool AddFirstNode(char c, const BNF& bnf, const std::map<std::string, std::set<std::string>>& reverseBNF);
std::vector<TreeNode> getParentTreeNode(const BNF& bnf, const std::map<std::string, std::set<std::string>>& reverseBNF);
index_t GetLast();
void AddRootNode(const TreeNode& newRootNode);
void RemoveRootNode();
std::vector<std::string> GetPath(std::string a, std::string b, const BNF& bnf, const std::map<std::string, std::set<std::string>>& reverseBNF);
index_t AddNode(const std::string& name, const std::string& child_name, index_t parent_index, const BNF& bnf, const std::map<std::string, std::set<std::string>>& reverseBNF);
void AddPath(const std::vector<std::string>& path, index_t current_index, const BNF& bnf, const std::map<std::string, std::set<std::string>>& reverseBNF);
bool Add(char c, const BNF& bnf, const std::map<std::string, std::set<std::string>>& reverseBNF);
void Resolve(const BNF& bnf, const std::map<std::string, std::set<std::string>>& reverseBNF);
};
class Lexer
{
private:
const BNF &bnf;
const std::string& Top;
Location location{1, 0};
std::map<std::string, std::set<std::string>> ReverseBNF;
// to be called on token end
void FinalizeTree(Tree& tree, std::string& token, std::vector<Token>& result);
public:
Lexer(const BNF& bnf, const std::string& Top);
std::vector<Token> Lex(const std::string& s);
};
|
