2012
DOI: 10.1007/978-3-642-28872-2_27
|View full text |Cite
|
Sign up to set email alerts
|

Explanations for Regular Expressions

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 17 publications
0
9
0
Order By: Relevance
“…Egret [11] generates strings from regular expressions based on the underlying automata. It first converts a regular expression into a specialized automaton, then derives a set of basis paths of the resulting automaton, and finally creates strings from the basis paths.…”
Section: Coverage Based Generationmentioning
confidence: 99%
See 1 more Smart Citation
“…Egret [11] generates strings from regular expressions based on the underlying automata. It first converts a regular expression into a specialized automaton, then derives a set of basis paths of the resulting automaton, and finally creates strings from the basis paths.…”
Section: Coverage Based Generationmentioning
confidence: 99%
“…However, recent research has found that regular expressions are hard to understand, hard to compose, and error-prone [10,11] . Indeed, regular expressions have a quite compact and rather tolerant syntax that makes them hard to understand even for very short regular expressions.…”
Section: Introductionmentioning
confidence: 99%
“…Instead, quite the opposite, the length of the expression additionally increases. The lack of abstraction in regular expressions (Erwig & Goponath, 2012) is one of the key deficiencies. It causes scalability problems that result in regular expressions growing quite large quickly.…”
Section: Existing Solutionsmentioning
confidence: 99%
“…Also, much of the regular expression code is sometimes redundant (Dasu & Johnson, 2003). A combined explanation for the date expression presented in (Erwig & Goponath, 2012) gives an interesting method of explanation. This method can easily be transformed in an SQL-like language.…”
Section: Existing Solutionsmentioning
confidence: 99%
“…Therefore, several techniques and tools have been proposed for easing the design of regular expressions and for their validation and testing. For example, some approaches attempt to discover errors using static checking , others using visual debugging ; a different approach proposes to transform a regular expression in a more intelligible format that should allow the developer to understand whether the regular expression is what (s)he had in mind.…”
Section: Introductionmentioning
confidence: 99%