Re: [stack] Stack Shuffling Operator Mnemonics

Christopher Diggins <[email protected]> wrote:
> Cat is a wolf in sheep's clothing if you will pardon the mixed
> metaphors. Some of the type restrictions that it imposes (compared to
> the flexibility of Joy) enable a very straightforward mapping to
> assembly code.

Yeah, static type inference can make generating code easier.

> My goal for Cat is to be a safe and efficient
> high-level intermediate language, which could also be used for
> application development.

Yes, an interesting goal.

By the way, the first shuffle notation parser I ever actually
completed actually generated x86 machine code directly. It was just
too much of a pain to try to figure out the correct algorithm to
shuffle the values using standard rot-swap-R> etc.

And, of course, optimization of stack shuffle notations is a
well-solved problem. It's not as simple as concatenating them, but
it's a simple text manipulation to take two adjacent shuffles and make
a single one.

(End of advertisement. ;-)

-Billy