z-logo
Premium
Code generation with a recursive optimizer
Author(s) -
Stevenson Gordon
Publication year - 1980
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.4380100507
Subject(s) - computer science , compiler , code generation , construct (python library) , code (set theory) , dead code elimination , unreachable code , systematic code , generator (circuit theory) , dead code , programming language , scheme (mathematics) , parallel computing , algorithm , theoretical computer science , redundant code , mathematics , decoding methods , code rate , operating system , power (physics) , mathematical analysis , physics , set (abstract data type) , quantum mechanics , key (lock)
This paper describes a general purpose optimizer used to construct a new code generator for an existing Coral 66 compiler. The optimizer is recursive and gives the one pass code generator some of the advantages of a multiple pass scheme by ‘pipelining’ short sequences of linear intermediate code at each activation level.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here