z-logo
Premium
Register allocation in a pattern matching code generator
Author(s) -
Van Biljon W. R.,
Sewry D. A.,
Mulders M. A.
Publication year - 1987
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380170805
Subject(s) - register allocation , computer science , code (set theory) , matching (statistics) , register (sociolinguistics) , generator (circuit theory) , parallel computing , code generation , programming language , power (physics) , operating system , mathematics , compiler , linguistics , statistics , philosophy , physics , set (abstract data type) , quantum mechanics , key (lock)
Abstract Register allocation in a pattern‐matching code generator is discussed, and a strategy for the allocation of registers is presented. The strategy is suitable for code generators that perform no data‐flow analysis, but do perform common subexpression analysis. An implementation of the strategy has produced high quality code.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here