-
Notifications
You must be signed in to change notification settings - Fork 2
/
calc.c
130 lines (117 loc) · 2.46 KB
/
calc.c
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
/*
* Copyright © 2019 Keith Packard <[email protected]>
*
* This program 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.
*
* This program 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 this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <stdio.h>
#include <stdbool.h>
#include <stdint.h>
#include <ctype.h>
#include <stdlib.h>
#include "calc-gram.h"
#define PARSE_STACK_SIZE 32
static int lex_c = 0;
static int in_c(void)
{
int c;
if (lex_c != 0) {
c = lex_c;
lex_c = 0;
} else {
c = getchar();
}
return c;
}
static void un_in_c(int c)
{
lex_c = c;
}
static double lex_value;
static token_t
lex(void *lex_context)
{
for (;;) {
int c = in_c();
switch (c) {
case EOF:
return END;
case '+':
return PLUS;
case '-':
return MINUS;
case '*':
return TIMES;
case '/':
return DIVIDE;
case '(':
return OP;
case ')':
return CP;
case '\n':
return NL;
}
if ('0' <= c && c <= '9') {
char num_buf[32];
int num_cnt = 0;
while (isdigit(c)) {
num_buf[num_cnt++] = c;
c = in_c();
}
if (c == '.') {
num_buf[num_cnt++] = c;
c = in_c();
while (isdigit(c)) {
num_buf[num_cnt++] = c;
c = in_c();
}
}
if (c == 'e') {
num_buf[num_cnt++] = c;
c = in_c();
if (c == '-' || c == '+') {
num_buf[num_cnt++] = c;
c = in_c();
}
while (isdigit(c)) {
num_buf[num_cnt++] = c;
c = in_c();
}
}
num_buf[num_cnt++] = '\0';
un_in_c(c);
lex_value = strtod(num_buf, NULL);
return NUMBER;
}
}
}
static double value_stack[32];
static int value_stack_p = 0;
static void push(double value)
{
value_stack[value_stack_p++] = value;
}
static double pop(void)
{
return value_stack[--value_stack_p];
}
#define GRAMMAR_TABLE
#define TOKEN_NAMES
#define PARSE_CODE
#include "calc-gram.h"
int main(int argc, char **argv)
{
parse(NULL);
return 0;
}