Abstract
As we saw in Chapter 3, the principle of tree covering has two significant disadvantages. The first is that common subexpressions cannot be properly expressed in program trees, and the second is that many machine instruction characteristics—such as multi-output instructions—cannot be modeled as pattern trees. As these shortcomings are primarily due to the restricted use of trees, we can achieve a more powerful approach to instruction selection by extending tree covering to DAG covering.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Hjort Blindell, G. (2016). DAG Covering. In: Instruction Selection. Springer, Cham. https://doi.org/10.1007/978-3-319-34019-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-34019-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-34017-3
Online ISBN: 978-3-319-34019-7
eBook Packages: Computer ScienceComputer Science (R0)