Partial Matching of Regular Expressions

Question

In NFA it is easy to make all previously non-final states accepting to make it match language of all substrings of a given language.

In Java regex engine, is there

Answer 1

In NFA it is easy to make all previously non-final states accepting to make it match language of all substrings of a given language.

Indeed, it can be accomplished by adding a new final state and an ε-move from each state (final or non-final) to the new final state.

Afaik there is no regex equivalent for this operation.

It is possible that some regex libraries provides a way to verify if a string is a partial match of a regex, I don't know. I don't know Java, I work mainly in PHP and it doesn't provide such a feature. Maybe there are libraries that does it but I never needed one.

For a small, specific regex you can try to build a new regex that matches strings that would partially match the original regex by combining this simple rules:

• a -> a?
• ab -> ab?
• a* -> a*
• a+ -> a*
• a|b -> (a|b)?
• etc

a and b above are sub-regexps of the original regex. Use parentheses as needed.

Answer 2

What you're looking for is called partial matching, and it's natively supported by the Java regex API (for the record, other engines which offer this feature include PCRE and boost::regex).

You can tell if an input string matched partially by inspecting the result of the Matcher.hitEnd function, which tells if the match failed because the end of the input string was reached.

Pattern pattern = Pattern.compile("a*b");
Matcher matcher = pattern.matcher("aaa");
System.out.println("Matches: " + matcher.matches());
System.out.println("Partial match: " + matcher.hitEnd());

This outputs:

Matches: false
Partial match: true