基于类型的表达式语法终止分析

IF 0.4 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Applied Computing Review Pub Date : 2023-03-27 DOI:10.1145/3555776.3577620

Elton M. Cardoso, Regina De Paula, D. Pereira, L. Reis, R. Ribeiro

{"title":"基于类型的表达式语法终止分析","authors":"Elton M. Cardoso, Regina De Paula, D. Pereira, L. Reis, R. Ribeiro","doi":"10.1145/3555776.3577620","DOIUrl":null,"url":null,"abstract":"Parsing expressions grammars (PEGs) are a recognition-based formalism for language specification, which has been the subject of several research works. A PEG that succeeds or rejects every input string is said to be complete. However, checking if an arbitrary PEG is complete is an undecidable problem. In this work we propose a sound type-based termination analysis for PEGs as a type inference algorithm.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"1 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Type-based Termination Analysis for Parsing Expression Grammars\",\"authors\":\"Elton M. Cardoso, Regina De Paula, D. Pereira, L. Reis, R. Ribeiro\",\"doi\":\"10.1145/3555776.3577620\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Parsing expressions grammars (PEGs) are a recognition-based formalism for language specification, which has been the subject of several research works. A PEG that succeeds or rejects every input string is said to be complete. However, checking if an arbitrary PEG is complete is an undecidable problem. In this work we propose a sound type-based termination analysis for PEGs as a type inference algorithm.\",\"PeriodicalId\":42971,\"journal\":{\"name\":\"Applied Computing Review\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Computing Review\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3555776.3577620\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Computing Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3555776.3577620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

解析表达式语法(peg)是一种基于识别的语言规范形式，已经成为许多研究工作的主题。成功或拒绝每个输入字符串的PEG被称为完整的。然而，检查任意PEG是否完整是一个无法确定的问题。在这项工作中，我们提出了一种基于类型的peg终止分析作为类型推断算法。

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

查看原文本刊更多论文

Type-based Termination Analysis for Parsing Expression Grammars

Parsing expressions grammars (PEGs) are a recognition-based formalism for language specification, which has been the subject of several research works. A PEG that succeeds or rejects every input string is said to be complete. However, checking if an arbitrary PEG is complete is an undecidable problem. In this work we propose a sound type-based termination analysis for PEGs as a type inference algorithm.

求助全文

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

来源期刊

Applied Computing Review COMPUTER SCIENCE, INFORMATION SYSTEMS-

自引率

40.00%

发文量