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

E. Cardoso, Maycon Amaro, Samuel da Silva Feitosa, L. Reis, A. R. D. Bois, R. Ribeiro
{"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}
引用次数: 1

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于验证导数的正则表达式解析工具的设计
我们在独立类型语言Agda中描述了基于Brzozowski和Antimirov导数的正则表达式解析算法的形式化。形式化生成一个证明,证明输入字符串与给定正则表达式匹配或不存在匹配。一个基于正则表达式的搜索工具,其风格类似于著名的GNU grep,已经使用经过认证的算法开发出来。并报道了用该工具进行的实际实验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Cluster-based LSTM models to improve Dengue cases forecast Medium Access Control Techniques for Massive Machine-Type Communications in Cellular IoT Networks 2D Simplified Wildfire Spreading Model in Python: From NumPy to CuPy Preface to the CLTM-CLTD 2022 Special Issue On the specification and verification of the PCR parallel programming pattern in TLA+
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1