@StephenLeppik even then, you should probably read the thread. Language is nigh impenetrable without it
I mean, you can figure out enough to write a program from the barebones spec
Like, i'm not even kidding. https://bitbucket.org/thomas_bartscher/poslin-specification/src/0f7c09ad5da7a9044cf9df51735049ad92ba9451/libs/base.poslin?at=default&fileviewer=file-view-default
it becomes slightly more readable as you go down the file (Less primitives, more macros), but even then
to note, ;[ and ]; begin and end comments. (They are macros that just remove the text between them.)
Also, note that the type system tutorial describing the type system, which is entirely based around macros, isn't a normal part of the language (it's a library for it)
which I believe is because of Value | IndexAccess. The Value branch won't parse the entire expression if there's a [ after it so then it needs to backtrack. I should probably do (Value, OPTIONAL(IndexAccessComponent)) because that way it doesn't need to backtrack the entire branch
Introduction
This challenge was inspired by semicolon-#.
Deadfish is a non-Turing-complete programming language, created by Jonathan Todd Skinner. It has an accumulator register and contains 4 commands, i, d, s, and o, standing for increment, decrement, square, and output, respectively. While t...
I am planning on running a KoTH where each bot individually plays a game, it is a 1 player game so they don't fight each other. Is it still a KoTH or should I do it as a code-challenge?
I'm actually quite satisfied with the outcome of the Kolmogorov shifter challenge. There's a huge variety among the answers, and lots of different approaches being used. Well done guys and girls! :)
I asked a challenge to interpret deadfish here, but it got closed for being a duplicate of a challenge to write an interactive deadfish interpreter here. Is this really a duplicate?
@cairdcoinheringaahing I hope so :P I honestly wish the election was just over. At this point, there's so little activity, the only thing I can do is wait, and it stresses me out to think about losing
Yep. Say for example you claim to have voted for A and B, and then C wins. It would be awkward interacting with a candidate who knows you didn't want them to win.
A1: I voted for X1, Y2 and Y5
B1: How dare you didn't vote for X2 they're the best person ever!
B2: X2? You're kidding me, they aren't worth more than a potato!
...
CMC: Interleave-sort a list. Given a list of unsorted items, return a list of [(the smallest), (the largest), (the 2nd smallest), (the 2nd largest) ...]. Example: [4,2,1,5,3,7] -> [1,7,2,5,3,4].
@DJMcMayhem make sense. I just suspected you wanted to use fooIndex to be passed as-is, therefore making the whole thing doStuff = FooControl.SetFooState
@H.PWiz Yes, but I am honestly not able to say who deserves it. So the Best of would have been a way to give some bounties without having to decide myself on who.
A permutation of size n is a is a reordering of the first n positive integers. (meaning each integer appears once and exactly once). Permutations can be treated like functions that change the order of a list of items of size n. For example
(4 1 2 3) ["a", "b", "c", "d"] = ["d", "a", "b", "c"]...
Introduction
This challenge was inspired by semicolon-#.
Deadfish is a non-Turing-complete programming language, created by Jonathan Todd Skinner. It has an accumulator register and contains 4 commands, i, d, s, and o, standing for increment, decrement, square, and output, respectively. While t...
I am planning on running a KoTH where each bot individually plays a game, it is a 1 player game so they don't fight each other. Is it still a KoTH or should I do it as a code-challenge?
A permutation of size n is a is a reordering of the first n positive integers. (meaning each integer appears once and exactly once). Permutations can be treated like functions that change the order of a list of items of size n. For example
(4 1 2 3) ["a", "b", "c", "d"] = ["d", "a", "b", "c"]...
