Doesnt: An Esoteric Programming Language

Summary

I don't know if anyone still reads this, but I've got a funny rewriting system to share. The idea is a possible realization of LANGUAGE 18 from "FORTY-FOUR ESOLANGS": a sculptural language it subtracts from potential algorithms, making them more specific a program only states what it doesn't do It led to the creation of DOESNT. I almost gave up on it after hitting a hit with it's matching. But, as I was writing my December Adventure log, I found a quick solution. The following is the only program I have the energy to write. It does addition: give a + unless b , a , + . !! , + b b ; give unless a , b , + b , . ; have a a a a + b b b . ; DOESNT is a single string rewriting system. The string is stored in a ring buffer. Each rule in DOESNT attempts to match the longest possible prefix before hitting a patter it DOESNT take. If a pattern contains `!!` DOESNT will immidiately reject the rule, taking nothing. This was mainly to solve the following problem: given a unless + . ; + . Without `!!` DOESNT would endlessly produce `a` as it would accept `+` after backtracking from `+ .`. This would lead to loops you could not stop. The implementation can be found here: file:///home/exarch/Documents/wiki/public/raw/DOESNT.lua - and