blob: 6db7146a4d5e41647c6a3ec8fed8aec277f143f3 (
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
|
#pragma once
#include "grammer.h"
#include "minicc.h"
#include <vector>
class CPP {
public:
CPP();
~CPP();
std::string valueOfNode(index_t node_index, const std::vector<Gram::TreeNode>& Tree);
// phases of translation, according to standard
void source_charset_map(); // phase 1
void backslash_escape(); // phase 2
std::vector<Token> preprocessing_tokenize(const std::string& s); // phase 3
void preprocess(); // phase 4
void execution_charset_map(); // phase 5
void concatenate_strings(); // phase 6
std::vector<Token> tokens_from_pptokens(const std::vector<Token>& pp_tokens); // phase 7.a
std::vector<Gram::TreeNode> analysis(const std::vector<Token>&); // phase 7.b
void translate(); // phase 7.c
void instantiate(); // phase 8
void link(); // phase 9
// all phases of translation
void compile(const std::string& code);
std::vector<uint8_t> getCode();
std::vector<uint8_t> getData();
private:
typedef std::unordered_map<std::string, std::function<void(fs::path&, index_t)>> map_type;
std::string m_code; // input from compile()
std::vector<Token> m_tokens; // result of phase 7.a
std::vector<Gram::TreeNode> m_nodes; // result of phase 7.b
void traverse(index_t node_id, map_type& map, fs::path parent_path = "/");
CPP::map_type map_translation_unit;
};
|
