[<<][rtl][>>][..]
Thu Aug 23 10:32:53 EDT 2018

Processor as a macro

So back to the main question: is there an intermediate between
creating a program on a processor, and a raw state machine.

I.e. I want an imperative / stack language that generates a state
machine.

Say start without a stack: just use loop counters.

Every instruction word is a state, with a next state equation.

This should be automatic.  These are all just functions!  What about
decoupling it as a type class, and providing two different
interpretations?

There are a couple of trade-offs: loop counters with inidividual
adders, or a stack or ALU-like structure.  It seems that only the
instruction memory can be eliminated this way.  The other logic will
remain the same.  Also obvious in retrospect.




[Reply][About]
[<<][rtl][>>][..]