title: DiffMatchPatch regex is prone to Catastrophic Backtracking?
body: <p>Is the regex of google DiffMatchPatch in form (A*|B*|C*|D*)* ?</p>
  
  <pre><code>private static final String TAG_REGEX = "&lt;(\"[^\"]*\"|'[^']*'|[^'\"&gt;])*&gt;"; //in case the texts being compared contain XML or HTML tags
  </code></pre>
  
  <p>If I understand correctly, it should for some input strings result in stack overflow, as described here <a href="http://www.regular-expressions.info/catastrophic.html" rel="nofollow noreferrer">http://www.regular-expressions.info/catastrophic.html</a> , <a href="https://stackoverflow.com/questions/19990609/regex-gone-wild-java-util-regex-pattern-matcher-goes-into-high-cpu-loop">Regex gone wild: java.util.regex.Pattern matcher goes into high CPU loop</a> ?</p>
  
  <p>Can someone provide the example that will blow this regex ? </p>