Unique Pattern Matching in Strings

Details Unique Pattern Matching in Strings Unique Pattern Matching in Strings

2003-02-03

arxiv.org/abs/cs/0302004v1

Computer Science

Programming Languages

22 pages

Scientific paper

Regular expression patterns are a key feature of document processing languages like Perl and XDuce. It is in this context that the first and longest match policies have been proposed to disambiguate the pattern matching process. We formally define a matching semantics with these policies and show that the generally accepted method of simulating longest match by first match and recursion is incorrect. We continue by solving the associated type inference problem, which consists in calculating for every subexpression the set of words the subexpression can still match when these policies are in effect, and show how this algorithm can be used to efficiently implement the matching process.

Affiliated with

Also associated with

No associations

Rating

Unique Pattern Matching in Strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unique Pattern Matching in Strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unique Pattern Matching in Strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-350246