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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
|
/*
This file is part of libeval, a simple math expression evaluator
Copyright (C) 2017 Michael Geselbracht, mgeselbracht3@gmail.com
Copyright (C) 2019-2020 KiCad Developers, see AUTHORS.txt for contributors.
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, see <https://www.gnu.org/licenses/>.
*/
%token_type { LIBEVAL::T_TOKEN }
%extra_argument { LIBEVAL::COMPILER* pEval }
%type nt {LIBEVAL::TREE_NODE*}
%nonassoc G_IDENTIFIER G_ASSIGN G_SEMCOL.
%left G_COMMA.
%left G_BOOL_AND.
%left G_BOOL_OR.
%left G_BOOL_XOR.
%nonassoc G_LESS_THAN G_GREATER_THAN G_LESS_EQUAL_THAN G_GREATER_EQUAL_THAN G_EQUAL G_NOT_EQUAL.
%right G_BOOL_NOT.
%left G_PLUS G_MINUS.
%left G_DIVIDE G_MULT.
%nonassoc G_STRUCT_REF.
%nonassoc G_UNIT.
%include {
#include <assert.h>
#include <libeval_compiler/libeval_compiler.h>
}
%syntax_error {
pEval->parseError("Syntax error");
}
%parse_accept {
pEval->parseOk();
}
main ::= in.
/* Allow multiple statements in input string: x=1; y=2 */
in ::= stmt.
in ::= in stmt.
/* A statement can be empty, an expr or an expr followed by ';' */
stmt ::= G_ENDS.
stmt ::= nt(A) G_ENDS. { pEval->setRoot(A); }
nt(A) ::= G_VALUE(B).
{
A = newNode( pEval, TR_NUMBER, B.value );
}
nt(A) ::= G_VALUE(B) G_UNIT(C).
{
A = newNode( pEval, TR_NUMBER, B.value );
A->leaf[0] = newNode( pEval, TR_UNIT, C.value );
}
nt(A) ::= G_STRING(B).
{
A = newNode( pEval, TR_STRING, B.value );
}
nt(A) ::= G_IDENTIFIER(B).
{
A = newNode( pEval, TR_IDENTIFIER, B.value );
}
nt(A) ::= nt(B) G_COMMA nt(C).
{
A = newNode( pEval, TR_ARG_LIST );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_LESS_THAN nt(C).
{
A = newNode( pEval, TR_OP_LESS );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_GREATER_THAN nt(C).
{
A = newNode( pEval, TR_OP_GREATER );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_LESS_EQUAL_THAN nt(C).
{
A = newNode( pEval, TR_OP_LESS_EQUAL );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_GREATER_EQUAL_THAN nt(C).
{
A = newNode( pEval, TR_OP_GREATER_EQUAL );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_NOT_EQUAL nt(C).
{
A = newNode( pEval, TR_OP_NOT_EQUAL );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_BOOL_AND nt(C).
{
A = newNode( pEval, TR_OP_BOOL_AND );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_BOOL_OR nt(C).
{
A = newNode( pEval, TR_OP_BOOL_OR );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= G_BOOL_NOT nt(B).
{
A = newNode( pEval, TR_OP_BOOL_NOT );
A->leaf[0] = B;
}
nt(A) ::= nt(B) G_PLUS nt(C).
{
A = newNode( pEval, TR_OP_ADD );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= G_PLUS nt(B).
{
A = newNode( pEval, B->op, B->value );
A->leaf[0] = B->leaf[0];
A->leaf[1] = B->leaf[1];
}
nt(A) ::= G_MINUS nt(B).
{
A = newNode( pEval, TR_OP_SUB );
A->leaf[0] = newNode( pEval, TR_NUMBER );
A->leaf[1] = B;
}
nt(A) ::= nt(B) G_MINUS nt(C).
{
A = newNode( pEval, TR_OP_SUB );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_MULT nt(C).
{
A = newNode( pEval, TR_OP_MUL );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_DIVIDE nt(C).
{
A = newNode( pEval, TR_OP_DIV );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_EQUAL nt(C).
{
A = newNode( pEval, TR_OP_EQUAL );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= nt(B) G_STRUCT_REF nt(C).
{
A = newNode( pEval, TR_STRUCT_REF );
A->leaf[0] = B;
A->leaf[1] = C;
}
nt(A) ::= G_PARENL nt(B) G_PARENR.
{
A = newNode( pEval, B->op, B->value );
A->leaf[0] = B->leaf[0];
A->leaf[1] = B->leaf[1];
}
nt(A) ::= G_IDENTIFIER(F) G_PARENL nt(B) G_PARENR.
{
A = newNode( pEval, TR_OP_FUNC_CALL );
A->leaf[0] = newNode( pEval, TR_IDENTIFIER, F.value);
A->leaf[1] = B;
}
nt(A) ::= G_IDENTIFIER(F) G_PARENL G_PARENR.
{
A = newNode( pEval, TR_OP_FUNC_CALL );
A->leaf[0] = newNode( pEval, TR_IDENTIFIER, F.value);
A->leaf[1] = newNode( pEval, TR_NULL );
}
|
