I've come up with an architecture[1,2] that I think could be quite useful. But I've been stuck on how to actually compile "code" for it for far too long. (Decades, actually) It's my hobby horse, and I want to ride it before I die.
I need to take expressions, or programs, and break them down to a directed acyclic graph of binary logical operations.
In the end.... a cell has 4 inputs, and needs 4 outputs for each possible combination, a total of 64 bits (or 16 nibbles).
Heck, I'd settle for a good way to express said tree in a plain text file as a kick start.
[1] https://esolangs.org/wiki/Bitgrid
[2] https://github.com/mikewarot/Bitgrid
I need to take expressions, or programs, and break them down to a directed acyclic graph of binary logical operations.
In the end.... a cell has 4 inputs, and needs 4 outputs for each possible combination, a total of 64 bits (or 16 nibbles).
Heck, I'd settle for a good way to express said tree in a plain text file as a kick start.
[1] https://esolangs.org/wiki/Bitgrid
[2] https://github.com/mikewarot/Bitgrid