基于验证导数的正则表达式解析工具的设计

CLEI Electron. J. Pub Date : 2021-12-13 DOI:10.19153/cleiej.24.3.2

E. Cardoso, Maycon Amaro, Samuel da Silva Feitosa, L. Reis, A. R. D. Bois, R. Ribeiro

{"title":"基于验证导数的正则表达式解析工具的设计","authors":"E. Cardoso, Maycon Amaro, Samuel da Silva Feitosa, L. Reis, A. R. D. Bois, R. Ribeiro","doi":"10.19153/cleiej.24.3.2","DOIUrl":null,"url":null,"abstract":"We describe the formalization of Brzozowski and Antimirov derivative based algorithms for regular expression parsing, in the dependently typed language Agda. The formalization produces a proof that either an input string matches a given regular expression or that no matching exists. A tool for regular expression based search in the style of the well known GNU grep has been developed with the certified algorithms. Practical experiments conducted with this tool are reported.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"26 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Design of a Verified Derivative-Based Parsing Tool for Regular Expressions\",\"authors\":\"E. Cardoso, Maycon Amaro, Samuel da Silva Feitosa, L. Reis, A. R. D. Bois, R. Ribeiro\",\"doi\":\"10.19153/cleiej.24.3.2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe the formalization of Brzozowski and Antimirov derivative based algorithms for regular expression parsing, in the dependently typed language Agda. The formalization produces a proof that either an input string matches a given regular expression or that no matching exists. A tool for regular expression based search in the style of the well known GNU grep has been developed with the certified algorithms. Practical experiments conducted with this tool are reported.\",\"PeriodicalId\":418941,\"journal\":{\"name\":\"CLEI Electron. J.\",\"volume\":\"26 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CLEI Electron. J.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19153/cleiej.24.3.2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CLEI Electron. J.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19153/cleiej.24.3.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们在独立类型语言Agda中描述了基于Brzozowski和Antimirov导数的正则表达式解析算法的形式化。形式化生成一个证明，证明输入字符串与给定正则表达式匹配或不存在匹配。一个基于正则表达式的搜索工具，其风格类似于著名的GNU grep，已经使用经过认证的算法开发出来。并报道了用该工具进行的实际实验。

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

查看原文本刊更多论文

The Design of a Verified Derivative-Based Parsing Tool for Regular Expressions

We describe the formalization of Brzozowski and Antimirov derivative based algorithms for regular expression parsing, in the dependently typed language Agda. The formalization produces a proof that either an input string matches a given regular expression or that no matching exists. A tool for regular expression based search in the style of the well known GNU grep has been developed with the certified algorithms. Practical experiments conducted with this tool are reported.

求助全文

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

来源期刊

CLEI Electron. J.

自引率

0.00%

发文量