Binary Tree grammar using  " "

In order to free ourselves from any residual textism, we present this version of the grammar which has two rules called  " ".

This form of the grammar also works with the parser, enabling it to parse the complex tree. It was necessary to change the syntax of the visual grammar notation to distinguish visual literals from name-shapes.