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
|
/* See LICENSE file for copyright and license details. */
#include <libparser.h>
#include <libsimple.h>
#include <libsimple-arg.h>
USAGE("");
static void
free_input(struct libparser_unit *node)
{
struct libparser_unit *next;
for (; node; next = node->next, free(node), node = next)
free_input(node->in);
}
static intmax_t
calculate(struct libparser_unit *node, const char *line)
{
struct libparser_unit *next;
intmax_t value = 0;
int op;
if (!node->rule) {
next = node->in->next;
value = calculate(node->in, line);
free_input(next);
} else if (!strcmp(node->rule, "DIGIT")) {
value = (intmax_t)(line[node->start] - '0');
} else if (!strcmp(node->rule, "sign")) {
value = !strcmp(node->in->rule, "SUB") ? -1 : +1;
free(node->in);
} else if (!strcmp(node->rule, "unsigned")) {
value = 0;
next = node->in;
free(node);
for (node = next; node; node = next) {
next = node->next;
value *= 10;
value += calculate(node, line);
}
} else if (!strcmp(node->rule, "number")) {
next = node->in->next;
value = calculate(node->in, line);
free(node);
for (node = next; node; node = next) {
next = node->next;
value *= calculate(node, line);
}
} else if (!strcmp(node->rule, "value")) {
next = node->in->next;
value = calculate(node->in, line);
if (next)
value *= calculate(next, line);
} else if (!strcmp(node->rule, "hyper1")) {
next = node->in->next;
value = calculate(node->in, line);
free(node);
node = next;
while (node) {
next = node->next;
op = !strcmp(node->rule, "SUB") ? -1 : +1;
free(node);
node = next;
next = node->next;
if (op < 0)
value -= calculate(node, line);
else
value += calculate(node, line);
node = next;
}
} else if (!strcmp(node->rule, "hyper2")) {
next = node->in->next;
value = calculate(node->in, line);
free(node);
node = next;
while (node) {
next = node->next;
op = !strcmp(node->rule, "DIV") ? -1 : +1;
free(node);
node = next;
next = node->next;
if (op < 0)
value /= calculate(node, line);
else
value *= calculate(node, line);
node = next;
}
} else if (node->rule[0] != '@') {
abort();
} else if (node->in) {
next = node->in->next;
value = calculate(node->in, line);
if (next)
free_input(next);
}
free(node);
return value;
}
int
main(int argc, char *argv[])
{
struct libparser_unit *input;
char *line = NULL;
size_t size = 0;
ssize_t len;
intmax_t res;
int exception;
ARGBEGIN {
default:
usage();
} ARGEND;
if (argc)
usage();
while ((len = getline(&line, &size, stdin)) >= 0) {
if (len && line[len - 1] == '\n')
line[--len] = '\0';
input = libparser_parse_file(libparser_rule_table, line, (size_t)len, &exception);
if (!input) {
weprintf("didn't find anything to parse\n");
free_input(input);
continue;
} else if (input->end != (size_t)len) {
weprintf("line could not be parsed, stopped at column %zu\n", input->end);
free_input(input);
continue;
} else if (exception) {
weprintf("premature end of line\n");
free_input(input);
continue;
}
res = calculate(input, line);
printf("%ji\n", res);
}
free(line);
return 0;
}
|
