Optimal Code Selection in DAGs (1999)
Cached
Download Links
- [www.complang.tuwien.ac.at]
- [www.complang.tuwien.ac.at]
- DBLP
Other Repositories/Bibliography
| Venue: | In 26th Annual ACM SIGACT-SIGPLAN Symposium on the Principles of Programming Languages |
| Citations: | 15 - 0 self |
BibTeX
@INPROCEEDINGS{Ertl99optimalcode,
author = {M. Anton Ertl},
title = {Optimal Code Selection in DAGs},
booktitle = {In 26th Annual ACM SIGACT-SIGPLAN Symposium on the Principles of Programming Languages},
year = {1999},
pages = {242--249},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ing with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org. Optimal Code Selection in DAGs M. Anton Ertl Institut fur Computersprachen Technische Universitat Wien Argentinierstrae 8, 1040 Wien, Austria anton@mips.complang.tuwien.ac.at http://www.complang.tuwien.ac.at/anton/ Tel.: (+43-1) 58801 18515 Fax.: (+43-1) 58801 18598 Abstract We extend the tree parsing approach to code selection to DAGs. In general, our extension does not produce the optimal code selection for all DAGs (this problem would be NPcomplete) , but for certain code selection grammars, it does. We present a method for checking whether a code selection grammar belongs to this set of DAG-optimal grammars, and use this method to check code selection grammars adapted from lcc: the grammars for the MIPS and SPARC ...
