blob: 5d51875c7a3e9e4afb48c6e05c0539917cf8dc72 (
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
48
49
50
51
52
53
54
55
|
#include <stdio.h>
#include "tree.h"
#include "bu-parser.h"
struct lex_str_data {
const char *str;
size_t slen;
size_t needle;
};
struct chartoken lex_str(void *v) {
struct lex_str_data *d = v;
if (d->needle >= d->slen) {
return (struct chartoken){.id = TOKEN_EOS, .c = '\0' };
}
struct chartoken token;
do {
token.c = d->str[d->needle++];
enum token_id id = TOKEN_INVALID;
if (token.c >= 'a' && token.c <= 'z') { token.id = TOKEN_VARIABLE; }
else {
switch (token.c) {
case '!': token.id = TOKEN_UNARY_OPERATOR; break;
case '*':
case '+': token.id = TOKEN_BINARY_OPERATOR; break;
default: break;
}
}
} while (token.c == ' ');
return token;
}
int main(){
char str[100];
printf("type in your tree(no spaces please): ");
scanf("%[^\n]", str);
char str2[100];
strncpy(str2, str, 100);
printTree(parse(str2),0);
struct lex_str_data lxd;
lxd.str = str;
lxd.slen = strlen(str);
lxd.needle = 0;
struct expr_parser ep = expr_parser_init(lex_str, &lxd);
enum parser_state s = expr_parser_run(&ep);
if (s == PARSER_ACCEPT) {
printTree(ep.stack[0].expr, 0);
} else {
expr_parser_debug_print(stderr, &ep);
}
expr_parser_finish(&ep);
return 0;
}
|
