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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
|
/*
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.
*/
#include "parser.hpp"
#include <cstdlib>
namespace solar {
enum parser_state {
STATE_INIT,
STATE_RULE_BAR,
STATE_RULE_EQUAL,
STATE_RULE,
STATE_RULE_VAR_PRE,
STATE_RULE_VAR,
STATE_RULE_VAR_POST,
STATE_TYPE,
STATE_TYPE_NONTERM,
STATE_TYPE_TERM,
STATE_TYPE_TERM_BLOCK,
};
struct parser {
parser_state state;
};
parser_t * parser_alloc(void) {
parser_t *parser = (parser_t *)std::malloc(sizeof(parser_t));
parser->state = STATE_INIT;
return parser;
}
int parser_push(parser_t *parser, int token, const parser_value_t *value, parser_state_t *state) {
switch (parser->state) {
case STATE_INIT:
switch (token) {
case TOK_SYMBOL_LC:
parser->state = STATE_RULE_BAR;
state->new_rule(value->str);
free(value->str);
return 1;
case TOK_TYPE:
parser->state = STATE_TYPE;
return 1;
case 0:
return 0;
}
break;
case STATE_RULE_BAR:
if (token == '|') {
parser->state = STATE_RULE_EQUAL;
return 1;
}
break;
case STATE_RULE_EQUAL:
if (token == '=') {
parser->state = STATE_RULE;
return 1;
}
break;
case STATE_RULE:
switch (token) {
case TOK_SYMBOL_LC:
state->add_rule_nonterminal(value->str);
free(value->str);
return 1;
case TOK_SYMBOL_UC:
state->add_rule_terminal(value->str);
free(value->str);
return 1;
case TOK_CHAR:
state->add_rule_terminal(value->number);
return 1;
case TOK_BLOCK:
state->add_rule(value->str);
free(value->str);
parser->state = STATE_INIT;
return 1;
case '(':
parser->state = STATE_RULE_VAR_PRE;
return 1;
case ';':
state->add_rule();
parser->state = STATE_INIT;
return 1;
}
break;
case STATE_RULE_VAR_PRE:
switch (token) {
case TOK_SYMBOL:
case TOK_SYMBOL_UC:
case TOK_SYMBOL_LC:
state->add_rule_var(value->str);
free(value->str);
parser->state = STATE_RULE_VAR;
return 1;
}
break;
case STATE_RULE_VAR:
if (token == ')') {
parser->state = STATE_RULE;
return 1;
}
break;
case STATE_RULE_VAR_POST:
switch (token) {
case TOK_SYMBOL_LC:
state->add_rule_nonterminal(value->str);
free(value->str);
return 1;
case TOK_SYMBOL_UC:
state->add_rule_terminal(value->str);
free(value->str);
return 1;
case TOK_CHAR:
state->add_rule_terminal(value->number);
return 1;
case TOK_BLOCK:
state->add_rule(value->str);
free(value->str);
parser->state = STATE_INIT;
return 1;
case ';':
state->add_rule();
parser->state = STATE_INIT;
return 1;
}
break;
case STATE_TYPE:
switch (token) {
case TOK_SYMBOL_LC:
state->add_type_nonterminal(value->str);
free(value->str);
parser->state = STATE_TYPE_NONTERM;
return 1;
case TOK_SYMBOL_UC:
state->add_type_terminal(value->str);
free(value->str);
parser->state = STATE_TYPE_TERM;
return 1;
}
break;
case STATE_TYPE_NONTERM:
if (token == TOK_BLOCK) {
state->set_type_nonterminal(value->str);
free(value->str);
parser->state = STATE_INIT;
return 1;
}
break;
case STATE_TYPE_TERM:
if (token == TOK_BLOCK) {
state->set_type_terminal(value->str);
free(value->str);
parser->state = STATE_TYPE_TERM_BLOCK;
return 1;
}
break;
case STATE_TYPE_TERM_BLOCK:
switch (token) {
case TOK_SYMBOL:
case TOK_SYMBOL_UC:
case TOK_SYMBOL_LC:
state->set_type_terminal_name(value->str);
free(value->str);
parser->state = STATE_INIT;
return 1;
}
}
switch (token) {
case TOK_SYMBOL:
case TOK_SYMBOL_UC:
case TOK_SYMBOL_LC:
case TOK_CHAR:
case TOK_BLOCK:
free(value->str);;
}
return -1;
}
void parser_free(parser_t *parser) {
std::free(parser);
}
}
|
