在遗传编程中使用基于llvm的JIT编译

2016 ELEKTRO Pub Date : 2016-05-16 DOI:10.1109/ELEKTRO.2016.7512108

M. Gregor, J. Spalek

{"title":"在遗传编程中使用基于llvm的JIT编译","authors":"M. Gregor, J. Spalek","doi":"10.1109/ELEKTRO.2016.7512108","DOIUrl":null,"url":null,"abstract":"The paper describes an approach to implementing genetic programming, which uses the LLVM library to just-in-time compile/interpret the evolved abstract syntax trees. The solution is described in some detail, including a parser (based on FlexC++ and BisonC++) that can construct the trees from a simple toy language with C-like syntax. The approach is compared with a previous implementation (based on direct execution of trees using polymorphic functors) in terms of execution speed.","PeriodicalId":369251,"journal":{"name":"2016 ELEKTRO","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Using LLVM-based JIT compilation in genetic programming\",\"authors\":\"M. Gregor, J. Spalek\",\"doi\":\"10.1109/ELEKTRO.2016.7512108\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper describes an approach to implementing genetic programming, which uses the LLVM library to just-in-time compile/interpret the evolved abstract syntax trees. The solution is described in some detail, including a parser (based on FlexC++ and BisonC++) that can construct the trees from a simple toy language with C-like syntax. The approach is compared with a previous implementation (based on direct execution of trees using polymorphic functors) in terms of execution speed.\",\"PeriodicalId\":369251,\"journal\":{\"name\":\"2016 ELEKTRO\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 ELEKTRO\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ELEKTRO.2016.7512108\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 ELEKTRO","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ELEKTRO.2016.7512108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文描述了一种实现遗传编程的方法，该方法使用LLVM库来实时编译/解释进化的抽象语法树。详细描述了解决方案，包括一个解析器(基于flexc++和bisonc++)，该解析器可以从具有类似c语法的简单玩具语言构建树。在执行速度方面，将该方法与之前的实现(基于使用多态函子直接执行树)进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Using LLVM-based JIT compilation in genetic programming

The paper describes an approach to implementing genetic programming, which uses the LLVM library to just-in-time compile/interpret the evolved abstract syntax trees. The solution is described in some detail, including a parser (based on FlexC++ and BisonC++) that can construct the trees from a simple toy language with C-like syntax. The approach is compared with a previous implementation (based on direct execution of trees using polymorphic functors) in terms of execution speed.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 ELEKTRO

自引率

0.00%

发文量