Derivative-Based Diagnosis of Regular Expression Ambiguity
Formal Languages and Automata Theory
2016-07-14 v2
Abstract
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.
Cite
@article{arxiv.1604.06644,
title = {Derivative-Based Diagnosis of Regular Expression Ambiguity},
author = {Martin Sulzmann and Kenny Zhuo Ming Lu},
journal= {arXiv preprint arXiv:1604.06644},
year = {2016}
}
Comments
12 pages plus appendix, to appear in CIAA 2016