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
|
/*
* Copyright ©️ 2022 Mario Forzanini <mf@marioforzanini.com>
*
* This file is part of dwrt.
*
* Dwrt is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation, either version 3 of the License, or (at your
* option) any later version.
*
* Dwrt is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* for more details.
*
* You should have received a copy of the GNU General Public License
* along with dwrt. If not, see <https://www.gnu.org/licenses/>.
*
*/
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include "dat.h"
#include "fns.h"
#define BUFSZ 512
void
start_repl(int lflag, char var)
{
char c, *buf;
size_t offset, len;
Parser *p;
Node *result;
c = '\0';
offset = 0;
len = BUFSZ;
buf = ecalloc(len, sizeof(char));
while (1) {
while ((c = getchar()) != '\n' && c != EOF) {
len = strappend(buf, c, offset++, len);
}
p = p_alloc_str(buf);
if (parse(p) < 0) {
fprintf(stderr, "%s", p->err);
fflush(stdout);
p_free(p);
buf = memset(buf, 0, len);
offset = 0;
continue;
}
if (p->ast != NULL) {
result = ast_dwrt(p->ast, var);
if (lflag)
ast_to_latex(result);
else
ast_print(result);
printf("\n");
fflush(stdout);
ast_free(result);
}
p_free(p);
buf = memset(buf, 0, len);
offset = 0;
if (c == EOF)
break;
}
free(buf);
}
|