<h1><i>Serais-Toi?</i></h1>
<p>Well, would you? Do you dare endeavour to harness such an untenable might as that of this?</p>
<p>Maybe.</p>
<p>Or maybe you're not strong enough. If you aren't, there's no shame in that… except for the fact that you are weak.</p>
<h2>Code Layout</h2>
<p><i>Serais-Toi?</i> is a language that will enable you to strike fear into your opponent's eyes, amaze them with the brevity of your code. But first, you must master this beast.</p>
<p>While this language is powerful, you must abide by it's terms. Firstly, if the program has an odd number of characters, the digit sum of your program (i.e. the sum of the ASCII charcodes of the program) <em>must be</em> (with <em>no exceptions</em>) a prime number. If it is even, it must be a multiple of 10 or a power of 2.</p>
<p>Yes, those are the Rigtheous and Just Rules of <i>Serais-Toi?</i>, the Untenable of The Spheres.</p>
<h2>Data Structure</h2>
<p><i>Serais-Toi?</i> implements a stack that can move element to a queue (basically a stack), which can then be outputted.</p>
<h2>Semantics</h2>
<p>A program is composed of a series of words, that is, instructions. Here is a dictionary of all the tokens, provided for your leisure.</p>
<table>
<tr>
<th>Command</th> <th>Effect</th>
</tr>
<tr>
<td>RECEVOIR</td> <td>Enqueues input</td>
</tr>
<tr>
<td>DONNER</td> <td>Enqueues the top element of the stack</td>
</tr>
<tr>
<td>PRENDRE</td> <td>Unenqueues the top element of the queue to the stack.</td>
</tr>
<tr>
<td>JETER</td> <td>Outputs the dequeued item.</td>
</tr>
<tr>
<td>TROUVER</td> <td>Pops a number <code>N</code> and enqueues the <code>N</code>th element of the stack</td>
</tr>
<tr>
<td>SEPT</td> <td>Pushes the number seven to the stack.</td>
</tr>
<tr>
<td>CHAÎNE</td> <td>Converts a number to a character and vice versa.</td>
</tr>
<tr>
<td>AJOUTER</td> <td>Adds top two entries.</td>
</tr>
<tr>
<td>LOGARITHME</td> <td>Pops <code>M</code> then <code>N</code>, and pushes the...