16
1
Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges. That is because Lenguage cares only about the length of it's source and not the contents.
First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zeroes to a multiple of 3. The resulting binary string is split into chunks of 3 bits each of which is translated into a brainfuck command as such:
000 -> +
001 -> -
010 -> >
011 -> <
100 -> .
101 -> ,
110 -> [
111 -> ]
Finally the program is run as brainfuck1.
From here the challenge is pretty simple, write a lenguage program that takes no input and produces an output consisting of one byte repeated integer \$n\$ times, where \$n\$ is strictly greater than the length of your program.
Answers will be scored in bytes with fewer bytes being better.
Here's a hacky program to calculate lenguage from brainfuck
1: For this challenge we will use wrapping cells and a non-wrapping tape.
3
+[.]
Do I win? :P – Quintec – 2019-02-01T02:04:40.8903Perhaps it might be more interesting to score on the length of the output? – Jo King – 2019-02-01T02:22:56.710
@JoKing That's a good idea. Unfortunately it appears to be a bit late for that. – Post Rock Garf Hunter – 2019-02-01T03:19:41.497
@Quintec Well, programs can''t have a leading
+
so no – Jo King – 2019-02-01T06:55:10.640For future reference, just because nobody has posted a solution to your challenge yet (or, in this case, only 1 person has) doesn't mean that there aren't people working on solutions that could be affected by a major change to a challenge's rules/spec. – Shaggy – 2019-02-01T21:45:05.307
@Jo King We can still do
.+[.]
– Embodiment of Ignorance – 2019-02-02T05:24:41.7402Also, why is this tagged quine? – Embodiment of Ignorance – 2019-02-02T05:25:04.940
@EmbodimentofIgnorance
produces an output consisting of **one byte** repeated n times
though something like>+[.]
works. I assume that the output has to be finite – Jo King – 2019-02-02T06:08:21.677@TRITICIMAGVS I would add the following to the sentence "where $n$ is strictly greater than the length of your program": ", and where the output is finite.", as to prevent infinite loops printing characters. – Kevin Cruijssen – 2019-02-02T16:14:53.390
@KevinCruijssen I've gone ahead and said that $n$ is an integer. – Post Rock Garf Hunter – 2019-02-02T16:39:53.247
If I understand your description correctly, Lenguage is translated into Brainfuck such that a longer L. program translates into a longer B. program and a shorter L. program translates into a shorter B. program. This is code golf. So why ask for L. programs rather than simply for B. programs with output of length at least 2^(3n)? – msh210 – 2019-02-02T18:36:14.587
1@msh210 That'll do the trick most of the time, but there are a few differences, for example different Brainfuck characters cost different amounts (
+
is the cheapest and]
the most expensive) and of course it matters where in the program they are. While $2^{3n}$ is a good estimate it is not exactly equivalent. – Post Rock Garf Hunter – 2019-02-02T18:44:44.997@EmbodimentofIgnorance Indeed, changed it to self-referential, which was split off from quine for exactly this sort of thing. – Ørjan Johansen – 2019-02-07T15:51:07.283