Quine Relay!

A quine relay of order \$n\$ is a series of programs \$P_1\dots P_n\$ in distinct languages such that each program \$P_i\$ outputs \$P_{i+1}\$ and \$P_n\$ outputs \$P_1\$.

For example, a 2-quine relay can be seen here:

Ruby &rightarrow; Perl 6:

This Ruby program:

$><<"print ("
p (DATA.read*2).chars.map(&:ord)
$><<".map: &chr).join"

__END__
$><<"print ("
p (DATA.read*2).chars.map(&:ord)
$><<".map: &chr).join"

__END__

outputs this Perl 6 program:

print ([36, 62, 60, 60, 34, 112, 114, 105, 110, 116, 32, 40, 34, 10, 112, 32, 40, 68, 65, 84, 65, 46, 114, 101, 97, 100, 42, 50, 41, 46, 99, 104, 97, 114, 115, 46, 109, 97, 112, 40, 38, 58, 111, 114, 100, 41, 10, 36, 62, 60, 60, 34, 46, 109, 97, 112, 58, 32, 38, 99, 104, 114, 41, 46, 106, 111, 105, 110, 34, 10, 10, 95, 95, 69, 78, 68, 95, 95, 10, 36, 62, 60, 60, 34, 112, 114, 105, 110, 116, 32, 40, 34, 10, 112, 32, 40, 68, 65, 84, 65, 46, 114, 101, 97, 100, 42, 50, 41, 46, 99, 104, 97, 114, 115, 46, 109, 97, 112, 40, 38, 58, 111, 114, 100, 41, 10, 36, 62, 60, 60, 34, 46, 109, 97, 112, 58, 32, 38, 99, 104, 114, 41, 46, 106, 111, 105, 110, 34, 10, 10, 95, 95, 69, 78, 68, 95, 95, 10]
.map: &chr).join

which in turn outputs the original Ruby program.

The challenge

The first answer will be an order \$1\$ quine relay: a normal quine. It can be in any language.

The next answer will choose a different language and create an order \$2\$ quine relay using those two languages.

And so on. The \$k\$-th answer will create an order \$k\$ quine relay using the previous \$k - 1\$ languages and a new, different language.

Winning

If, after 2 weeks, no more answers have been added, the winner is the person who answered with the highest-order quine relay.

More rules

No person may answer twice in a row.
No person may answer within an hour of their most recent post.
Languages which differ by version are considered distinct. Thus, Python 2 and Python 3 can both be part of the chain.
Languages which differ by compiler or interpreter are not considered distinct. So, Python 3 (Cython) and Python 3 are considered interchangeable but not distinct.
Each answer may order the languages in any way. If the third answer has an order of Ruby &rightarrow; Perl 6 &rightarrow; JavaScript, you are not restricted to appending a language to the end. If you were adding Java to the mix, then you could write JavaScript &rightarrow; Ruby &rightarrow; Java &rightarrow; Perl 6 if you so desired.

Format for answers

n. Language₁ &rightarrow; Language₂ &rightarrow; … &rightarrow; Language_n

Language₁
language 1 code
Language₂
language 2 code
Language₃
language 3 code
…

Language_n
language n code

Feel free to add explanations anywhere in your answers.

Conor O'Brien

Posted 2018-08-09T23:38:31.543

Reputation: 36 228

3You should add something like a 2 character minimum to prevent degenerate quine chains such as the empty string. Also, something to prevent languages that by default echo output their input. Alternatively, you can roll these into one by requiring that all outputs in the chain must be unique. – Yonatan N – 2018-08-10T02:53:36.170

@YonatanN Actually once enough languages get added it would be hard to pull that off... would be interesting to see someone try. Although I think all so far have empty quines. – Ørjan Johansen – 2018-08-10T02:56:45.650

@ØrjanJohansen as of now, someone can trash the question by using a Bubblegum-type language and an empty input. – Yonatan N – 2018-08-10T02:59:51.507

1@YonatanN Hm yeah I guess there are too many ways to abuse it. (Also this kind of thing is why other answer chaining questions give the win to the second last answer.) – Ørjan Johansen – 2018-08-10T03:03:37.210

3@YonatanN 0 or 1 character quines usually do not meet our standard definition of quine – Conor O'Brien – 2018-08-10T03:30:37.900

Answers

10. Javascript → Foo → brainfuck → Wumpus → Gol><> → RAD → ><> → Python 2 → Brain-Flak → 4

Edit: For the next answer, I've golfed how the Python generates the Brain-Flak a bit more here, but I can't be bothered to update the links.

Added Gol><>. It's just a short rpH after the Wumpus code. I've also optimised the brainfuck and Brain-Flak code somewhat. Verification!

JavaScript (Node.js)

(f=_=>{q=(c=String.fromCharCode)(39);Q=c(34);b=c(96);x=0;console.log(Q+[...`${Q}99+&;75*1-l2:8-&o@rpH${q}${q+q}rpp>o<def n(x):global l;r=p+p+f+F+P+q+(p+P)*(l-x)+Q+P if x<l else p+p+f+F+P+(p+P)*(x-l)+P;l=x;return r;''a''p=chr(40);P=chr(41);q=chr(91);Q=chr(93);f=chr(123);F=chr(125);l=4;print p+p+p+p+p+p+P+p+P+p+P+P+f+F+P+f+F+p+P+P+f+F+P+f+F+P,str().join(map(n,map(lambda x:ord(x)-48,str().join(map(lambda c:${b}600${b}+(str(c-99).zfill(2)+${b}99500${b}.zfill(10) if c>99 else str(c).zfill(2)+${b}500${b}),[`+[...`(f=${f})()`].map(c=>c.charCodeAt())+`]))[::-1]+${b}99996${b}))),${[...'pppppppPpPPfFpPPfFpPPfFpPPfFPppPpPPfFpPP'].join`+`}${q}`].map(s=>c(43).repeat(Math.max(-x+s.charCodeAt(),0))+c(45).repeat(Math.max(x-(x=s.charCodeAt()),0))+c(46)).join(c()).match(/.{1,253}/g).join(c(10)+Q))})()

Q​u​i​n​e R​e​l​a​y​!

Quine Relay!

Ruby &rightarrow; Perl 6:

The challenge

Winning

More rules

Format for answers

n. Language1 &rightarrow; Language2 &rightarrow; … &rightarrow; Languagen

Language1

Language2

Language3

Languagen

Answers

10. Javascript → Foo → brainfuck → Wumpus → Gol><> → RAD → ><> → Python 2 → Brain-Flak → 4

3. JavaScript → Python 2 → Foo

JavaScript

Python 2

Foo

1. Foo

Foo

2. Python 2 → Foo

5. ><> → JavaScript → brainfuck → Python 2 → Foo

><>

JavaScript

brainfuck

Python 2

Foo

9. JavaScript → Foo → Brainfuck → Wumpus → RAD → ><> → Python 2 → Brain-Flak → 4

JavaScript

Foo

brainfuck

Wumpus

RAD

><>

Python 2

Brain-Flak

4

4. ><> → JavaScript → Python 2 → Foo

6. ><> → JavaScript → brainfuck → Python 2 → Brain-Flak → Foo

7. ><> → JavaScript → RAD → brainfuck → Python 2 → Brain-Flak → Foo

><>

JavaScript

RAD

brainfuck

Python 2

Brain-Flak

Foo

8. ><> → Wumpus → JavaScript → RAD → brainfuck → Python 2 → Brain-Flak → Foo

Quine Relay!

n. Language₁ &rightarrow; Language₂ &rightarrow; … &rightarrow; Language_n

Language₁

Language₂

Language₃

Language_n