{"title":"用GROOVE解决TTC 2011编译器优化案例","authors":"A. Rensink, E. Zambon","doi":"10.4204/EPTCS.74.11","DOIUrl":null,"url":null,"abstract":"This report presents a partial solution to the Compiler Optimisation case study using GROOVE. We explain how the input graphs provided with the case study were adapted into a GROOVE representation and we describe an initial solution for Task 1. This solution allows us to automatically reproduce the steps of the constant folding example given in the case description. We did not solve Task 2.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving the TTC 2011 Compiler Optimization Case with GROOVE\",\"authors\":\"A. Rensink, E. Zambon\",\"doi\":\"10.4204/EPTCS.74.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This report presents a partial solution to the Compiler Optimisation case study using GROOVE. We explain how the input graphs provided with the case study were adapted into a GROOVE representation and we describe an initial solution for Task 1. This solution allows us to automatically reproduce the steps of the constant folding example given in the case description. We did not solve Task 2.\",\"PeriodicalId\":266655,\"journal\":{\"name\":\"Transformation Tool Contest\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transformation Tool Contest\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.74.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transformation Tool Contest","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.74.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving the TTC 2011 Compiler Optimization Case with GROOVE
This report presents a partial solution to the Compiler Optimisation case study using GROOVE. We explain how the input graphs provided with the case study were adapted into a GROOVE representation and we describe an initial solution for Task 1. This solution allows us to automatically reproduce the steps of the constant folding example given in the case description. We did not solve Task 2.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
