From Esolang
Jump to navigation Jump to search

Language specification

If popping from an empty stack is not allowed, then there is no way to detect the size of the input. Either there must be some special value (such as 0 or -1) at the bottom of stack 0 at the beginning, or some stack must contain the length of the input. Can you please clarify that in the article. Also, regarding the "add cell" in the brainfuck conversion - this invalidates the Turing completeness proof. The correct way would be to store the total size of stacks 0 and 1 (used as the tape) and if the size reaches 0 then add an extra cell. That should be the part of instructions < and >. --Hakerh400 (talk) 15:11, 12 September 2023 (UTC)

Thanks for your advises, I have changed content about input. The problems on < and >. is still solving. --GUAqwq (talk) 11:11, 15 September 2023 (UTC)

I have maken another version of >. It can detect -1 at the bottom of stack1, and push a new 0 to stack1 as the new cell. But it's really complex, can somebody optimize it? --GUAqwq (talk) 12:55, 15 September 2023 (UTC)