Talk:SendStuff
From Esolang
[edit] Hello, World!
Hmmm... interesting.
>(Add 72 >(Output) #H
>(Add 29 >(Output) #e
>(Add 7 >(Output) #l
>(Output) #l
>(Add 3 >(Output) #o
>(Sub 67 >(Output) #,
>(Sub 12 >(Output) #
>(Add 55 >(Output) #W
>(Add 24 >(Output) #o
>(Add 3 >(Output) #r
>(Sub 6 >(Output) #l
>(Sub 8 >(Output) #d
>(Sub 67 >(Output))))))))))))) #!
Am I correct?
--Seven Inch Bread 18:18, 19 November 2007 (UTC)
Yes, that will work. The specification I posted does not allow abbreviating Subtract to Sub, but some interpreter might be madde that does allow that, and if it does, then it will work. --Zzo38 19:43, 22 November 2007 (UTC)
I'd personally prefer +, -, *, /, and mod for the math operators. Mainly because of laziness but also because of aesthetics. --Seven Inch Bread 19:56, 22 November 2007 (UTC)
[edit] Concurrency
What would happen in a program like this:
>start(
>(Add 1 >start)
>(Add 2 >start)
>(Add 3 >start)
)
...where all of the child nodes begin a recursive loop. Does the interpreter handle child nodes concurrently or in linear order? --Seven Inch Bread 18:26, 19 November 2007 (UTC)
There is no interpreter (yet), but how it is supposed to work is the Add 2 and Add 3 commands are never get a chance to execute because the Add 1 sends the result to start and since the number can be any size, it will just continue in a infinite loop unbounded and will waste too much memory because it is expecting it to do the next commands, Add 2 and Add 3 commands, so it will keep it in memory that it is supposed to go back there and continue the next command (for each iteration of start --> Add 1 --> start, etc, but it never will. --Zzo38 19:41, 22 November 2007 (UTC)

