D 2018-06-22T07:13:25.377
L Preprocessor
U zzo38
W 399
TODO: Describe the preprocessor
Computational class
It is believed to be Turing-complete, because a [http://esolangs.org/wiki/Tag_system|tag system] can be implemented, for example:
{define "skip" {call \2}}
{define "1" {skip \1|"3"|"3"|"2"|"1"|"H"}}
{define "2" {skip \1|"3"|"3"|"1"}}
{define "3" {skip \1|"3"|"3"}}
{define "H" \1}
{call "2"|"1"|"1"}
Z 0f8b4972d526a70a6e96b2a893ebf17f