forked from Itangalo/evalmath.class.php
-
Notifications
You must be signed in to change notification settings - Fork 0
/
expression.php
706 lines (659 loc) · 29.3 KB
/
expression.php
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
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
<?php
/*
================================================================================
Expression - PHP Class to safely evaluate math and boolean expressions
Copyright (C) 2005, Miles Kaufmann <http://www.twmagic.com/>
Copyright (C) 2016, Jakub Jankiewicz <http://jcubic.pl/>
Copyright (C) 2016, Polyntsov Konstantin <https://github.com/optimistex/>
================================================================================
NAME
Expression - safely evaluate math and boolean expressions
SYNOPSIS
<?
include('expression.php');
$e = new Expression();
// basic evaluation:
$result = $e->evaluate('2+2');
// supports: order of operation; parentheses; negation; built-in functions
$result = $e->evaluate('-8(5/2)^2*(1-sqrt(4))-8');
// support of booleans
$result = $e->evaluate('10 < 20 || 20 > 30 && 10 == 10');
// support for strings and match (regexes can be like in php or like in javascript)
$result = $e->evaluate('"Foo,Bar" =~ /^([fo]+),(bar)$/i');
// previous call will create $0 for whole match match and $1,$2 for groups
$result = $e->evaluate('$2');
// create your own variables
$e->evaluate('a = e^(ln(pi))');
// or functions
$e->evaluate('f(x,y) = x^2 + y^2 - 2x*y + 1');
// and then use them
$result = $e->evaluate('3*f(42,a)');
// create external functions
$e->functions['foo'] = function() {
return "foo";
};
// and use it
$result = $e->evaluate('foo()');
?>
DESCRIPTION
Use the Expressoion class when you want to evaluate mathematical or boolean
expressions from untrusted sources. You can define your own variables and
functions, which are stored in the object. Try it, it's fun!
Based on http://www.phpclasses.org/browse/file/11680.html, cred to Miles Kaufmann
METHODS
$e->evalute($expr)
Evaluates the expression and returns the result. If an error occurs,
prints a warning and returns false. If $expr is a function assignment,
returns true on success.
$e->e($expr)
A synonym for $e->evaluate().
$e->vars()
Returns an associative array of all user-defined variables and values.
$e->funcs()
Returns an array of all user-defined functions.
PARAMETERS
$e->suppress_errors
Set to true to turn off warnings when evaluating expressions
$e->last_error
If the last evaluation failed, contains a string describing the error.
(Useful when suppress_errors is on).
AUTHORS INFORMATION
Copyright (c) 2005, Miles Kaufmann
Copyright (c) 2016, Jakub Jankiewicz
LICENSE
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1 Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
class Expression
{
public $suppress_errors = false;
public $last_error;
/**
* Function defined outside of Expression as closures
*
* Example:
* ```php
* $expr = new Expression();
* $expr->functions = [
* 'foo' => function ($a, $b) {
* return $a + $b;
* }
* ];
* $expr->e('2 * foo(3, 4)'); //return: 14
* ```
*
* @var array
*/
public $functions = [];
/**
* Variables (and constants)
* @var array
*/
public $v = ['e' => 2.71, 'pi' => 3.14];
private $f = []; // user-defined functions
private $vb = ['e', 'pi']; // constants
private $fb = [ // built-in functions
'sin', 'sinh', 'arcsin', 'asin', 'arcsinh', 'asinh',
'cos', 'cosh', 'arccos', 'acos', 'arccosh', 'acosh',
'tan', 'tanh', 'arctan', 'atan', 'arctanh', 'atanh',
'sqrt', 'abs', 'ln', 'log'];
private $_functions = [];
public function __construct()
{
// make the variables a little more accurate
$this->v['pi'] = M_PI;
$this->v['e'] = exp(1);
$this->_functions = [
'if' => function ($condition, $valueIfTrue, $valueIfFalse) {
return $condition ? $valueIfTrue : $valueIfFalse;
}
];
}
/**
* @param string $expr
* @return bool|mixed|null
* @throws ReflectionException
*/
public function e($expr)
{
return $this->evaluate($expr);
}
/**
* @param string $expr
* @return bool|mixed|null
* @throws ReflectionException
*/
public function evaluate($expr)
{
if (empty($expr)) {
return false;
}
$this->_functions = array_merge($this->_functions, $this->functions);
$this->last_error = null;
$expr = preg_replace("/\r|\n/", '', trim($expr));
if ($expr && $expr[strlen($expr) - 1] === ';') {
$expr = substr($expr, 0, -1); // strip semicolons at the end
}
//===============
// is it a variable assignment?
if (preg_match('/^\s*([a-z]\w*)\s*=(?!~|=)\s*(.+)$/', $expr, $matches)) {
if (in_array($matches[1], $this->vb, true)) { // make sure we're not assigning to a constant
return $this->trigger("cannot assign to constant '$matches[1]'");
}
$tmp = $this->pfx($this->nfx($matches[2]));
$this->v[$matches[1]] = $tmp; // if so, stick it in the variable array
return $this->v[$matches[1]]; // and return the resulting value
//===============
// is it a function assignment?
}
if (preg_match('/^\s*([a-z]\w*)\s*\((?:\s*([a-z]\w*(?:\s*,\s*[a-z]\w*)*)\s*)?\)\s*=(?!~|=)\s*(.+)$/', $expr, $matches)) {
$fnn = $matches[1]; // get the function name
if (in_array($matches[1], $this->fb, true)) { // make sure it isn't built in
return $this->trigger("cannot redefine built-in function '$matches[1]()'");
}
$args = [];
if ($matches[2] !== '') {
$args = explode(',', preg_replace("/\s+/", '', $matches[2])); // get the arguments
}
if (($stack = $this->nfx($matches[3])) === false) {
return false; // see if it can be converted to postfix
}
foreach ($stack as $i => $iValue) { // freeze the state of the non-argument variables
$token = $iValue;
if (preg_match('/^[a-z]\w*$/', $token) && !in_array($token, $args, true)) {
if (array_key_exists($token, $this->v)) {
$stack[$i] = $this->v[$token];
} else {
return $this->trigger("undefined variable '$token' in function definition");
}
}
}
$this->f[$fnn] = ['args' => $args, 'func' => $stack];
return true;
//===============
}
return $this->pfx($this->nfx($expr)); // straight up evaluation, woo
}
/**
* @return array
*/
public function vars()
{
$output = $this->v;
unset($output['pi'], $output['e']);
return $output;
}
/**
* @return array
*/
public function funcs()
{
$output = [];
foreach ($this->f as $fnn => $dat) {
$output[] = $fnn . '(' . implode(',', $dat['args']) . ')';
}
return $output;
}
//===================== HERE BE INTERNAL METHODS ====================\\
/**
* Convert infix to postfix notation
* @param string $expr
* @return array|bool
* @throws ReflectionException
*/
private function nfx($expr)
{
$index = 0;
$stack = new ExpressionStack;
$output = []; // postfix form of expression, to be passed to pfx()
$expr = trim($expr);
$ops = ['+', '-', '*', '/', '^', '_', '%', '>', '<', '>=', '<=', '==', '!=', '=~', '&&', '||', '!'];
$ops_r = ['+' => 0, '-' => 0, '*' => 0, '/' => 0, '%' => 0, '^' => 1, '>' => 0,
'<' => 0, '>=' => 0, '<=' => 0, '==' => 0, '!=' => 0, '=~' => 0,
'&&' => 0, '||' => 0, '!' => 0]; // right-associative operator?
$ops_p = ['+' => 3, '-' => 3, '*' => 4, '/' => 4, '_' => 4, '%' => 4, '^' => 5, '>' => 2, '<' => 2,
'>=' => 2, '<=' => 2, '==' => 2, '!=' => 2, '=~' => 2, '&&' => 1, '||' => 1, '!' => 5]; // operator precedence
$expecting_op = false; // we use this in syntax-checking the expression
// and determining when a - is a negation
/* we allow all characters because of strings
if (preg_match("%[^\w\s+*^\/()\.,-<>=&~|!\"\\\\/]%", $expr, $matches)) { // make sure the characters are all good
return $this->trigger("illegal character '{$matches[0]}'");
}
*/
$begin_argument = false;
$matcher = false;
while (1) { // 1 Infinite Loop ;)
$op = substr(substr($expr, $index), 0, 2); // get the first two characters at the current index
if (preg_match("/^[+\-*\/^_\"<>=%(){\[!~,](?!=|~)/", $op) || preg_match("/\w/", $op)) {
// fix $op if it should have one character
$op = $expr[$index];
}
$single_str = '(?<!\\\\)"(?:(?:(?<!\\\\)(?:\\\\{2})*\\\\)"|[^"])*(?<![^\\\\]\\\\)"';
$double_str = "(?<!\\\\)'(?:(?:(?<!\\\\)(?:\\\\{2})*\\\\)'|[^'])*(?<![^\\\\]\\\\)'";
$regex = "(?<!\\\\)\/(?:[^\/]|\\\\\/)+\/[imsxUXJ]*";
$json = '[\[{](?>"(?:[^"]|\\\\")*"|[^[{\]}]|(?1))*[\]}]';
$number = '[\d.]+e\d+|\d+(?:\.\d*)?|\.\d+';
$name = '[a-z]\w*\(?|\\$\w+';
$parenthesis = '\\(';
// find out if we're currently at the beginning of a number/string/object/array/variable/function/parenthesis/operand
$ex = preg_match("%^($single_str|$double_str|$json|$name|$regex|$number|$parenthesis)%", substr($expr, $index), $match);
/*
if ($i++ > 1000) {
break;
}
if ($ex) {
print_r($match);
} else {
echo json_encode($op) . "\n";
}
echo $index . "\n";
*/
//===============
if ($op === '[' && $expecting_op && $ex) {
if (!preg_match("/^\[(.*)\]$/", $match[1], $matches)) {
return $this->trigger('invalid array access');
}
$stack->push('[');
$stack->push($matches[1]);
$index += strlen($match[1]);
//} elseif ($op == '!' && !$expecting_op) {
// $stack->push('!'); // put a negation on the stack
// $index++;
} elseif ($op === '-' && !$expecting_op) { // is it a negation instead of a minus?
$stack->push('_'); // put a negation on the stack
$index++;
} elseif ($op === '_') { // we have to explicitly deny this, because it's legal on the stack
return $this->trigger("illegal character '_'"); // but not in the input expression
} elseif ($ex && $matcher && preg_match('%^' . $regex . '$%', $match[1])) {
$stack->push('"' . $match[1] . '"');
$op = null;
break;
//===============
} elseif (((in_array($op, $ops, true) || $ex) && $expecting_op) || (in_array($op, $ops, true) && !$expecting_op) ||
(!$matcher && $ex && preg_match('%^' . $regex . '$%', $match[1]))
) {
// heart of the algorithm:
while ($stack->count > 0 && ($o2 = $stack->last()) && in_array($o2, $ops, true) and ($ops_r[$op] ? $ops_p[$op] < $ops_p[$o2] : $ops_p[$op] <= $ops_p[$o2])) {
$output[] = $stack->pop(); // pop stuff off the stack into the output
}
// many thanks: http://en.wikipedia.org/wiki/Reverse_Polish_notation#The_algorithm_in_detail
$stack->push($op); // finally put OUR operator onto the stack
$index += strlen($op);
$expecting_op = false;
$matcher = $op === '=~';
//===============
} elseif (($op === ')') && ($expecting_op || !$ex)) { // ready to close a parenthesis?
while (($o2 = $stack->pop()) !== '(') { // pop off the stack back to the last (
if (null === $o2) {
return $this->trigger("unexpected ')'");
}
$output[] = $o2;
}
if (preg_match("/^([a-z]\w*)\($/", $stack->last(2), $matches)) { // did we just close a function?
$fnn = $matches[1]; // get the function name
$arg_count = $stack->pop(); // see how many arguments there were (cleverly stored on the stack, thank you)
$output[] = $stack->pop(); // pop the function and push onto the output
if (in_array($fnn, $this->fb, true)) { // check the argument count
if ($arg_count > 1) {
return $this->trigger("too many arguments ($arg_count given, 1 expected)");
}
} elseif (array_key_exists($fnn, $this->f)) {
if ($arg_count !== count($this->f[$fnn]['args'])) {
return $this->trigger("wrong number of arguments ($arg_count given, " . count($this->f[$fnn]['args']) . ' expected) ' . json_encode($this->f[$fnn]['args']));
}
} elseif (array_key_exists($fnn, $this->_functions)) {
$func_reflection = new ReflectionFunction($this->_functions[$fnn]);
$count = $func_reflection->getNumberOfParameters();
if ($arg_count !== $count) {
return $this->trigger("wrong number of arguments ($arg_count given, " . $count . ' expected)');
}
} else { // did we somehow push a non-function on the stack? this should never happen
return $this->trigger('internal error');
}
}
$index++;
//===============
} elseif ($op === ',' && $expecting_op) { // did we just finish a function argument?
while (($o2 = $stack->pop()) !== '(') {
if (null === $o2) {
return $this->trigger("unexpected ','"); // oops, never had a (
}
$output[] = $o2; // pop the argument expression stuff and push onto the output
}
// make sure there was a function
if (!preg_match("/^([a-z]\w*)\($/", $stack->last(2), $matches)) {
return $this->trigger("unexpected ','");
}
$stack->push('('); // put the ( back on, we'll need to pop back to it again
$index++;
$expecting_op = false;
$begin_argument = true;
//===============
} elseif ($op === '(' && !$expecting_op) {
if ($begin_argument) {
$begin_argument = false;
if (!$stack->incrementArgument()) {
$this->trigger("unexpected '('");
}
}
$stack->push('('); // that was easy
$index++;
//===============
} elseif ($ex && !$expecting_op) { // do we now have a function/variable/number?
$expecting_op = true;
$val = $match[1];
if ($op === '[' || $op === '{' || preg_match('/null|true|false/', $match[1])) {
$output[] = $val;
} elseif (preg_match("/^([a-z]\w*)\($/", $val, $matches)) { // may be func, or variable w/ implicit multiplication against parentheses...
if (in_array($matches[1], $this->fb, true) ||
array_key_exists($matches[1], $this->f) ||
array_key_exists($matches[1], $this->_functions)
) { // it's a func
if ($begin_argument && !$stack->incrementArgument()) {
$this->trigger("unexpected '('");
}
$stack->push($val);
$stack->push(0);
$stack->push('(');
$begin_argument = true;
$expecting_op = false;
} else { // it's a var w/ implicit multiplication
$val = $matches[1];
$output[] = $val;
}
} else { // it's a plain old var or num
$output[] = $val;
if ($begin_argument && preg_match("/^([a-z]\w*)\($/", $stack->last(3))) {
$begin_argument = false;
if (!$stack->incrementArgument()) {
$this->trigger('unexpected error');
}
}
}
$index += strlen($val);
//===============
} elseif ($op === ')') { // miscellaneous error checking
return $this->trigger("unexpected ')'");
} elseif (!$expecting_op && in_array($op, $ops, true)) {
return $this->trigger("unexpected operator '$op'");
} else { // I don't even want to know what you did to get here
return $this->trigger('an unexpected error occured ' . json_encode($op) . ' ' . json_encode($match) . ' ' . ($ex ? 'true' : 'false') . ' ' . $expr);
}
if ($index === strlen($expr)) {
if (in_array($op, $ops, true)) { // did we end with an operator? bad.
return $this->trigger("operator '$op' lacks operand");
}
break;
}
while ($expr[$index] === ' ') { // step the index past whitespace (pretty much turns whitespace
$index++; // into implicit multiplication if no operator is there)
}
}
while (null !== $op = $stack->pop()) { // pop everything off the stack and push onto output
if ($op === '(') {
return $this->trigger("expecting ')'"); // if there are (s on the stack, ()s were unbalanced
}
$output[] = $op;
}
return $output;
}
/**
* evaluate postfix notation
* @param array|bool $tokens
* @param array $vars
* @return bool|mixed|null
* @throws ReflectionException
*/
private function pfx($tokens, array $vars = [])
{
if ($tokens === false) {
return false;
}
$stack = new ExpressionStack();
foreach ((array)$tokens as $token) { // nice and easy
// if the token is a binary operator, pop two values off the stack, do the operation, and push the result back on
if (in_array($token, ['+', '-', '*', '/', '^', '<', '>', '<=', '>=', '==', '&&', '||', '!=', '=~', '%'], true)) {
$op2 = $stack->pop();
$op1 = $stack->pop();
switch ($token) {
case '+':
if (is_string($op1) || is_string($op2)) {
$stack->push($op1 . $op2);
} else {
$stack->push($op1 + $op2);
}
break;
case '-':
$stack->push($op1 - $op2);
break;
case '*':
$stack->push($op1 * $op2);
break;
case '/':
if ($op2 === 0) {
return $this->trigger('division by zero');
}
$stack->push($op1 / $op2);
break;
case '%':
$stack->push($op1 % $op2);
break;
case '^':
$stack->push(pow($op1, $op2));
break;
case '>':
$stack->push($op1 > $op2);
break;
case '<':
$stack->push($op1 < $op2);
break;
case '>=':
$stack->push($op1 >= $op2);
break;
case '<=':
$stack->push($op1 <= $op2);
break;
case '==':
if (is_array($op1) && is_array($op2)) {
$stack->push(json_encode($op1) === json_encode($op2));
} else {
$stack->push($op1 == $op2);
}
break;
case '!=':
if (is_array($op1) && is_array($op2)) {
$stack->push(json_encode($op1) !== json_encode($op2));
} else {
$stack->push($op1 !== $op2);
}
break;
case '=~':
$value = @preg_match($op2, $op1, $match);
if (!is_int($value)) {
return $this->trigger('Invalid regex ' . json_encode($op2));
}
$stack->push($value);
foreach ((array)$match as $i => $iValue) {
$this->v['$' . $i] = $iValue;
}
break;
case '&&':
$stack->push($op1 ? $op2 : $op1);
break;
case '||':
$stack->push($op1 ?: $op2);
break;
}
// if the token is a unary operator, pop one value off the stack, do the operation, and push it back on
} elseif ($token === '!') {
$stack->push(!$stack->pop());
} elseif ($token === '[') {
$selector = $stack->pop();
$object = $stack->pop();
if (is_object($object)) {
$stack->push($object->$selector);
} elseif (is_array($object)) {
$stack->push($object[$selector]);
} else {
return $this->trigger('invalid object for selector');
}
} elseif ($token === '_') {
$stack->push(-1 * $stack->pop());
// if the token is a function, pop arguments off the stack, hand them to the function, and push the result back on
} elseif (preg_match("/^([a-z]\w*)\($/", $token, $matches)) { // it's a function!
$fnn = $matches[1];
if (in_array($fnn, $this->fb, true)) { // built-in function:
if (null === $op1 = $stack->pop()) {
return $this->trigger('internal error');
}
$fnn = preg_replace('/^arc/', 'a', $fnn); // for the 'arc' trig synonyms
if ($fnn === 'ln') {
$fnn = 'log';
}
$stack->push($fnn($op1)); // perfectly safe variable function call
} elseif (array_key_exists($fnn, $this->f)) { // user function
// get args
$args = [];
for ($i = count($this->f[$fnn]['args']) - 1; $i >= 0; $i--) {
if ($stack->isEmpty()) {
return $this->trigger('internal error ' . $fnn . ' ' . json_encode($this->f[$fnn]['args']));
}
$args[$this->f[$fnn]['args'][$i]] = $stack->pop();
}
$stack->push($this->pfx($this->f[$fnn]['func'], $args)); // yay... recursion!!!!
} else if (array_key_exists($fnn, $this->_functions)) {
$reflection = new ReflectionFunction($this->_functions[$fnn]);
$count = $reflection->getNumberOfParameters();
$args = [];
for ($i = $count - 1; $i >= 0; $i--) {
if ($stack->isEmpty()) {
return $this->trigger('internal error');
}
$args[] = $stack->pop();
}
$stack->push($reflection->invokeArgs(array_reverse($args)));
}
// if the token is a number or variable, push it on the stack
} else {
if (preg_match('/^([\[{](?>"(?:[^"]|\\")*"|[^[{\]}]|(?1))*[\]}])$/', $token) ||
preg_match('/^(null|true|false)$/', $token)
) { // json
//return $this->trigger("invalid json " . $token);
if ($token === 'null') {
$value = null;
} elseif ($token === 'true') {
$value = true;
} elseif ($token === 'false') {
$value = false;
} else {
$value = json_decode($token);
if ($value === null) {
return $this->trigger('invalid json ' . $token);
}
}
$stack->push($value);
} elseif (is_numeric($token)) {
$stack->push(0 + $token);
} else if (preg_match("/^['\\\"](.*)['\\\"]$/", $token)) {
$stack->push(json_decode(preg_replace_callback("/^['\\\"](.*)['\\\"]$/", function ($matches) {
$m = ["/\\\\'/", '/(?<!\\\\)"/'];
$r = ["'", '\\"'];
return '"' . preg_replace($m, $r, $matches[1]) . '"';
}, $token)));
} elseif (array_key_exists($token, $this->v)) {
$stack->push($this->v[$token]);
} elseif (array_key_exists($token, $vars)) {
$stack->push($vars[$token]);
} else {
return $this->trigger("undefined variable '$token'");
}
}
}
// when we're out of tokens, the stack should have a single element, the final result
if ($stack->count !== 1) {
return $this->trigger('internal error');
}
return $stack->pop();
}
/**
* trigger an error, but nicely, if need be
* @param string $msg
* @return bool
*/
private function trigger($msg)
{
$this->last_error = $msg;
if (!$this->suppress_errors) {
trigger_error($msg, E_USER_WARNING);
}
return false;
}
}
/**
* for internal use
*/
class ExpressionStack
{
public $stack = [];
public $count = 0;
public function push($val)
{
$this->stack[$this->count] = $val;
$this->count++;
}
public function pop()
{
if ($this->count > 0) {
$this->count--;
return $this->stack[$this->count];
}
return null;
}
public function incrementArgument()
{
while (($o2 = $this->pop()) !== '(') {
if (null === $o2) {
return false; // oops, never had a (
}
$output[] = $o2; // pop the argument expression stuff and push onto the output
}
// make sure there was a function
if (!preg_match("/^([a-z]\w*)\($/", $this->last(2), $matches)) {
return false;
}
$this->push($this->pop() + 1); // increment the argument count
$this->push('('); // put the ( back on, we'll need to pop back to it again
return true;
}
public function isEmpty()
{
return empty($this->stack);
}
public function last($n = 1)
{
if (isset($this->stack[$this->count - $n])) {
return $this->stack[$this->count - $n];
}
return null;
}
}