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
|
#include <stdio.h>
#include <stdlib.h>
#include "util-tables.c"
#include "slr-table.c"
#include "lr-parser.c"
enum symbol {
PLUS = 0,
MINUS,
LPAREN,
RPAREN,
N0, N1,
END_INPUT,
EP, E, T, N,
SYMBOLS_END,
};
const size_t total_symbols = SYMBOLS_END;
int symbol_is_terminal(symbol s) { return s < EP; }
int symbol_is_input_end(symbol s) { return s == END_INPUT; }
int symbol_is_valid(symbol s) { return s < SYMBOLS_END; }
#define PROD(LHS, _, ...) {LHS, (symbol[]){__VA_ARGS__}, sizeof((symbol[]){__VA_ARGS__})/sizeof(symbol)}
struct production grammar[] = {
PROD(EP, ->, E, END_INPUT),
PROD(E, -->, E, PLUS, T),
PROD(E, -->, E, MINUS, T),
PROD(E, -->, T),
PROD(T, -->, LPAREN, E, RPAREN),
PROD(T, -->, N),
PROD(N, -->, N0),
PROD(N, -->, N1),
};
const size_t total_productions = sizeof(grammar)/sizeof(*grammar);
symbol toklist[] = {N0, PLUS, N1, MINUS, N0, N0, END_INPUT};
symbol *tok = toklist;
symbol toklist_eat() { return *(tok++); }
symbol toklist_peek() { return *tok; }
int main(void)
{
util_tables_fill();
table_allocate();
itemset_handle((struct item[]){{0, 0}}, 1);
lr_parser() && (exit(1), 1);
seen_sets_free();
table_free();
util_tables_free();
return r;
}
|
