| 摘要 |
PURPOSE:To control an allocation of a register by a scan of an arithmetic operation tree of once, and to improve the conversion efficiency without deteriorating the quality of an outputted instruction, by utilizing a specific register allocating system. CONSTITUTION:When an inputted arithmetic operation tree is collated with a tree expression collating rule 1 top-down-recursively, when a register qualifier has existed in a component of the tree expression collating rule, register designating information is calculated by a propagation register determining part 3. Also, when an allocation of a register has been requested, the register designating information is delivered to a register allocating part 4, the register is allocated, and when an arithmetic operation instruction is outputted by this collation, the arithmetic operation instruction is outputted by an arithmetic operation instruction output part 5, and subsequently, a node or a partial tree to be collated is determined. Accordingly, the register can be allocated efficiently without rescanning the arithmetic operation tree, and the conversion time to the arithmetic operation instruction is decreased.
|
