|
It's not clear exactly what you are trying to extract. But either way, my suggestion is much easier.
|
|
|
|
|
The format of entries in an ini file is Key=Value . That is, get the position of the first = sign, the substring on the left is the key, the substring on the right is the value.
|
|
|
|
|
Hello and thank you both!
In order to solve the regex issue, I successfully tried to read the first three lines of each block:
\[CameraDefinition\.(?<CamNumber>\d+)\]\r\nTitle\=(?<Title>.*)\r\nGuid\=(?<Guid>\{[0-9A-Fa-f\-]*\}) Considering the results, this works well, is fast and gives me the title as an additional field. In case I recognize any errors, I'll go back to reading line by line and also consider your hint regarding general ini-file structure.
Thank you again, and have a nice day!
EDIT: Changing the critical middle part to the following helped...
\[CameraDefinition\.(?<CamNumber>\d+)\]\r\n(.*\r\n)Guid\=(?<Guid>\{[0-9A-Fa-f\-]*\})\r\n{1,} This way I have the correct matches as well. But: Still no capture if there are more lines between the top line and the GUID definition.
modified 8-May-17 6:45am.
|
|
|
|
|
Sonhospa wrote: no capture if there are more lines between ... Exactly why a regex is not the best way to do this.
|
|
|
|
|
I'm using an application called Panorama X (see provue.com) which has a function, RegExReplace, which, in a block of text, replaces every occurrence of a string defined by a regular expression with a different string. For example,
RegExReplace(TextBlock,"^[;]","//")
will search a block of text called TextBlock for all lines beginning with a semi-colon and will replace the semi-colon with two slashes.
In some lines, the ";" is preceded by a number of spaces but I still want to change it. The only way I've been able to do this is to copy the characters before the ";" and do this:
RegExReplace(TextBlock,"^[ ]+[;]",<preceding spaces=""> +"//")
which is a little clumsy.
Is there a better way to do it? I'm very new to RegEx.
michael
|
|
|
|
|
Look in the documentation of your regex engine for "capture groups". You can use a capture group to grab any leading spaces, then reference it in your replacement string. That bit will probably be called "backreference".
If you are doing anything serious with regex, I can heartily recommend Expresso[^]
Cheers,
Peter
Software rusts. Simon Stephenson, ca 1994. So does this signature. me, 2012
|
|
|
|
|
I'll check out capture groups - thank you.
And thanks for the thought on Expresso but I'm on a Mac.
michael
|
|
|
|
|
Hello,
Using Visual Studio 2015, the first following line RegEx finds the second following line Dim statement:
Dim L_V_Scalar_(Integer)_Item As \1
Dim L_V_Scalar_Integer_Item As Integer
Is there a way to write a back reference with a ^ not operator to find the following violations of my naming convention?
Dim L_V_Scalar_Integer_Item As String
I tried the following regular expressions, but they do not work:
Dim L_V_Scalar_(Integer)_Item As ^\1
Dim L_V_Scalar_(Integer)_Item As [^\1]
Many thanks.
Keith
|
|
|
|
|
There is most likely a more elegant way to do this, but this expression should work.
[EDIT] It is the second group that should be back-referenced, hence \2
Dim\s+(?<variable_name>\w_\w_\w+_(?<expected_type>\w+)_\w+)\s+As\s+(?:(?<matched_type>\2)|(?<mismatched_type>\w+))
The line
Dim L_V_Scalar_Integer_Item As Integer
will give the result
expected_type matched_type mismatched_type
Integer Integer
The line
Dim L_V_Scalar_Integer_Item As String
will give the result
expected_type matched_type mismatched_type
Integer String
Example in c#
Match m = Regex.Match("Dim L_V_Scalar_Integer_Item As String",
"Dim\s+(?<variable_name>\w_\w_\w+_(?<expected_type>\w+)_\w+)\s+As\s+(?:(?<matched_type>\2)|(?<mismatched_type>\w+))");
if (m.Success)
{
if (String.IsNullOrEmpty(m.Groups["matched_type"].Value))
{
string errorText = String.Format(@"The type '{0}' is not allowed for variable name '{1}'.
The correct type is '{2}'",
m.Groups["mismatched_type"].Value,
m.Groups["variable_name"].Value,
m.Groups["expected_type"].Value);
}
}
else
{
}
modified 18-Apr-16 1:30am.
|
|
|
|
|
Hello George,
That's very helpful.
Is there a way to get a result running this interactively in Visual Studio rather than via code? I am basically trying to find non-conformances and fix them manually, one by one.
Many thanks.
Keith
|
|
|
|
|
I suppose you could use the Code Analysis part of Visual Studio and add your own rule set.
However, if you can edit the rules depends on the version of VS you have.
Quote: In Visual Studio Ultimate, Visual Studio Premium, and Visual Studio Professional, you can create and modify a custom rule set to meet specific project needs associated with code analysis
See Using Rule Sets to Group Code Analysis Rules[^]
Another way could be to create your own Custom Tool that run through your code and show you the violations in a dialog box or something.
This is includes quite a bit of work and some understanding of COM programming.
See Implementing Single-File Generators[^] for more information.
This Codeproject article might also be helpful: Writing a Single-File Generator[^]
|
|
|
|
|
Thanks for the ideas George. I have managed to achieve the desired result in the Visual Studio Find And Replace dialog, with the following regular expression:
_Scalar_+(Boolean|Byte|Char|Date|Decimal|Double|Integer|Long|Object|SByte|Short|Single|String|UInteger|ULong|User\-Defined|UShort)_[A-Za-z0-9]+ As (?!\1)\w+
However, I am still trying to fix the problem that I describe in the following link:
<a href="http://forums.devshed.com/regex-programming-147/nested-pattern-matching-visual-studio-2015-a-973751.html">http://forums.devshed.com/regex-programming-147/nested-pattern-matching-visual-studio-2015-a-973751.html</a>[<a href="http://forums.devshed.com/regex-programming-147/nested-pattern-matching-visual-studio-2015-a-973751.html" target="_blank" title="New Window">^</a>]
KR,
Keith
|
|
|
|
|
I think you got the answer already at that site.
The expression, as given in the answer,
Dim L_V_Scalar_([^_\s]+)_([^\s]+) As (?>(\w+\.)*)(?!\1)\w+
should work for you
|
|
|
|
|
Thank you George. Yes it worked.
|
|
|
|
|
i thought it would be simpler, however i wasnt able to get regular expression for the below.
i want to extract the words which are not in a particular pattern.
say in the below sentence
clicking the (Run Match) button (or F5) to see what (happens).
i want to extract all the words which are not defined in brackets (). so the output will be
clicking
the
button
to
see
what
below is expression which i defined. it is not working. can any one point out the mistake in the expression ?
(?!\(\w+\))
modified 1-Mar-15 0:33am.
|
|
|
|
|
You haven't mentioned which language you're using. Different languages have different implementations of Regular Expressions, which support different features.
The following should work in .NET:
(?<!\()\b\w+\b(?!\))
This uses zero-width negative assertions[^] to ensure that the word doesn't start with an opening parenthesis, or end with a closing parenthesis.
"These people looked deep within my soul and assigned me a number based on the order in which I joined."
- Homer
|
|
|
|
|
How about if we just drop all the words in (parens) and display what's left?
<br />
#!/usr/bin/perl<br />
use strict;<br />
use warnings;<br />
<br />
my(@a,@b,$i,$j,$k,$s,$t);<br />
my(@out,$ins,$outs);<br />
<br />
$ins="clicking the (Run Match) button (or F5) to see what (happens). ";<br />
print "\n";<br />
$outs=$ins;<br />
$outs=~s/\(.+?\)
$outs=undupespace($outs);<br />
print "$outs\n";<br />
<br />
exit; # Exit main pgm.<br />
###################################################################<br />
sub undupespace<br />
# Remove dupe spaces. Max 1 consecutive space.<br />
{my($l)=@_;<br />
<br />
$l=~s/ {2,}/ /g;<br />
return $l; # undupespace<br />
<br />
}<br />
<br />
Output:
clicking the button to see what .
|
|
|
|
|
Hi,
Now I need a pattern to detect last name possibilities. I think this pattern will be slightly more complicated. Names that I see in the database are like:
Jones
Jones-Smith
Jones Smith (no hyphen)
O'Leary
Van Allen (no hyphen)
Vander Ark (no hyphen)
I think that this pattern will work but I would like public opinion to make sure I am getting this right:
^[a-zA-Z\-\s']+$
Can you think of any last names where this will not work? In testing it seems to work out alright.
Thanks,
Rob
|
|
|
|
|
Don't forget the characters that include diacritical marks.
E.g., ö Å ç
A positive attitude may not solve every problem, but it will annoy enough people to be worth the effort.
|
|
|
|
|
Is there a way to check for that without having to list every Unicode character? I didn't see any accented names in our database but that certainly doesn't mean it can't happen in the future.
I'd prefer to not include all Unicode characters. Just the ones with a high likelihood of showing up. I imagine that it could only be characters that would be accepted by Active Directory.
|
|
|
|
|
At least with the .NET Regex
http://msdn.microsoft.com/en-us/library/20bw873z(v=vs.110).aspx#CategoryOrBlock[^]
(I don't know about others)
you can specify the Unicode character category (for "Letter") so your regex would be:
^[\p{Ll}\p{Lu}\p{Lt}\p{Lo}\p{Lm}\-\s']+$
possibly even just
^[\p{L}\-\s']+$
A positive attitude may not solve every problem, but it will annoy enough people to be worth the effort.
|
|
|
|
|
After looking at that link, a person could go crazy trying to catch every possibility. Looks like regex can be very thorough!
Thanks for the help!
|
|
|
|
|
Yes!!
There's a reason the "Mastering Regular Expressions" book[^] is 496 pages!!!
A positive attitude may not solve every problem, but it will annoy enough people to be worth the effort.
|
|
|
|
|
How would you allow for a period only at the end of the string where in the case a name ends in Jr. or Sr.? A period wouldn't normally appear in any other position in a last name. I'm going with the pattern below so far. I'm double checking names in Active Directory but I'm reasonably sure you can't use diacritical characters. I need to research that to be certain.
^[a-zA-Z\-\s']+$
|
|
|
|
|
^[a-zA-Z\-\s']+\.$
Add the \. right before the $
A positive attitude may not solve every problem, but it will annoy enough people to be worth the effort.
|
|
|
|