Bitwise Cyclic Teast

Bitwise Cyclic Teast (BCTp<string> or BCTps) is an esolang, it is a derivative of BCTp where the heap stores the whole data string..

Commands

Command	Execution
0	delete the 1st bit of smallest data string.
1	goto the next command (say x). If the smallest data string starts with 1, insert x into the data-string. then push current data string.

Data strings are compared reverse-lexicographically.

Example

Code: 00111
Data-string: 101
IP: 0    Data-heap: {}
IP: 1    Data-heap: {}
IP: 2    Data-heap: {}
IP: 4    Data-heap: {(1011)}
IP: 1    Data-heap: {(10110),1011}
IP: 2    Data-heap: {0110,1011}
IP: 4    Data-heap: {0110,(0110),1011}
IP: 1    Data-heap: {0110,0110,(0110),1011}
IP: 2    Data-heap: {110,0110,0110,1011}
IP: 4    Data-heap: {110,0110,0110,(1011),1011}

Interpreter

This is still a work in progress. It may be changed in the future.

Computational class

Unknown, but probably very limited.

See also

• Bitwise Cyclic Tag (BCT)
• Bitwise Cyclic Tack (BCTk)