{"title":"使用生成语法动态操作ALGOL68值的描述","authors":"C. F. Vansina","doi":"10.1145/872738.807144","DOIUrl":null,"url":null,"abstract":"Code generation is very complex. Using ALGOL68, complexity increases due to the recursivity of the manipulated values. The set of routines manipulating values will be recursive too. Describing such a manipulating process with flow charts makes it less readable. To avoid that difficulty the description of the process will use a generative action grammar. With such a grammar recursivity is natural, so the description of a recursive process will be very readable. Moreover, such a grammar can easily be translated into a program, which will be very structured and modular. The produced code will be very structured too and that can be helpful for debugging and checking processes.","PeriodicalId":226613,"journal":{"name":"Strathclyde ALGOL 68 Conference","volume":"288 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1977-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Description of dynamic manipulation of ALGOL68 values using a generative grammar\",\"authors\":\"C. F. Vansina\",\"doi\":\"10.1145/872738.807144\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Code generation is very complex. Using ALGOL68, complexity increases due to the recursivity of the manipulated values. The set of routines manipulating values will be recursive too. Describing such a manipulating process with flow charts makes it less readable. To avoid that difficulty the description of the process will use a generative action grammar. With such a grammar recursivity is natural, so the description of a recursive process will be very readable. Moreover, such a grammar can easily be translated into a program, which will be very structured and modular. The produced code will be very structured too and that can be helpful for debugging and checking processes.\",\"PeriodicalId\":226613,\"journal\":{\"name\":\"Strathclyde ALGOL 68 Conference\",\"volume\":\"288 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1977-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Strathclyde ALGOL 68 Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/872738.807144\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Strathclyde ALGOL 68 Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/872738.807144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Description of dynamic manipulation of ALGOL68 values using a generative grammar
Code generation is very complex. Using ALGOL68, complexity increases due to the recursivity of the manipulated values. The set of routines manipulating values will be recursive too. Describing such a manipulating process with flow charts makes it less readable. To avoid that difficulty the description of the process will use a generative action grammar. With such a grammar recursivity is natural, so the description of a recursive process will be very readable. Moreover, such a grammar can easily be translated into a program, which will be very structured and modular. The produced code will be very structured too and that can be helpful for debugging and checking processes.