Grammar construction methods for extended deterministic expressions

TL;DR

This paper develops syntax definitions for extended deterministic expressions, including counting and interleaving, to address the lack of formal syntax and facilitate practical use of these complex regular expressions.

Contribution

It introduces formal syntax definitions for extended deterministic expressions and their subclasses, filling a crucial gap in theoretical foundations.

Findings

Provides the first comprehensive syntax definitions for extended deterministic expressions

Enables more practical and reliable use of extended regular expressions in applications

Addresses a long-standing theoretical gap in the study of extended expressions

Abstract

Extended regular expressions with counting and interleaving are widely used in practice. However the related theoretical studies for this kind of expressions currently cannot meet the need of practical work. This paper develops syntax definitions for extended deterministic expressions and their subclasses, hope to completely solve the long-standing problem that there are no syntax definitions for this kind of expressions, which has become an important reason for restricting the use of extended expressions.