A Note on Exhaustive State Space Search for Efficient Code Generation

06/24/2021
by   Aart J. C. Bik, et al.
0

This note explores state space search to find efficient instruction sequences that perform particular data manipulations. Once found, the instruction sequences are hard-wired in the code generator that needs these data manipulations. Since state space is only searched while developing the compiler, search time is not at a premium, which allows exhaustively searching for the best possible instruction sequences.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset