« first day (2375 days earlier)      last day (2461 days later) » 

11:00 PM
I too have made some pretty cool explosions
 
@PhiNotPi that's also a good idea xD
 
what I'm wondering is why stack.push(1) pushes 3
it seems that anything will push the value of whatever came before it rather than the real value
 
Well clearly it's not actually doing stack.push(1)
Any way I could see the code?
 
It's... quite long
anything that says "Initial Commit" is pretty much legacy code
 
Yeah I can't really wade through it all atm...
 
11:11 PM
well I got it
 
Are you doing something along the lines of parsing a literal into a function that pushes it?
 
@BusinessCat yes
I think it's because of pass-by-reference/name or something like that
I just made it extremely clunky and it works now
 
Yeah
I have Gaia set up the same way
 
ah I see :P
 
0
A: Sandbox for Proposed Challenges

Simply Beautiful ArtCan you surpass Γ0? Can you make a function that grows faster than Feferman–Schütte ordinal (a.k.a. Γ0 or φ(1,0,0)) level in the fast growing hierarchy? For those unfamiliar with what all the above gibberish means, I recommend watching Giroux Studios' video series on the fast growing hierarchy....

 
11:12 PM
And I had to make functions that would return the function for the literal
Because otherwise it would use the last seen value
 
hey and that also fixed the problem with functions showing up on the stack rather than the values they're meant to contain \o/
 
If that makes sense, I'm bad at explaining
 
Yeah it makes sense (since it's exactly what was happening to me xD)
And yay first semi-working version \o/
 
My parser has a ton of messy (lambda x:lambda stack:...)(x)
 
11:18 PM
@BusinessCat i've done that lol
 
Oh yeah ,,,'s interpreter's like that
It's messy af
 
my language is now a language
it can add and check primality
using the two functions it has xD (and I still need to make things autovectorize)
anyway gtg now o/
 
Bye
I used ,,, before it was a language :3
Nobody noticed because nobody bothered to look lol
 
I should probably make a better Turtlèd interpreter
 
Everyone should probably make a better <insert language here> interpreter
 
11:22 PM
The tag is pitiful, it has three questions and zero answers
 
ok but the Turtlèd interpreter is really bad
 
Most esolang interpreters are badly written
 
@Uriel Why did you delete your Headsecks answer?
 
@totallyhuman I think mine are written decently
 
@totallyhuman it's written badder
my sad-flak interpreter is decent
 
11:23 PM
Mine aren't too complicated though
 
good, even
 
Mine is mostly ok, except for a lot of really hacky stuff and huge bugs that I hadn't noticed until today
 
commands = {
    '+': # addition or concatenation
    lambda stacks, stk_no, stack: stack.push(stack.pop(-2) + stack.pop()),
    '-': # subtraction
    lambda stacks, stk_no, stack: stack.push(lit_eval(stack.pop(-2)) - lit_eval(stack.pop())),
 
you're weird
what I mean of my interpreter is it is incredibly inefficient
 
@totallyhuman that's basically what mine looks like, except it gets passed stuff and there's no stack :P
 
11:30 PM
I like my sadflak interpreter because I made a parser for it
 
@DestructibleLemon all of my langs have lexer+parser+interpreter in one
just makes my life easier since I copy/paste the basics, and then I can abstract it all
 
yeah, the parser is in the same file
 
@totallyhuman Still much shorter than RProgN2's.
package rprogn.callables.arithmetic;


import rprogn.callable.tacted.CallableTacted;
import rprogn.callables.Callable;
import rprogn.functions.Scope;
import rprogn.interpreter.Interpreter;
import rprogn.variable.Var;
import rprogn.variable.VarCallable;
import rprogn.variable.VarNumber;
import rprogn.variable.VarStack;
import rprogn.variable.VarString;

public class CallablePlus implements Callable {

	@Override
	public void Call(Interpreter interpreter, Scope scope) {
		Var a = interpreter.pop();
That's just the + atom.
 
YAY! My lang is good at something
 
What would that be?
 
11:34 PM
1
Q: Range, Reverse, Sum!

Comrade SparklePonyGiven a positive integer n as input, output the reversed range sum of n. A reversed range sum is created by making an inclusive range up to n, starting with 1 and including n, reversing each of the numbers inside, and summing it. Example: Here is what would happen for an input of 10: Range: [...

 
1
A: Range, Reverse, Sum!

Step HencQuents, 4 bytes ;\r$ Try it online! Explanation Implicit input n. ; Series mode. Outputs the sum of the sequence from 1 to n. \r$ Each item in the sequence equals: \r String reverse of $ current index (1-based)

 
I was just about to tackle that challenge in RProgN2, but the problem is to inverse the number is Ø.in
 
Ø. appends nothing, which stringifies the number. i reverses the string, and n converts back to a number.
 
and... of course 05AB1E can do it in 3 bytes.
 
11:39 PM
I reckon it wouldn't be too hard to do in Turtlèd
still verbose though
 
@HyperNeutrino thanks for suggesting a string reverse function :)
 
0
A: Range, Reverse, Sum!

Adnan05AB1E, 3 bytes Code LíO Uses the 05AB1E encoding. Try it online! Explanation L # Range í # Reverse O # Sum

Lol
 
8 Bytes ;-;
 
@totallyhuman Maybe I should have made reverse 1 byte instead of 2 :P
 
Whoo I hit 5k :D
 
11:42 PM
If stringify was one byte I could shave off 2 bytes...
³sinS+, assuming s is the stringify atom.
 
@totallyhuman Go look at some site analytics
 
@StepHen D: you don't have string reverse
 
@ASCII-only I didn't, I implemented it a couple days ago
I don't have strings, so...
 
:/ what
 
11:45 PM
RProgN2 really doesn't like treating numbers as strings.
 
@ASCII-only It's a language based on numeric sequences, what use do I have for strings? :P
wait wait wait wait
...
 
why is this happening
 
Why is what happening?
 
11:46 PM
oh wait I'm dumb ignore me
 
I thought the Range, Reverse, Sum thing was just the triangular numbers
but I'm dumb like I said
 
Wait halp how do you ignore on mobile
 
@flawr What's the fourth language in your challenge? Fiasta naziunala svizra A variation of Italian?
 
Using JS as Input Validation
 
11:59 PM
ebay validation too
 

« first day (2375 days earlier)      last day (2461 days later) »