基于导数的正则表达式歧义诊断
Derivative-Based Diagnosis of Regular Expression Ambiguity
摘要:
正则表达式通常是模糊的。我们提出了一种新的方法的基础上Brzozowski的衍生物,以帮助用户在诊断有歧义的正则表达式。我们引入了一个基于导数的有限状态转换器来生成解析树和最小反例。转换器可以很容易地定制,以遵循POSIX或Greedy消歧策略,并且基于有限的示例集,可以检查POSIX和Greedy之间是否存在任何差异。
英文摘要:
Regular expressions are often ambiguous. We present a novel method based on Brzozowski's derivatives to aid the user in diagnosing ambiguous regular expressions. We introduce a derivative-based finite state transducer to generate parse trees and minimal counter-examples. The transducer can be easily customized to either follow the POSIX or Greedy disambiguation policy and based on a finite set of examples it is possible to examine if there are any differences among POSIX and Greedy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。