YAY! is a high level parser combinator based PHP preprocessor that allows anyone to augment PHP with PHP 💥

This means that language features could be distributed as composer packages (as long as the macro based implementations can be expressed in pure PHP code, and the implementation is fast enough).

Not ready for real world usage yet 💣

Roadmap.

composer require yay/yay:dev-master

yay some/file/with/macros.php >> target/file.php

The "runtime" mode is W.I.P and will use stream wrappers along with composer integration in order to preprocess every file that gets included. It may have some opcache/cache support, so files will be only preprocessed/expanded once and when needed.

See feature progress at issue #11.

Every macro consist of a matcher and an expander that when executed allows you to augment PHP. Consider the simplest example possible:

macro ·unsafe { $ } >> { $this } // this shorthand

The macro is basically expanding a literal $ token to $this. The following code would expand to:

// source                                |   // expansion
class Foo {                              |   class Foo {
    protected $a = 1, $b = 2, $c = 3;    |       protected $a = 1, $b = 2, $c = 3;
                                         |        
    function getProduct(): int {         |       function getProduct(): int {
        return $->a * $->b * $->c;       |           return $this->a * $this->b *$this->c;
    }                                    |       }
}                                        |   }

Notice that the ·unsafe tag is necessary to avoid macro hygiene on $this expansion.

Apart from literal characher sequences, it's also possible to match specific token types using the token matcher in the form of TOKEN_TYPE·label.

The following macro matches token sequences like __swap($x, $y) or __swap($foo, $bar):

macro {
    __swap ( T_VARIABLE·A , T_VARIABLE·B ) // swap values between two variables
} >> {
    (list(T_VARIABLE·A, T_VARIABLE·B) = [T_VARIABLE·B, T_VARIABLE·A])
}

The expansion should be pretty obvious:

// source              |    // expansion
__swap($foo, $bar);    |    (list($foo, $bar) = [$bar, $foo]); 

To implement unless we need to match the literal unless keyword followed by a layer of tokens between parentheses (...) and a block of code {...}. Fortunately, the macro DSL has a very straightforward layer matching construct:

macro {
    unless (···expression) { ···body }
} >> {
    if (! (···expression)) {
        ···body
    }
}

The macro in action:

// source                   |   // expansion
unless ($x === 1) {         |   if (! ($x === 1)) {
    echo "\$x is not 1";    |       echo "\$x is not 1";
}                           |   }

PS: Please don't implement "unless". This is here just for didactic reasons.

A more complex example could be porting enums from the future to PHP with a syntax like:

enum Fruits {
    Apple,
    Orange
}

var_dump(\Fruits::Orange <=> \Fruits::Apple);

So, syntactically, enums are declared with the literal enum word followed by a T_STRING and a comma separated list of identifiers withing braces {A, B, C}.

YAY uses parser combinators internally for everything and these more high level parsers are fully exposed on macro declarations. Our enum macro will need high level matchers like ·ls() and ·word() combined to match the desired syntax, like so:

macro {
    enum T_STRING·name {
        ·ls
        (
            ·label()·field
            ,
            ·token(',')
        )
        ·fields
    }
} >> {
    "it works";
}

The macro is already capable to match the enums:

// source                      // expansion
enum Order {ASC, DESC};    |   "it works";

I won't explain how enums are implemented, you can read the RFC if you wish and then see how the expansion below works:

// things here would normally be under a namespace, but since we want a concise example...

interface Enum
{
}

function enum_field_or_class_constant(string $class, string $field)
{
    return (\in_array(\Enum::class, \class_implements($class)) ? $class::$field() : \constant("{$class}::{$field}"));
}

macro ·unsafe {
    // the enum declaration
    enum T_STRING·name {
        ·ls
        (
            ·label()·field
            ,
            ·token(',')
        )
        ·fields
    }
} >> {
    class T_STRING·name implements Enum {
        private static $store;

        private function __construct() {}

        static function __callStatic(string $field, array $args) : self {
            if(! self::$store) {
                self::$store = new \stdclass;
                ·fields ··· {
                    self::$store->·field = new class extends T_STRING·name {};
                }
            }

            if ($field = self::$store->$field ?? false) return $field;

            throw new \Exception("Undefined enum field " . __CLASS__ . "->{$field}.");
        }
    }
}

macro {
    // sequence that matches the enum field access syntax:
    ·ns()·class // matches a namespace
    :: // matches T_DOUBLE_COLON used for static access
    ·not(·token(T_CLASS))·_ // avoids matching ::class resolution syntax
    ·label()·field // matches the enum field name
    ·not(·token('('))·_ // avoids matching static method calls
} >> {
    \enum_field_or_class_constant(·class::class, ··stringify(·field))
}

You can use https://github.com/marcioAlmada/yay-enums to run the example above on your own environment, as a playground.

More examples within the phpt tests folder https://github.com/marcioAlmada/yay/tree/master/tests/phpt

Why "YAY!"?

- PHP with feature "x": yay or nay? 😉

Where is the documentation?

Sorry, there is no documentation yet...

Why did you use a middle dot · character?

This is still just an experiment but you can find some research done on issue #1. I'm open to suggestions to have a more ergonomic macro DSL :)

Why TF are you working on this?

Because it's being fun. It may become useful. Because we can™.

For now this is an experiment about how to build a high level preprocessor DSL using parser combinators on a languages like PHP. Why?

PHP is very far from being homoiconic and therefore requires complex deterministic parsing and a big AST implementation with a node visitor API to modify source code - and in the end, you're not even able to easily process unknown syntax ¯\_(⊙_ʖ⊙)_/¯.

That's why this project was born. It was also part of the challenge:

0. Create a minimalistic architecture that exposes a subset of the internal components, that power the preprocessor itself, to the user DSL.
1. Create parser combinators with decent error reporting and grammar invalidation, because of 1

Copyright (c) 2015-* Márcio Almada. Distributed under the terms of an MIT-style license. See LICENSE for details.