{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:01:13Z","timestamp":1759147273232},"reference-count":10,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":5781,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1991,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Code generators based on bottom\u2010up rewrite systems (BURS) are automatically generated from machine\u2010description grammars. They produce locally optimal code for expression trees, but their tables are large and require compile\u2010time interpretation. This paper describes a program that compiles BURS tables into a combination of hard code and data. Hard\u2010coding exposed important opportunities for compression that were previously hidden in the tables, so the hard\u2010coded code generators are not just faster but also significantly smaller than their predecessors. A VAX code generator takes 21.4Kbytes and identifies optimal assembly code in about 50 VAX instructions per node.<\/jats:p>","DOI":"10.1002\/spe.4380210102","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T01:05:30Z","timestamp":1163811930000},"page":"1-12","source":"Crossref","is-referenced-by-count":15,"title":["Hard\u2010coding bottom\u2010up code generation tables to save time and space"],"prefix":"10.1002","volume":"21","author":[{"given":"Christopher W.","family":"Fraser","sequence":"first","affiliation":[]},{"given":"Robert R.","family":"Henry","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"H. H.Kron Tree templates and subtree transformational grammars Ph. D. Thesis Information Sciences Department University of California Santa Cruz December1975."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322295"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"David R.Chase An improvement to bottom\u2010up tree pattern matching Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages January1987 pp.168\u2013177.","DOI":"10.1145\/41625.41640"},{"key":"e_1_2_1_5_2","unstructured":"J\u00fcrgenB\u00f6rstler UlrichM\u00f6ncheandReinhardWilhelm Table compression for tree automata Technical Report Aachener Informatik\u2010Berichte No. 87\u201312 RWTH Aachen Fachgruppe Informatik Aachen Federal Republic of Germany 1987."},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"EduardoPelegri\u2010LlopartandSusan L.Graham Optimal code generation for expression trees: an application of BURS theory Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages January1988 pp.294\u2013308.","DOI":"10.1145\/73560.73586"},{"key":"e_1_2_1_7_2","unstructured":"Robert R.HenryandPeter C.Damron Algorithms for table\u2010driven code generators using tree\u2010pattern matching Technical Report 89\u201302\u201303 Department of Computer Science University of Washington February1989."},{"key":"e_1_2_1_8_2","unstructured":"Robert R.Henry Encoding optimal pattern selection in a table\u2010driven bottom\u2010up tree\u2010pattern matcher Technical Report 89\u201302\u201304 Department of Computer Science University of Washington February1989."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/12276.13326"},{"issue":"7","key":"e_1_2_1_10_2","first-page":"79","article-title":"Automatic generation of fast optimizing code generators","volume":"23","author":"Fraser Christopher W.","year":"1988","journal-title":"Proceedings of the SIGPLAN 88 Symposium on Compiler Construction, SIGPLAN Notices"},{"issue":"7","key":"e_1_2_1_11_2","first-page":"238","article-title":"A language for writing code generators","volume":"24","author":"Fraser Christopher W.","year":"1989","journal-title":"Proceedings of the SIGPLAN 89 Symposium on Compiler Construction, SIGPLAN Notices"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380210102","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380210102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T00:10:34Z","timestamp":1698019834000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380210102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["10.1002\/spe.4380210102"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380210102","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}