Rewriting Machine Emulator

Programs are written as a set of rules, and the initial content of a unordered bag. During evaluation, rules are tested in a sequence from the first to the last, when the bag contains a rule's left-side, the symbols are replaced by those in the right-side, and search for the next rule starts back again from the beginning.

The advantages over the register machine are that it has only one operation, and does away with textual language altogether. To find more exciting programs, see the Pocket Rewriting Computer.

• LHS -> RHS: Replace the LHS with the RHS.