Moreover, you should think more on terms of what users of the language want, rather than what you wish to see for the language and then compromise/improvise :)
so unless aditsu reimplements ECMAScript regex in Java, it will be impossible to make the online interpreter and the Java interpreter use the same regex flavour
it uses stringification of a string. I am not sure how you rank stringification of a block farther away from a normal quine as compared to stringification of a string (or use of eval)
> So to make this possible anyway, we write the build the program from two parts, one which call the code and one which we call the data. The data represents (the textual form of) the code, and it is derived in an algorithmic way from it (mostly, by putting quotation marks around it, but sometimes in a slightly more complicated way).
I remember I worked on a project for a bank once, and they were having problems with it; I went to visit them, and found out that their systems guy had a very strict policy of using only IE3 on all computers (while IE5 was already out at that time)
had to modify some javascript and make it even clunkier :p
J, 102 characters
Let's get this started. Notice the absent exit; J prints a prompt (three blanks) after all the output has been written, but then gets an EOF on stdin, causing it to terminate.
I believe that quite a couple of improvements are possible in this code.
1!:2&4":(|.@$,,)256|(-p+[:(>&...
Analyzing Collatz-like sequences
code-golfnumbersequencemath
We define a Collatz-like sequence s with 4 positive integers:
n starting value
d > 1 divisor
m > 1 multiplier
i increment
(In the original Collatz sequence d = 2 m = 3 and i = 1.)
Given these integers s will be created in the fol...
I was thinking of asking a pure golf question about computing the longest common substring in linear time. Is it still code golf when you specify a time complexity?
how do you get people to answer in different languages? I would like to pose a graphical challenge so that we can see the shortest code in many languages
there used to be a skiing game where each line had a black square , a few grey ones then a black one. Consecutive lines could be shifted right or left and you have a little icon you had to navigate right and left so it didn't touch the borders :)
it might have been horace goes skiing for the ZX81 :)
Prelude Syntax-Checker
code-golfstringsyntaxprelude
Prelude is an esoteric programming language, which has very few, but unusual, restrictions on what constitutes a valid program. Any block of printable ASCII text is valid provided that:
Every column of text contains at most one of ( and ).
I...
Dyalog APL, 67 59 51 bytes
p←{⍵,⊂1,⍨+/¨⌽⍵↑¨⍨⌽⍳⍴⍵}⍣⎕⊢⍬⋄f←{⍵=0:⍬⋄a,a∇⍵-a←{1++/(?+/⍵)>+\⍵}⍺↑⍵⊃p}⍨ (67 bytes)
p is a vector of vectors in which p[n][k] is the number of partitions of n into k summands, or equivalently: the number of partitions with greatest summand k. We build p by starting with t...
hmm, if a question says the input will be a string than e.g. in J you can expect a 1-char string to be inputted as 1$'a' because 'a' wouldn't be a string just a char
I don't know how much you've been following it, but the plan right now it to create a large set of example problems that the 2D pattern-matching language should be able to match.
Fortnightly Challenge #6 - Language Design
Join us in the Fortnightly Challenge Chat to work out the details of this challenge!
2-D Pattern Matching
popularity-contestlanguage-designgridstring
And now for something completely different...
In this challenge, you will be designing a language! ...
Let me know how I can create a basic operating system.
What books do you recommend?
Analyzing Collatz-like sequences
code-golfnumbersequencemath
We define a Collatz-like sequence s with 4 positive integers:
n starting value
d > 1 divisor
m > 1 multiplier
i increment
(In the original Collatz sequence d = 2 m = 3 and i = 1.)
Given these integers s will be created in the fol...
Prelude Syntax-Checker
code-golfstringsyntaxprelude
Prelude is an esoteric programming language, which has very few, but unusual, restrictions on what constitutes a valid program. Any block of printable ASCII text is valid provided that:
Every column of text contains at most one of ( and ).
I...
Dyalog APL, 67 59 51 bytes
p←{⍵,⊂1,⍨+/¨⌽⍵↑¨⍨⌽⍳⍴⍵}⍣⎕⊢⍬⋄f←{⍵=0:⍬⋄a,a∇⍵-a←{1++/(?+/⍵)>+\⍵}⍺↑⍵⊃p}⍨ (67 bytes)
p is a vector of vectors in which p[n][k] is the number of partitions of n into k summands, or equivalently: the number of partitions with greatest summand k. We build p by starting with t...
