OREGON STATE UNIVERSITY

You are here

Explanations for regular expressions

TitleExplanations for regular expressions
Publication TypeConference Paper
Year of Publication2012
AuthorsErwig, M., and R. Gopinath
Conference NameProceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Pagination394–408
Date Published04/2012
PublisherSpringer-Verlag
Conference LocationBerlin, Heidelberg
ISBN Number978-3-642-28871-5
Abstract

Regular expressions are widely used, but they are inherently hard to understand and (re)use, which is primarily due to the lack of abstraction mechanisms that causes regular expressions to grow large very quickly. The problems with understandability and usability are further compounded by the viscosity, redundancy, and terseness of the notation. As a consequence, many different regular expressions for the same problem are floating around, many of them erroneous, making it quite difficult to find and use the right regular expression for a particular problem. Due to the ubiquitous use of regular expressions, the lack of understandability and usability becomes a serious software engineering problem.

In this paper we present a range of independent, complementary representations that can serve as explanations of regular expressions. We provide methods to compute those representations, and we describe how these methods and the constructed explanations can be employed in a variety of usage scenarios. In addition to aiding understanding, some of the representations can also help identify faults in regular expressions. Our evaluation shows that our methods are widely applicable and can thus have a significant impact in improving the practice of software engineering.

URLhttp://dx.doi.org/10.1007/978-3-642-28872-2_27
DOI10.1007/978-3-642-28872-2_27