|Computational class||Turing complete|
|Influenced by||TEWNLSWAC, Terse|
- This article is a stub, which means that it is not detailed enough and needs to be expanded. Please help us by .
Pronounced eks-too-whack, XTW is the successor of TEWNLSWAC.
There is a brainfuck implementation in XTW to proof turing-completeness: https://github.com/zserik/zxtw/blob/master/examples/bf.xtw
||<label> ( <optional: arguments> )|| call function beginning at label,
the different handling of syntax for "no arguments" is needed
to distinguish between call (<label>) and expand (<variable>).
new Syntax elements
||3 → 0||check for type equality|