-
Notifications
You must be signed in to change notification settings - Fork 107
Expand file tree
/
Copy pathBooleanParser.php
More file actions
335 lines (304 loc) · 9.54 KB
/
Copy pathBooleanParser.php
File metadata and controls
335 lines (304 loc) · 9.54 KB
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
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
<?php
declare(strict_types=1);
/*
* This file belongs to the package "TYPO3 Fluid".
* See LICENSE.txt that was shipped with this package.
*/
namespace TYPO3Fluid\Fluid\Core\Parser;
/**
* This BooleanParser helps to parse and evaluate boolean expressions.
* it's basically a recursive decent parser that uses a tokenizing regex
* to walk a given expression while evaluating each step along the way.
*
* For a basic recursive decent exampel check out:
* http://stackoverflow.com/questions/2093138/what-is-the-algorithm-for-parsing-expressions-in-infix-notation
*
* Parsingtree:
*
* evaluate/compile: start the whole cycle
* parseOrToken: takes care of "||" parts
* evaluateOr: evaluate the "||" part if found
* parseAndToken: take care of "&&" parts
* evaluateAnd: evaluate "&&" part if found
* parseCompareToken: takes care any comparisons "==,!=,>,<,..."
* evaluateCompare: evaluate the comparison if found
* parseNotToken: takes care of any "!" negations
* evaluateNot: evaluate the negation if found
* parseBracketToken: takes care of any '()' parts and restarts the cycle
* parseStringToken: takes care of any strings
* evaluateTerm: evaluate terms from true/false/numeric/context
*/
class BooleanParser
{
/**
* List of comparators to check in the parseCompareToken if the current
* part of the expression is a comparator and needs to be compared
*/
public const COMPARATORS = '==,===,!==,!=,<=,>=,<,>,%';
/**
* Regex to parse a expression into tokens
*/
public const TOKENREGEX = '/
\s*(
\\\\\'
|
\\"
|
[\'"]
|
[_A-Za-z0-9\.\{\}\-\\\\]+
|
\=\=\=
|
\=\=
|
!\=\=
|
!\=
|
<\=
|
>\=
|
<
|
>
|
%
|
\|\|
|
[aA][nN][dD]
|
&&
|
[oO][rR]
|
.?
)\s*
/xsu';
/**
* Cursor that contains a integer value pointing to the location inside the
* expression string that is used by the peek function to look for the part of
* the expression that needs to be focused on next. This cursor is changed
* by the consume method, by "consuming" part of the expression.
*/
protected int $cursor = 0;
/**
* Expression that is parsed through peek and consume methods
*/
protected string $expression;
/**
* Context containing all variables that are references in the expression
*/
protected array $context = [];
/**
* Evaluate a expression to a boolean
*
* @param string $expression to be parsed
* @param array $context containing variables that can be used in the expression
* @return mixed
*/
public function evaluate(string $expression, array $context): mixed
{
$this->context = $context;
$this->expression = $expression;
$this->cursor = 0;
return (function ($context): mixed {
$code = 'return ' . $this->parseOrToken() . ';';
return eval($code);
})($context);
}
/**
* Parse and compile an expression into an php equivalent
*
* @param string $expression to be parsed
*/
public function compile(string $expression): string
{
$this->context = [];
$this->expression = $expression;
$this->cursor = 0;
return $this->parseOrToken();
}
/**
* The part of the expression we're currently focusing on based on the
* tokenizing regex offset by the internally tracked cursor.
*
* @param bool $includeWhitespace return surrounding whitespace with token
*/
protected function peek(bool $includeWhitespace = false): string
{
preg_match(static::TOKENREGEX, mb_substr($this->expression, $this->cursor), $matches);
if ($includeWhitespace === true) {
return $matches[0];
}
return $matches[1];
}
/**
* Consume part of the current expression by setting the internal cursor
* to the position of the string in the expression and it's length
*/
protected function consume(string $string): void
{
if (mb_strlen($string) === 0) {
return;
}
$this->cursor = mb_strpos($this->expression, $string, $this->cursor) + mb_strlen($string);
}
/**
* Passes the torch down to the next deeper parsing leve (and)
* and checks then if there's a "or" expression that needs to be handled
*/
protected function parseOrToken(): string
{
$x = $this->parseAndToken();
while (($token = $this->peek()) && in_array(strtolower($token), ['||', 'or'])) {
$this->consume($token);
$y = $this->parseAndToken();
$x = '(' . $x . ' || ' . $y . ')';
}
return $x;
}
/**
* Passes the torch down to the next deeper parsing leve (compare)
* and checks then if there's a "and" expression that needs to be handled
*
* @return mixed
*/
protected function parseAndToken(): string
{
$x = $this->parseCompareToken();
while (($token = $this->peek()) && in_array(strtolower($token), ['&&', 'and'])) {
$this->consume($token);
$y = $this->parseCompareToken();
$x = '(' . $x . ' && ' . $y . ')';
}
return $x;
}
/**
* Passes the torch down to the next deeper parsing leven (not)
* and checks then if there's a "compare" expression that needs to be handled
*
* @return mixed
*/
protected function parseCompareToken(): string
{
$x = $this->parseNotToken();
while (in_array($comparator = $this->peek(), explode(',', static::COMPARATORS))) {
$this->consume($comparator);
$y = $this->parseNotToken();
$x = $this->evaluateCompare($x, $y, $comparator);
}
return $x;
}
/**
* Check if we have encountered an not expression or pass the torch down
* to the simpleToken method.
*
* @return mixed
*/
protected function parseNotToken(): string
{
if ($this->peek() === '!') {
$this->consume('!');
$x = $this->parseNotToken();
return '!(' . $x . ')';
}
return $this->parseBracketToken();
}
/**
* Takes care of restarting the whole parsing loop if it encounters a "(" or ")"
* token or pass the torch down to the parseStringToken method
*
* @return mixed
*/
protected function parseBracketToken(): string
{
$t = $this->peek();
if ($t === '(') {
$this->consume('(');
$result = $this->parseOrToken();
$this->consume(')');
return $result;
}
return $this->parseStringToken();
}
/**
* Takes care of consuming pure string including whitespace or passes the torch
* down to the parseTermToken method
*/
protected function parseStringToken(): string
{
$t = $this->peek();
if ($t === '\'' || $t === '"') {
$stringIdentifier = $t;
$string = $stringIdentifier;
$this->consume($stringIdentifier);
while (trim($t = $this->peek(true)) !== $stringIdentifier) {
$this->consume($t);
$string .= $t;
if ($t === '') {
throw new Exception(sprintf('Closing string token expected in boolean expression "%s".', $this->expression), 1697479462);
}
}
$this->consume($stringIdentifier);
$string .= $stringIdentifier;
return $string;
}
return $this->parseTermToken();
}
/**
* Takes care of restarting the whole parsing loop if it encounters a "(" or ")"
* token, consumes a pure string including whitespace or passes the torch
* down to the evaluateTerm method
*/
protected function parseTermToken(): string
{
$t = $this->peek();
$this->consume($t);
return $this->evaluateTerm($t);
}
/**
* Compare two variables based on a specified comparator
*/
protected function evaluateCompare(mixed $x, mixed $y, string $comparator): string
{
// enfore strong comparison for comparing two objects
if ($comparator === '==' && is_object($x) && is_object($y)) {
$comparator = '===';
}
if ($comparator === '!=' && is_object($x) && is_object($y)) {
$comparator = '!==';
}
return sprintf('(%s %s %s)', $x, $comparator, $y);
}
/**
* Takes care of fetching terms from the context, converting to float/int,
* converting true/false keywords into boolean or trim the final string of
* quotation marks
*/
protected function evaluateTerm(string $x): string
{
if (isset($this->context[$x]) || (mb_strpos($x, '{') === 0 && mb_substr($x, -1) === '}')) {
return BooleanParser::class . '::convertNodeToBoolean($context["' . trim($x, '{}') . '"])';
}
if (is_numeric($x)) {
return (string)$x;
}
if (trim(strtolower($x)) === 'true') {
return 'TRUE';
}
if (trim(strtolower($x)) === 'false') {
return 'FALSE';
}
return '"' . trim($x, '\'"') . '"';
}
public static function convertNodeToBoolean(mixed $value)
{
if ($value instanceof \Countable) {
return count($value) > 0;
}
return $value;
}
}