{"title":"高效的可重目标编译器代码生成","authors":"P. Hatcher, J. Tuller","doi":"10.1109/ICCL.1988.13039","DOIUrl":null,"url":null,"abstract":"A discussion is presented of the design and implementation of a retargetable code generation system, UNH-CODEGEN, specifically designed for the bottom-up tree pattern matching algorithms. The authors describe experiments in which the system has been used to build compilers. These experiments demonstrate that the system can be used to quickly generate a code generator that will run fast (roughly four times the speed of the Portable C Compiler's code generators), that will be space-efficient, and that will make best use of the underlying machine description.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Efficient retargetable compiler code generation\",\"authors\":\"P. Hatcher, J. Tuller\",\"doi\":\"10.1109/ICCL.1988.13039\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A discussion is presented of the design and implementation of a retargetable code generation system, UNH-CODEGEN, specifically designed for the bottom-up tree pattern matching algorithms. The authors describe experiments in which the system has been used to build compilers. These experiments demonstrate that the system can be used to quickly generate a code generator that will run fast (roughly four times the speed of the Portable C Compiler's code generators), that will be space-efficient, and that will make best use of the underlying machine description.<<ETX>>\",\"PeriodicalId\":219766,\"journal\":{\"name\":\"Proceedings. 1988 International Conference on Computer Languages\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1988 International Conference on Computer Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCL.1988.13039\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1988 International Conference on Computer Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCL.1988.13039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
摘要
讨论了一个可重目标代码生成系统的设计和实现,UNH-CODEGEN,专为自下而上的树模式匹配算法而设计。作者描述了用该系统构建编译器的实验。这些实验表明,该系统可用于快速生成运行速度快(大约是Portable C Compiler的代码生成器速度的四倍)的代码生成器,这将是有效的空间,并将充分利用底层机器描述。b>
A discussion is presented of the design and implementation of a retargetable code generation system, UNH-CODEGEN, specifically designed for the bottom-up tree pattern matching algorithms. The authors describe experiments in which the system has been used to build compilers. These experiments demonstrate that the system can be used to quickly generate a code generator that will run fast (roughly four times the speed of the Portable C Compiler's code generators), that will be space-efficient, and that will make best use of the underlying machine description.<>