Linked Questions

87
votes
4answers
2k views

Let's allow newer languages/versions for older challenges

I've been thinking for a long time that our non-competing policy for newer languages (or language versions) is harmful. Just for context, we currently require all answers which require implementations ...
34
votes
4answers
431 views

If languages are defined by their implementations, how do we judge answers that can't run on any existing computer?

It's a fairly long-standing principle of PPCG that languages are defined by their implementations; in other words, the language specification is entirely ignored, and we look at the behaviour of an ...
27
votes
1answer
953 views

Untestable languages

What is the general feeling about answer that can't be tested because no compiler or interpreter is available? The accepted answer to this question is a case in point. The question has been raised in ...
22
votes
2answers
439 views

Old Languages with new implementations [duplicate]

I was hoping to answer a question using a particular cellular automaton that was defined 17 years ago (before the question was asked) but for which I am unable to find a free interpreter on the ...
11
votes
1answer
260 views

Is a transliteration tool enough to grant count as SBCS?

Prompted by this. I'll speak about Dyalog APL here, but this could really apply to any language. Background Dyalog APL has its own SBCS called ⎕AV. For backwards ...
10
votes
2answers
981 views

Codegolf rules and boundaries

So last time, I was hanging on codegolf, and came across the question Print the digital root, where one guy replied here with a one-byte code. Of course, it takes advantages of the built-in and ...
6
votes
4answers
1k views

How are bytes counted in assembly?

I was told bytes in assembly are counted by the byte of machine code. Is that true? If so what steps should be taken to correctly get bytes?
3
votes
3answers
186 views

How do you handle an existing interpreter that, due to typos, doesn't function at all? [duplicate]

I've been considering answering a question in Super Stack!, specifically via use of this interpreter. However, the interpreter fails to compile, because there are two mistakes in it: it's incorrectly ...
1
vote
1answer
53 views

Judging the score of physically constructed electronic logic

How would physically constructed logic be scored? Say, for example, a mixture of resistors, diodes, wires, and 74xx/4000 type ICs. Handmade logic fits the "programming language" criteria, as using ...
1
vote
0answers
67 views

Is a slightly changed compiler allowed? [duplicate]

Some maybe not-intended-to-program languages may have some extra limitations. Is it allowed to change it to solve a problem? If so, how the length go? p.s. marking this topic as duplicate of this ...
1
vote
0answers
78 views

Can a specification define a language?

The current meta consensus is that the implementation defines the language. The cannonical answer is: What's the policy on interpreter bugs? I think this is too rigid: I think that a ...
0
votes
0answers
69 views

Code golf: is an invalid but working solution acceptable? [duplicate]

Suppose one answers a code-golf challenge for a language with a solution which is ill-formed according to the spec of the selected language. "But it works nonetheless with all major interpreters". ...
0
votes
0answers
77 views

Does fixing an implementation bug renders the answer non-competing? [duplicate]

In this thread, it is accepted that answers that use a new version of a language created after the challenge was posted are non-competing, because otherwise people would implement new built-ins that ...
-4
votes
2answers
277 views

A Standard HTML, CSS and JavaScript Parser/Interpreter

Perhaps, HTML, CSS and JavaScript have the most number of interpreters. Every browser is an interpreter of them. And each interpreter varies significantly in terms of implementation of certain aspects ...