- Java Regex Tutorial
- Java Regex - Home
- Java Regex - Overview
- Java Regex - Capturing Groups
- Java Regex - MatchResult Interface
- Java Regex - Pattern Class
- Java Regex - Matcher Class
- PatternSyntaxException Class
- Java Regex Examples
- Java Regex - Characters
- Java Regex - Character Classes
- Predefined Character Classes
- POSIX Character Classes
- Java Regex - JAVA Character Classes
- Unicode Character Classes
- Java Regex - Boundary Matchers
- Java Regex - Greedy quantifiers
- Java Regex - Reluctant quantifiers
- Java Regex - Possessive quantifiers
- Java Regex - Logical Operators
- Java Regex Useful Resources
- Java Regex - Quick Guide
- Java Regex - Useful Resources
- Java Regex - Discussion
Possesive Quantifier [X{n,m}+] Match
Description
The Possesive Quantifier [X{n,m}+] matches the X present at least n but not more than m times.
Example
The following example shows the usage of possesive quantifier.
package com.tutorialspoint; import java.util.regex.Matcher; import java.util.regex.Pattern; public class PossesiveQuantifierDemo { private static final String REGEX = "T{2,3}+"; private static final String INPUT = "abcdTatTTfgfgTTTtrtetTTTTW"; public static void main(String[] args) { // create a pattern Pattern pattern = Pattern.compile(REGEX); // get a matcher object Matcher matcher = pattern.matcher(INPUT); while(matcher.find()) { //Prints the start index of the match. System.out.println("Match String start(): "+matcher.start()); } } }
Let us compile and run the above program, this will produce the following result −
Match String start(): 7 Match String start(): 13 Match String start(): 21
javaregex_possessive_quantifiers.htm
Advertisements