表驱动的问题解决者

ACM-SE 18 Pub Date : 1980-03-24 DOI:10.1145/503838.503852

David S. Burris, Kurt A. Schember

{"title":"表驱动的问题解决者","authors":"David S. Burris, Kurt A. Schember","doi":"10.1145/503838.503852","DOIUrl":null,"url":null,"abstract":"This paper suggests an extension of decision tables and finite automata to more general table-driven problem solvers. The basic idea is that when a problem description is changed, only the contents table directing the flow of control and actions taken by a program need be modified and not the actual code. Program actions may be changed easily and documentation and program reliability improved.","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Table-driven problem solvers\",\"authors\":\"David S. Burris, Kurt A. Schember\",\"doi\":\"10.1145/503838.503852\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper suggests an extension of decision tables and finite automata to more general table-driven problem solvers. The basic idea is that when a problem description is changed, only the contents table directing the flow of control and actions taken by a program need be modified and not the actual code. Program actions may be changed easily and documentation and program reliability improved.\",\"PeriodicalId\":431590,\"journal\":{\"name\":\"ACM-SE 18\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM-SE 18\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/503838.503852\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 18","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/503838.503852","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文建议将决策表和有限自动机扩展到更一般的表驱动问题求解器。其基本思想是，当问题描述被更改时，只需要修改指导控制流和程序所采取的操作的内容表，而不需要修改实际的代码。程序操作可以很容易地改变，文档和程序的可靠性得到提高。

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

查看原文本刊更多论文

Table-driven problem solvers

This paper suggests an extension of decision tables and finite automata to more general table-driven problem solvers. The basic idea is that when a problem description is changed, only the contents table directing the flow of control and actions taken by a program need be modified and not the actual code. Program actions may be changed easily and documentation and program reliability improved.

求助全文

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

来源期刊

ACM-SE 18

自引率

0.00%

发文量