Files
pplus-core/tests/reference.test.mjs
T
2026-10-05 03:03:38 +00:00

130 lines
8.2 KiB
JavaScript

// The reference is only trustworthy if its examples run through the real parsers.
import test from 'node:test';
import assert from 'node:assert/strict';
import { REFERENCE, PSEUDO_REF, LINGO_REF, SPECO_REF, ASM_REF, MATHO_REF, explain, SPECO_SYMBOLS } from '../dist/core/reference.js';
import { parseMatho } from '../dist/services/matho.js';
import { studyOf } from '../dist/services/pseudo.js';
import { readLingo } from '../dist/services/lingo.js';
import { parseSpeco, toAscii, toMath } from '../dist/services/speco.js';
import { parseAsm } from '../dist/services/asm.js';
import { KEYWORDS, BUILTINS } from '../dist/engines/pseudo/lang.js';
import { OPS } from '../dist/engines/asm86/interp.js';
test('every pseudocode statement example parses and checks', () => {
const sec = PSEUDO_REF.sections.find((s) => s.id === 'pseudo-statements');
for (const e of sec.entries) {
const st = studyOf(e.example);
const errs = st.diagnostics.filter((d) => d.severity === 'error');
assert.equal(errs.length, 0, `${e.term}: ${errs.map((d) => `L${d.line} ${d.message}`).join(' | ')}`);
}
});
test('every keyword in the engine has a meaning in the reference, and vice versa', () => {
const sec = PSEUDO_REF.sections.find((s) => s.id === 'pseudo-keywords');
const listed = new Set(sec.entries.map((e) => e.term));
for (const k of KEYWORDS) assert.ok(listed.has(k), `keyword ${k} is missing from the reference`);
for (const e of sec.entries) assert.ok(e.meaning.length > 10, `${e.term} has no meaning`);
for (const b of Object.keys(BUILTINS)) assert.ok(explain('pseudo', b), `built-in ${b} has no hover`);
});
test('every lingo sentence example reads (inside a minimal routine where needed)', () => {
const failures = [];
// kinds for every name the examples mention, so a fragment reads the same way it does on the page
const kinds = 'T is a text. P is a text. S is a text. w is a text. A is a whole number. Score is a whole number.';
const setup = [
'Start with Count at 0.', 'Start with Best at 0.', 'Start with Run at 0.', 'Start with Left at 3.', 'Start with window at "AC".',
'Start with an empty list called Starts.', 'Start with an empty tally called Counts.', 'Start with an empty text called R.',
];
const defs = "The complement of b is 'T' when b is 'A', and 'N' otherwise.";
for (const sec of LINGO_REF.sections.filter((s) => s.id.startsWith('lingo-forms'))) {
for (const e of sec.entries) {
if (!e.example) continue;
const ex = e.example.trim();
const examples = ex.includes(' ') && !/^To /.test(ex) && !/ when /.test(ex) ? ex.split(/\s{2,}/) : [ex];
for (const one of examples) {
let src;
const head = 'To test T, P, S, w, A, B and Score:';
const pre = setup.map((l) => ' ' + l).join('\n');
if (/^The answer is/.test(one)) src = `${head}\n${pre}\n Start with i at 0.\n ${one}\n\n${kinds}`;
else if (/^To /.test(one)) src = `${one}\n${pre}\n The answer is Count.\n\n${kinds}`;
else if (/ when /.test(one) || /^The .* is /.test(one)) src = `To test P, T, S and b:\n Start with i at 0.\n If b is 'A', add 1 to i.\n The answer is the length of T plus the length of P plus the length of S plus i.\n\n${one}${/[.:]$/.test(one) ? '' : '.'}\n\nP is a text. T is a text. S is a text. b is a letter.`;
else if (/^(For|Repeat)/.test(one)) src = `${head}\n${pre}\n${/^For (each|every) .*\bi\b/.test(one) ? '' : ' Start with i at 0.\n'} ${one}\n Add 1 to Count.\n The answer is Count.\n\n${kinds}`;
else if (/^If /.test(one) && /:$/.test(one)) src = `${head}\n${pre}\n ${one}\n Add 1 to Count.\n The answer is Count.\n\n${kinds}`;
else if (sec.title === 'Tests') src = `${head}\n${pre}\n For each position i of T:\n Set b to the letter of T at i.\n ${/^If /.test(one) ? one : `If ${one}, add 1 to Count.`}\n The answer is Count.\n\n${kinds}`;
else if (sec.title === 'Values') src = `${head}\n${pre}\n For each position i of T:\n Set X to ${one}.\n The answer is Count.\n\n${kinds}`;
else src = `${head}\n${pre}\n Start with i at 0.\n${/\bb\b/.test(one) && !/\bB\b/.test(one) ? ' Set b to the letter of T at i.\n' : ''} ${one}\n The answer is Count.\n\n${/complement/.test(one) ? defs + '\n\n' : ''}${kinds}${/^Swap/.test(one) ? ' B is a whole number.' : ''}`;
const r = readLingo(src);
const tolerated = ['pronoun', 'kind-clash', 'unset-read', 'borrowed-input', 'which-letter', 'never-read', 'unreachable'];
const errs = r.diagnostics.filter((d) => d.severity === 'error' && !tolerated.includes(d.id));
if (errs.length) failures.push(`${e.term} → "${one}": ${errs.map((d) => d.id + ': ' + d.message.slice(0, 100)).join(' | ')}`);
}
}
}
assert.deepEqual(failures, []);
});
test('every lingo ambiguity example raises exactly the question it documents', () => {
const sec = LINGO_REF.sections.find((s) => s.id === 'lingo-questions');
for (const e of sec.entries) {
const r = readLingo(e.example);
assert.ok(r.diagnostics.some((d) => d.id === e.term), `${e.term}: got ${r.diagnostics.map((d) => d.id).join(', ')}`);
}
});
test('every speco example parses, and the symbol table round-trips', () => {
const sec = SPECO_REF.sections.find((s) => s.id === 'speco-forms');
for (const e of sec.entries) {
const m = parseSpeco(e.example);
assert.ok(m.ok, `${e.term}: ${m.diagnostics.map((d) => d.message).join(' | ')}`);
}
for (const s of SPECO_SYMBOLS) {
if (s.math.length !== 1) continue;
assert.equal(toAscii(`A ${s.math} B`), `A ${s.ascii} B`);
assert.equal(toMath(`A ${s.ascii} B`), `A ${s.math} B`);
}
});
test('every instruction has a gloss and a hover; setup examples parse', () => {
for (const op of Object.keys(OPS)) assert.ok(explain('asm', op)?.body, `${op} has no gloss`);
for (const e of ASM_REF.sections.find((s) => s.id === 'asm-registers').entries) assert.ok(explain('asm', e.term), e.term);
assert.ok(parseAsm(' mov rax, [rbx]\n ret\n').ok);
assert.ok(REFERENCE.length === 5);
});
test('every pseudo idiom runs and prints what its note says', async () => {
const { runPseudo } = await import('../dist/services/pseudo.js');
const { KEYWORDS: KW, BUILTINS: BI, CONTEXTUAL } = await import('../dist/engines/pseudo/lang.js');
const sec = PSEUDO_REF.sections.find((s) => s.id === 'pseudo-idioms');
assert.ok(sec.entries.length >= 8);
for (const e of sec.entries) {
const st = studyOf(e.example);
const errs = st.diagnostics.filter((d) => d.severity === 'error');
assert.equal(errs.length, 0, `${e.term}: ${errs.map((d) => `L${d.line} ${d.message}`).join(' | ')}`);
const tr = runPseudo(st, { input: [], maxSteps: 200000 });
assert.equal(tr.error, null, `${e.term}: ${tr.error?.message}`);
const out = tr.output.filter((l) => !/^\w+ returned /.test(l));
assert.deepEqual(out, [e.note], e.term);
}
const reserved = PSEUDO_REF.sections.find((s) => s.id === 'pseudo-reserved');
const words = new Set(reserved.entries.map((e) => e.term));
for (const k of KW) assert.ok(words.has(k), `reserved list misses keyword ${k}`);
for (const k of Object.keys(CONTEXTUAL)) assert.ok(words.has(k), `reserved list misses ${k}`);
for (const k of Object.keys(BI)) assert.ok(words.has(k), `reserved list misses built-in ${k}`);
});
test('every matho example translates to pseudo that checks, and every refusal is refused', () => {
const forms = MATHO_REF.sections.find((s) => s.id === 'matho-forms');
for (const e of forms.entries) {
const r = parseMatho(e.example);
const errs = r.diagnostics.filter((d) => d.severity === 'error');
assert.ok(r.ok, `${e.term}: ${errs.map((d) => `L${d.line} ${d.id}: ${d.message}`).join(' | ')}\n${r.program.pseudo}`);
const st = studyOf(r.program.pseudo);
assert.ok(st.ok, `${e.term}: the pseudo does not check: ${st.diagnostics.filter((d) => d.severity === 'error').map((d) => d.message).join(' | ')}`);
}
for (const src of ['y = \\int_0^1 x dx', 's = \\sum_{i=0}^{\\infty} x_i', 'y = \\lim_{x \\to 0} x', 'y = \\partial f', 'y = a \\pm b', 'a = b = c']) {
const r = parseMatho(src);
assert.equal(r.ok, false, `${src} should be refused`);
assert.ok(r.diagnostics.some((d) => d.severity === 'error' && /matho-(refused|pm|chain)/.test(d.id)), src);
}
});