<div>
<div class="content wysiwyg-content">
From:<br />
&nbsp; 11Word0077NewWord99<br />
<br />
Return 3 capture groups:<br />
1=11Word<br />
2= 0077<br />
3=NewWord99<br />
<br />
The first group can be found by:<br />
&nbsp; (.*?Word??) &nbsp;// anything from bof thru the string 'Word'<br />
<br />
The 2nd group will be an unknown number of digit characters<br />
<br />
The 3rd will be whatever remains after the unknown number of digits have been consumed.<br />
<br />
thx much<br />
<br />
<br />
<br />

</div>
</div>


From:
  11Word0077NewWord99

Return 3 capture groups:
1=11Word
2= 0077
3=NewWord99

The first group can be found by:
  (.*?Word??)  // anything from bof thru the string 'Word'

The 2nd group will be an unknown number of digit characters

The 3rd will be whatever remains after the unknown number of digits have been consumed.

thx much





Capture until non-digit is encountered

From:
  11Word0077NewWord99

Return 3 capture groups:
1=11Word
2= 0077
3=NewWord99

The first group can be found by:
  (.*?Word??)  // anything from bof thru the string &#39;Word&#39;

The 2nd group will be an unknown number of digit characters

The 3rd will be whatever remains after the unknown number of digits have been consumed.

thx much





A regular expression ("regex") is a sequence of characters that define a search pattern, mainly for use in pattern matching with strings, or string matching, i.e. "find and replace"-like operations. Regular expression processors are found in several search engines, search and replace dialogs of several word processors and text editors, and in the command lines of text processing utilities, such as sed and AWK. Many programming languages provide regular expression capabilities, some built-in, for example Perl, JavaScript, Ruby, AWK, and Tcl, and others via a standard library, for example .NET languages, Java, Python and C++ (since C++11). Most other languages offer regular expressions via a library.