贪婪量词 [X {n，}] 与存在的X匹配至少n次。
X{n,} - 示例
以下示例显示了贪婪量词的用法。
package com.learnfk;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class GreedyQuantifierDemo {
private static final String REGEX="T{2,}";
private static final String INPUT="abcdTatTTfgfgTTTW";
public static void main(String[] args) {
//创建一个模式
Pattern pattern=Pattern.compile(REGEX);
</span><span class="com">//获取匹配对象</span><span class="pln">
</span><span class="typ">Matcher</span><span class="pln"> matcher</span><span class="pun">=</span><span class="pln">pattern</span><span class="pun">.</span><span class="pln">matcher</span><span class="pun">(</span><span class="pln">INPUT</span><span class="pun">);</span><span class="pln">
</span><span class="kwd">while</span><span class="pun">(</span><span class="pln">matcher</span><span class="pun">.</span><span class="pln">find</span><span class="pun">())</span><span class="pln"> </span><span class="pun">{</span><span class="pln">
</span><span class="com">//打印匹配的起始索引。</span><span class="pln">
</span><span class="typ">System</span><span class="pun">.</span><span class="kwd">out</span><span class="pun">.</span><span class="pln">println</span><span class="pun">(</span><span class="str">"Match String start(): "</span><span class="pun">+</span><span class="pln">matcher</span><span class="pun">.</span><span class="pln">start</span><span class="pun">());</span><span class="pln">
</span><span class="pun">}</span><span class="pln">
}
}
让无涯教程编译并运行以上程序，这将产生以下输出-
Match String start(): 7 Match String start(): 13
