« first day (157 days earlier)      last day (59 days later) » 

Anonymous
6:54 AM
 
Anonymous
8:53 AM
room topic changed to Seriously: Discussion about golfing in Seriously and further development of the language. Try it online: seriously.tryitonline.net [code-golf] [golfing-language] [language-design]
 
Kenny Lau
Kenny Lau
Actually?
 
Anonymous
room topic changed to Seriously: Discussion about golfing in Seriously and further development of the language. Try it online: seriously.tryitonline.net [golfing-language] [language-design]
 
Anonymous
room topic changed to Seriously: Discussion about golfing in Seriously and further development of the language. Try it online: seriously.tryitonline.net [eldritch-horrors] [golfing-language] [language-design]
 
Anonymous
room topic changed to Seriously: Discussion about golfing in Seriously and its successor, Actually, and further development of the languages. Try it online: seriously.tryitonline.net actually.tryitonline.net [eldritch-horrors] [golfing-language] [language-design]
 
Kenny Lau
Kenny Lau
9:06 AM
@Mego How would you do Fibonacci recursively? (I am aware that an official Fibonacci exists)
 
 
2 hours later…
zyabin101
zyabin101
10:54 AM
@Mego Can I DROP (silently pop) an item (one item) from the stack? If so, how?
 
Kenny Lau
Kenny Lau
@zyabin101 X
Documentation: 58 (X): pop a: discard
 
zyabin101
zyabin101
Thanks. Also, is 1 2 3 4 ==> 4 1 2 3 rightward or leftward?
 
Kenny Lau
Kenny Lau
11:10 AM
123)+* produces 9
that means ) pops the top of the stack and moves it to the bottom
 
zyabin101
zyabin101
Okay.
So, pushing a copy of top of stack is easy: 1; ==> 1 1. But how to push a copy of second to top of stack? (1 2 ==> 1 2 1)
 
Kenny Lau
Kenny Lau
@zyabin101 How many items are there in your stack?
 
zyabin101
zyabin101
@KennyLau At least two.
 
Kenny Lau
Kenny Lau
╗;╜@
@zyabin101 But why would you need to do this in the first place?
 
zyabin101
zyabin101
@KennyLau Erm, I'm making a new esoteric language.
 
Kenny Lau
Kenny Lau
11:23 AM
I mean, you only need to do this after you've put the two things in the stack.
If you can insert code before it, you can save 2 bytes
And in some situation you don't need to do it at all
 
Kenny Lau
Kenny Lau
12:08 PM
@Mego Thought about adding translate?
 
 
4 hours later…
Anonymous
3:47 PM
@KennyLau Recursion is hard to do right now because there isn't language support for it (other than a hack with Q). It's something I will add once I figure out how I want to do it.
 
Kenny Lau
Kenny Lau
nice :)
 
Anonymous
On all of the examples, the top of the stack is the left. To dupe the second item, do );( ([1, 2] => [1, 2, 2])
 
Anonymous
Typing on a phone keyboard is hard
 
Kenny Lau
Kenny Lau
@Mego But what do you do to get them to the desired position?
 

« first day (157 days earlier)      last day (59 days later) »