* Parser-hardening (MathNet corpus) Tier-3 vocabulary: * - Task 4: Unicode operator glyphs (`≡ ∈ ∉ ∪ ∩ ≈`) parsing to the same * heads as their LaTeX-command equivalents. * - Task 5: congruence (`a \equiv b \pmod{n}`, and the parenthesized * `(mod n)` / `(\bmod n)` annotation) reduci
()
| 14 | */ |
| 15 | |
| 16 | function freshEngine(): ComputeEngine { |
| 17 | return new ComputeEngine(); |
| 18 | } |
| 19 | |
| 20 | function json(ce: ComputeEngine, s: string): string { |
| 21 | return JSON.stringify(ce.parse(s).json); |