Difference between exact greedy/reluctant X{n}?
<p>In the documentation for the Java <a href="https://docs.oracle.com/javase/7/docs/api/java/util/regex/Pattern.html"><code>Pattern</code></a> class, I see that the exact quantifier <code>X{n}</code> has both greedy and reluctant forms:</p>

<blockquote>
  <p><strong>Greedy quantifiers</strong></p>
  
  <ul>
  <li>X{n}    X, exactly n times</li>
  <li>...</li>
  </ul>
  
  <p><strong>Reluctant quantifiers</strong></p>
  
  <ul>
  <li>X{n}?   X, exactly n times</li>
  <li>...</li>
  </ul>
</blockquote>

<p>The documentation gives general examples of the difference between greedy and reluctant behavior, but doesn't give any examples for the exact quantifiers.</p>

<p>At first I thought, "Well, maybe the difference is that <code>X</code> itself could match in difference ways." But then <code>X</code> can have its own greedy/reluctant specifiers inside it, and sure enough I tested it and that's not a difference (<a href="https://regex101.com/r/hQ5dX8/1">greedy</a> vs <a href="https://regex101.com/r/cY2cL4/1">reluctant</a>).</p>

<p>Given that, in either case, it is going to match exactly <code>n</code> times, is there any difference between the behavior of the two?</p>