Num Rect

Num Rect is a variant/encoding of RECT4n=GLE that is 1 dimensional, and may be useful for reasoning about the language itself. It is a sort of run length encoding.

Encoding

Every program takes the form:

symbol        | symbol        | symbol        |
number number | number number | number number | 

and so on. The first number(let's call it x) is expanded to binary. Then we look at it in the following format:

T10T20T30...Tn

then we use the given binary number with the symbol to create a RECT4n=GLE tile. Say we have the two terms T1 and T2. We read these as unary values of 1(with one subtracted from T2). Then we repeat the symbol T1 times, and shift it left with spaces by the value of T2. Then this will be row 1 of the tile. Then the second row will be the second term pair, and so on. For the final term, if theres no second term the shift is assumed 1. Then the second number y is read as the y coordinate of the left and uppermost corner(even if that space is a space), with 0 is the top of the program. Then thats one tile, and then for the next | separated part of the program is read in the same way, and so on. Note that trailing 0 is assumed.

Example/Translation

For the program:

A BB
A  BC
AA B

Would be encoded as:

A      | B       | C    |
5466 0 | 27350 0 | 10 1 |

Which is an infinite loop.