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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
/*
Copyright (c) 2015, Matthias Schiffer <mschiffer@universe-factory.net>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include "item.hpp"
#include <stdexcept>
#include <set>
#include <map>
namespace solar {
class generator_t {
public:
class conflict_error : public std::runtime_error {
public:
explicit conflict_error(const std::string& what_arg) : std::runtime_error(what_arg) {}
explicit conflict_error(const char* what_arg) : std::runtime_error(what_arg) {}
};
private:
std::vector<std::tuple<item_t, std::vector<std::string>, std::string>> rules;
std::map<item_t, size_t> rule_ids;
std::multimap<std::string, size_t> nonterms;
std::set<std::string> nonterminals;
std::set<symbol_t> terminals;
std::multimap<symbol_t, item_t> items;
std::map<std::set<item_t>, size_t> itemsets;
std::map<std::pair<size_t, symbol_t>, size_t> shifts;
std::map<size_t, size_t> reductions;
std::map<std::pair<size_t, std::string>, size_t> gotos;
std::set<size_t> shift_conflicts;
std::map<std::string, std::string> nonterm_types;
std::map<symbol_t, std::pair<std::string, std::string>> term_types;
std::string header_block;
std::string source_block;
std::vector<std::pair<std::string, std::string>> extra_args;
void close_set(std::set<item_t> *set);
std::set<item_t> get_set(const std::string &nonterm);
std::pair<std::map<std::set<item_t>, size_t>::iterator, bool> add_set(const std::set<item_t> &set) {
return itemsets.insert(std::make_pair(set, itemsets.size()));
}
void add_reduction(size_t from, size_t to) {
if (reductions.count(from))
throw conflict_error("reduce/reduce conflict");
if (shift_conflicts.count(from))
throw conflict_error("shift/reduce conflict");
reductions.insert(std::make_pair(from, to));
}
void add_shift(size_t from, const symbol_t &sym, size_t to) {
if (reductions.count(from))
throw conflict_error("shift/reduce conflict");
shift_conflicts.insert(from);
shifts.insert(std::make_pair(std::make_pair(from, sym), to));
}
void add_goto(size_t from, const std::string &nonterm, size_t to) {
gotos.insert(std::make_pair(std::make_pair(from, nonterm), to));
}
void generate_itemsets();
public:
const std::string & get_nonterm_type(const std::string &sym) const {
static const std::string empty;
auto it = nonterm_types.find(sym);
if (it == nonterm_types.end())
return empty;
else
return it->second;
}
const std::pair<std::string, std::string> & get_term_type(const symbol_t &sym) const {
static const std::pair<std::string, std::string> empty;
auto it = term_types.find(sym);
if (it == term_types.end())
return empty;
else
return it->second;
}
const std::string & get_type(const symbol_t &sym) const {
switch (sym.get_type()) {
case SYMBOL_TYPE_NONTERM:
return get_nonterm_type(sym.get_value());
default:
return get_term_type(sym).first;
}
}
const std::set<std::string> & get_nonterminals() const {
return nonterminals;
}
const std::set<symbol_t> & get_terminals() const {
return terminals;
}
size_t get_state_count() const {
return itemsets.size();
}
const std::vector<std::tuple<item_t, std::vector<std::string>, std::string>> & get_rules() const {
return rules;
}
const std::map<size_t, size_t> & get_reductions() const {
return reductions;
}
const std::map<std::pair<size_t, symbol_t>, size_t> & get_shifts() const {
return shifts;
}
const std::map<std::pair<size_t, std::string>, size_t> & get_gotos() const {
return gotos;
}
const std::string & get_header_block() const {
return header_block;
}
const std::string & get_source_block() const {
return source_block;
}
const std::vector<std::pair<std::string, std::string>> & get_extra_args() const {
return extra_args;
}
generator_t(const std::vector<std::tuple<item_t, std::vector<std::string>, std::string>> &rules0,
const std::map<std::string, std::string> &nonterm_types0,
const std::map<symbol_t, std::pair<std::string, std::string>> &term_types0,
const std::string &header_block0, const std::string &source_block0,
const std::vector<std::pair<std::string, std::string>> &extra_args0);
};
}
|
