@@ -23,15 +23,15 @@ final class BooleanExpressionsTest extends TestCase
2323 /** @test */
2424 public function booleanExpressions ()
2525 {
26- $ token = fn (Parser $ parser ) : Parser => keepFirst ($ parser , skipHSpace ());
27- $ parens = fn (Parser $ parser ): Parser => $ token (between ($ token (char ('( ' )), $ token (char (') ' )), $ parser ));
28- $ term = fn (): Parser => $ token (choice (
26+ $ token = static fn (Parser $ parser ) : Parser => keepFirst ($ parser , skipHSpace ());
27+ $ parens = static fn (Parser $ parser ): Parser => $ token (between ($ token (char ('( ' )), $ token (char (') ' )), $ parser ));
28+ $ term = static fn (): Parser => $ token (choice (
2929 string ("TRUE " )->map (fn ($ v ) => new True_ ),
3030 string ("FALSE " )->map (fn ($ v ) => new False_ ),
3131 ));
32- $ NOT = unaryOperator ($ token (string ("NOT " )), fn ($ v ) => new Not_ ($ v ));
33- $ AND = binaryOperator ($ token (string ("AND " )), fn ($ l , $ r ) => new And_ ($ l , $ r ));
34- $ OR = binaryOperator ($ token (string ("OR " )), fn ($ l , $ r ) => new Or_ ($ l , $ r ));
32+ $ NOT = unaryOperator ($ token (string ("NOT " )), static fn ($ v ) => new Not_ ($ v ));
33+ $ AND = binaryOperator ($ token (string ("AND " )), static fn ($ l , $ r ) => new And_ ($ l , $ r ));
34+ $ OR = binaryOperator ($ token (string ("OR " )), static fn ($ l , $ r ) => new Or_ ($ l , $ r ));
3535
3636 $ expr = recursive ();
3737 $ expr ->recurse (expression (
0 commit comments