输入驱动的正则表达式(远景文件)

Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2018-10-24 DOI:10.1145/3276604.3276606

Alexander Sakharov

{"title":"输入驱动的正则表达式(远景文件)","authors":"Alexander Sakharov","doi":"10.1145/3276604.3276606","DOIUrl":null,"url":null,"abstract":"Regular expressions are extended by splitting the terminals into left brackets, right brackets, and neutral terminals. These extended regular expressions define a superset of regular languages. Their languages are parsed in linear time in the size of the input. The addition of annotations to these regular expressions results in more detailed parse trees.","PeriodicalId":117525,"journal":{"name":"Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Input-driven regular expressions (vision paper)\",\"authors\":\"Alexander Sakharov\",\"doi\":\"10.1145/3276604.3276606\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Regular expressions are extended by splitting the terminals into left brackets, right brackets, and neutral terminals. These extended regular expressions define a superset of regular languages. Their languages are parsed in linear time in the size of the input. The addition of annotations to these regular expressions results in more detailed parse trees.\",\"PeriodicalId\":117525,\"journal\":{\"name\":\"Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3276604.3276606\",\"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 11th ACM SIGPLAN International Conference on Software Language Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3276604.3276606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

正则表达式通过将终端拆分为左括号、右括号和中性终端来扩展。这些扩展正则表达式定义了正则语言的超集。它们的语言按照输入的大小在线性时间内被解析。向这些正则表达式添加注释会生成更详细的解析树。

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

查看原文本刊更多论文

Input-driven regular expressions (vision paper)

Regular expressions are extended by splitting the terminals into left brackets, right brackets, and neutral terminals. These extended regular expressions define a superset of regular languages. Their languages are parsed in linear time in the size of the input. The addition of annotations to these regular expressions results in more detailed parse trees.

求助全文

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

来源期刊

Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering

自引率

0.00%

发文量