DOOM tournant uniquement sur des regex find-and-replace : 544 règles, 96 MB de string
Summary
DOOM on regex describes a project that renders the classic game entirely inside a 96 MB string using 544 substitution rules. It explains the architecture of a tiny RVM-1 CPU implemented as regex, performance figures, and the proof that iterated regex substitution is Turing-complete. The piece links to the repo, demos, and benchmarks, offering a fascinating case study for esoteric programming, open-source tooling, and regex-based computation.