[l-]

Regexstepper - takes an ordered list of regexs & repeatedly runs them against a corresponding ordered replacement list and ordered sample list until no further replacements are found. Used it to learn about stepping through PEMDAS simplification on various math iexpressions & attempts at combinatorial systems. Wrote it once years ago learning about PEMDAS then decided to delete it because JS cannot do at matching of arbitrary depth matching braces without parsing into an AST ala shunting yard, then learned about combinators & decided to try again to try and find systems that work without parentheses.