regex

[Solved] Java Pattern matcher and RegEx

by

If I am not mistaken, the strings all begin with G1:k6YxekrAP71LqRv. After that, there is [P:3] by itself, or with either left S:2,3,4|, right |R:2,3,4,5 or with both left and right. The values 2,3,4 and 2,3,4,5 could be repetitive digits divided by a comma. To match the full pattern you could use: (G1:k6YxekrAP71LqRv)\[(?:S:(?:\d,)+\d\|)?(P:3)(?:\|R:(?:\d,)+\d)?\] Explanation (G1:k6YxekrAP71LqRv) … Read more

[Solved] Find pattern in Html using regex [closed]

by

try this: preg_match_all(“/(<span>\d{4}<\/span>)/”, $myinput, $myoutput); http://3v4l.org/72ClO please note this does not parse html. it looks for something that starts with <span> then has 4 digits, then </span>. A single space in there, and will fail. use this one to get the 4 digits only preg_match_all(“/<span>(\d{4})<\/span>/”, $myinput, $myoutput); http://3v4l.org/FF4Y9 solved Find pattern in Html using regex … Read more

[Solved] Failing Regex string thats correct

by

I don’t see the problem. The regex works in the Regex Hero online tester (including the capture group capturing “Beta”)… …and works in the following VB.NET snippet it generated (to which I added a Console.WriteLine call for clarity): Dim strRegex as String = “Version:</b>\s*<span>(.*)\<” Dim myRegex As New Regex(strRegex, RegexOptions.None) Dim strTargetString As String = … Read more

[Solved] How can I combine these two regex expression to one?

by

One key things to understand here is the possibility to use insensitive case, since you have the same word in both uppercase and lowercase. As for the rest, it’s basic OR operaiton. /smoke(s?)-(test|\d{1})-app-([0-9A-Fa-f\-]{36}|[0-9A-Fa-f\-]{16})/gmi Note that the i flag is important here. I’ve created a regex101 if you wish to test more cases P.S. I did … Read more

[Solved] Find RegEx for Pattern [closed]

by

Unless the text always comes in a very regular fashion, regex is not a suitable for parsing source code like this. You should write/use a parser instead. Assuming: There will be no DECLARE statements between CREATE FUNCTION and BEGIN There will not be any other statements in between the DECLARE statements There will always be … Read more

[Solved] Looking for a regex to validate Cuban identity card

by

Note: this is uses rough date validation via pure RegEx (ie. any month can have up to 31 days): [0-9]{2}(?:0[0-9]|1[0-2])(?:0[1-9]|[12][0-9]|3[01])[0-9]{5} You can test if a string matches via JavaScript like so: /[0-9]{2}(?:0[0-9]|1[0-2])(?:0[1-9]|[12][0-9]|3[01])[0-9]{5}/.test(‘82061512345’); // returns true because it is valid If you need true date validation I would do something like the following: var id1 = … Read more

[Solved] c# Regular Expression for the text below? [closed]

by

This Regex should do it. The year is currently set to 4 digits, if you only want it to match 2005, replace the \d{4} bit. ^\[Date\]\.\[Hierarchy\]\.\[Year\]\.&\[\d{4}\]\.&\[Q1\]\.&\[[A-Z-a-z]{3}\]$ Here’s the result: [Date].[Hierarchy].[Year].&[2005].&[Q1].&[Jan] // matches [Date].[Hierarchy].[Year].&[2013].&[Q3].&[Jul] // no match [Date].[Hierarchy].[Year].&[2005].&[Q1].&[Jan].&[20] // no match Edit to your comment: Make sure you put an @ before the string declaration. var … Read more

[Solved] Truncate text preserving keywords

by

const regEsc = (str) => str.replace(/[-\/\\^$*+?.()|[\]{}]/g, “\\$&”); const string = “Lorem Ipsum is simply dummy book text of the printing and text book typesetting industry. Dummy Lorem Ipsum has been the industry’s standard dummy Ipsum text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a … Read more