解析表达式语法的类型化语义

Proceedings of the XXIII Brazilian Symposium on Programming Languages Pub Date : 2019-09-23 DOI:10.1145/3355378.3355388

R. Ribeiro, L. Reis, Samuel da Silva Feitosa, E. Cardoso

{"title":"解析表达式语法的类型化语义","authors":"R. Ribeiro, L. Reis, Samuel da Silva Feitosa, E. Cardoso","doi":"10.1145/3355378.3355388","DOIUrl":null,"url":null,"abstract":"We describe the formalization of a type system for parsing expression grammars (PEG) which is equivalent to Ford's original fixpoint-based definition of well-formed PEGs. We use our type system definition to implement a functional big-step semantics for typed PEGs using the Agda programming language.","PeriodicalId":429937,"journal":{"name":"Proceedings of the XXIII Brazilian Symposium on Programming Languages","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Towards Typed Semantics for Parsing Expression Grammars\",\"authors\":\"R. Ribeiro, L. Reis, Samuel da Silva Feitosa, E. Cardoso\",\"doi\":\"10.1145/3355378.3355388\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe the formalization of a type system for parsing expression grammars (PEG) which is equivalent to Ford's original fixpoint-based definition of well-formed PEGs. We use our type system definition to implement a functional big-step semantics for typed PEGs using the Agda programming language.\",\"PeriodicalId\":429937,\"journal\":{\"name\":\"Proceedings of the XXIII Brazilian Symposium on Programming Languages\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the XXIII Brazilian Symposium on Programming Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3355378.3355388\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the XXIII Brazilian Symposium on Programming Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3355378.3355388","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们描述了解析表达式语法(PEG)的类型系统的形式化，它等价于Ford最初的基于固定点的格式良好的PEG定义。我们使用我们的类型系统定义来使用Agda编程语言实现类型化peg的函数式大步骤语义。

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

查看原文本刊更多论文

Towards Typed Semantics for Parsing Expression Grammars

We describe the formalization of a type system for parsing expression grammars (PEG) which is equivalent to Ford's original fixpoint-based definition of well-formed PEGs. We use our type system definition to implement a functional big-step semantics for typed PEGs using the Agda programming language.

求助全文

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

来源期刊

Proceedings of the XXIII Brazilian Symposium on Programming Languages

自引率

0.00%

发文量