1 - 2 - 3 should parse as (1 - 2) - 3.

All border cells are walls.

Level 1 map has 256 cells (16x16).

Lexer produces tokens without errors.

Local variable declared inside a while loop compiles.

a and b or c should parse as (a and b) or c.

maxp.maxFunctionDefs is at least as large as the allocator requires.

maxp table has the required resource reservations.

maxp.maxStorage is at least as large as the allocator requires.

maxp resource reservations match the defaults.

Values in the DOOM game range should not overflow 32-bit.

2 + 3 * 4 should parse as 2 + (3 * 4).

DSL * operator generates MUL with 4096 compensation.

fixmul(a, b) should equal fixmul(b, a) within tolerance.

Multiplying by 1.0 should return the original value.

Simulated result should be close to the ideal computation.

Nested function calls compile correctly.

Values like 0.1 can't be exactly represented in 16.16. Verify that the algorithm itself is exact by comparing against the ideal resul

.notdef with custom dimensions produces correct coordinates.

.notdef glyph matches expected rectangle vertices.

.notdef glyph has exactly 1 contour.

.notdef glyph has exactly 4 points.

The output file loads correctly as a TTFont.

(2 + 3) * 4 should group addition first.

Parser produces a Program AST without errors.

Player spawn position (160, 160) -> cell (2, 2) is open.

Font file exists and is non-empty.

Glyph 'A' outline matches the expected rectangle vertices.

Glyph 'A' is a single-contour rectangle with exactly 4 points.

Glyph 'A' carries a non-empty hinting program.

Font contains fpgm and prep hinting tables.

Glyph 'A' hinting program contains SCFS instructions.

Glyph 'A' hinting program sets the Y-axis vector via SVTCA.

maxp table has the required resource reservations.

Font family name is 'DoomPOC'.

Glyph program pushes point indices 2 and 3 for SCFS.

Each bar has points in BL, BR, TR, TL order.

Each contour in the bar glyph has exactly 4 points.

generate_prep_load_tables produces the expected number of WS[].

The prep table contains variable initialisation instructions.

prep program can be disassembled without errors.

Prep must NOT reset player vars (they persist between frames).

prep table contains bytecode.

Storage indices > 255 use PUSHW.

Negative values use PUSHW.

Positive values in [0, 255] use PUSHB.

Storage indices in [0, 255] use PUSHB.

Each _push_and_store call ends with SWAP[] and WS[].

Assembly includes WS[] instructions for storing values.

Assembly stores values at the correct storage indices.

Each table entry produces 4 instructions (push val, push idx, SWAP, WS).

generate_prep_load_tables produces non-empty assembly.

prep loads non-zero map values into storage.

prep assembly contains many WS[] instructions for table loading.

prep begins with SVTCA[0] (set to Y-axis).