How to form a regular expression for matching the xml tag?

hi i wanted to find the and match the xml tag for that i required to write the regex.
for exmple i have a string[] str={"<data>abc</data>"};
i want this string has to be splitted like this <data>, abc and </data>. so that i can read the splitted string value.
the above is for a small excercise but the tagname and value can be of combination of chars/digits/spl symbols like wise.
so please help me to write the regular expression for the above requirement

your suggestion is most appreciable if u can give the startup like how to do this. which parser is to be used and stuff like that

Similar Messages

Urgent!!! Problem in regular expression for matching braces

Hi,
For the example below, can I write a regular expression to store getting key, value pairs.
example: ((abc def) (ghi jkl) (a ((b c) (d e))) (mno pqr) (a ((abc def))))
in the above example
abc is key & def is value
ghi is key & jkl is value
a is key & ((b c) (d e)) is value
and so on.
can anybody pls help me in resolving this problem using regular expressions...
Thanks in advance

"((key1 value1) (key2 value2) (key3 ((key4 value4)
(key5 value5))) (key6 value6) (key7 ((key8 value8)
(key9 value9))))"
I want to write a regular expression in java to parse
the above string and store the result in hash table
as below
key1 value1
key2 value2
key3 ((key4 value4) (key5 value5))
key4 value4
key5 value5
key6 value6
key7 ((key8 value8) (key9 value9))
key8 value8
key9 value9
please let me know, if it is not possible with
regular expressions the effective way of solving itYes, it is possible with a recursive regular expression.
Unfortunately Java does not provide a recursive regular expression construct.
$_ = "((key1 value1) (key2 value2) (key3 ((key4 value4) (key5 value5))) (key6 value6) (key7 ((key8 value8) (key9 value9))))";
my $paren;
   $paren = qr/
           [^()]+ # Not parens
         |
           (??{ $paren }) # Another balanced group (not interpolated yet)
    /x;
my $r = qr/^(.*?)$(\w+?) (\w+?|(??{$paren}))$\s*(.*?)$/;
while ($_) {
     match()
# operates on $_
sub match {
     my @v;
     @v = m/$r/;
     if (defined $v[3]) {
          $_ = $v[2];
          while (/\(/) {
               match();
          print "\"",$v[1],"\" \"",$v[2],"\"";
          $_ = $v[0].$v[3];
     else { $_ = ""; }
C:\usr\schodtt\src\java\forum\n00b\regex>perl recurse.pl
"key1" "value1"
"key2" "value2"
"key4" "value4"
"key5" "value5"
"key3" "((key4 value4) (key5 value5))"
"key6" "value6"
"key8" "value8"
"key9" "value9"
"key7" "((key8 value8) (key9 value9))"
C:\usr\schodtt\src\java\forum\n00b\regex>

Regular Expression for Match Pattern (string) Function

I need to find a variable length string enclosed by brackets and
within a string. Can't seem to get the regular expression right for
the Match Pattern function. I'm able to get the job done using the
Token function, but it's not as slick or tight as I'd like. Does
anybody out there have the expression for this?

Jean-Pierre Drolet wrote in message news:<[email protected]>...
> The regular expression is "\[[~\]]*\]" which means:
> look for a bracket "\[" (\ is the escape char)
> followed by a string not containing a closing bracket "[~\]]*"
> followed by a closing bracket "\]". The match string include the
> brackets
>
> You can also read "Scan from String" with the following format:
> "%[^\[]\[%[^\[\]]" and read the 2nd output. The brackets are removed
> from the scanned string.
Thanks, Jean_Pierre
I did some more experimenting after posting and found that \[.*\] also
works with the match pattern function. Thanks for your input.
sm

Regular expressions for matching file path

Could someone give me idea that how can i compare a fixed path, with the paths user gives using regular expressions?
My fixed path is : src\com\sample\demo\work\gui\.**
and user may give like src\com\sample\demo\work\gui\test.jsp, src\com\sample\demo\work\gui\init.jsp etc.
Any ideas are appreciated and thanks in advance.

...and if you insist on using regexes, you'll have to double-escape the backslashes: if ( userString.matches("src\\\\com\\\\sample\\\\demo\\\\work\\\\gui\\\\.*") ) { Whether you use regexes or not, you'll save yourself a lot of hassle by converting all backslashes to forward slashes before you do anything with the strings: userString = userString.replace('\\', '/');
if ( userString.matches("src/com/sample/demo/work/gui/.*") ) {
// or...
if ( userString.startsWith("src/com/sample/demo/work/gui/") ) {

Regular Expression for match pattern

Hi guys, I need some help.
In one part of my test system, I give to the program a sequence of temperatures, which are numbers separated by a comma. Due to a possible error, the user can forget the coma, and the program gets unexpected values.
For example, "20, 70, -10" is a right value, whereas "20 70, -10" would be a wrong one.
Which regular expression will detect this comma absence?
Thanx in advance.

OK, makes it more difficult (and more fun )
My original version failed also when the space was forgotten. DOH!
Try this version. It get's complicated cause the scan from string likes ignoring spaces... So we change the spaces
Hope this helps
Shane.
PS The ideas given by others are still a better solution, but if you're stuck........
Using LV 6.1 and 8.2.1 on W2k (SP4) and WXP (SP2)
Attachments:
Check input string with commas(array).vi ‏39 KB

How can I use regular expression to match this rule

I have a String ,value is "<a>1</a><a>2</a><a>3</a>",and want to match other String like "<a>1</a><a>8</a>",if the one of the first string(like "<a>1</a>") will occur in the second string,then will return true.but I don't know how to write the regular expresstion.
Thx

Fine fine. :P
I was a little bored, so here's some code that uses Strings and a StringBuffer (though you could use a String in place of the StringBuffer). Is this perhaps better? :)
          String testMain = "<a>1</a><ab>2</ab><ab>3</ab>";
          String test = "<ab>1</ab><ab>3</ab>";
          String open = "<ab>";
          String close = "</ab>";
          StringBuffer search = new StringBuffer();
          String checkString = null;
          int lastCheck = 0;
          int start = 0;
          int finish = 0;
          boolean done = false;
          while (!done) {
               start = test.indexOf(open);
               finish = test.indexOf(close);
               if ((start == -1) || (finish == -1)) {
                    System.out.println("No more tags to search for.");
                    done = true;
               else {
                    checkString = test.substring((start + open.length()), finish);
                    search = new StringBuffer();
                    search.append(open);
                    search.append(checkString);
                    search.append(close);
                    if (testMain.indexOf(search.toString()) != -1) {
                         System.out.println("Found value: " + checkString);
                    test = test.substring(finish + close.length());
Resulting output:
Found value: 3
No more tags to search for.
-G

What is regular expression for cheking a set operation

I want a regular expression for checking the syntax of the set operation given as input
ex:
the input should be
[1,2,3]+[2,3] or [1,2]-[2] or [1,2,3]*[1,2]
is should check the square bracket and the operator between two set operands

I think you should code that from scratch. When you validate input, you usually want to tell the user what they did wrong, but a regex will only tell you whether it matches or not.

Regular expressions for xml parsing

I have a xml parsing problem that I have to solve using regular expressions. It's not possible for me to use a different method other than regular expression. But there is a problem that I cannot seem to rap my head around. I want to extract the contents of a tag but the problem is that this tag occurs serveral times in the XML file but I only want the contents of one particular occurence. Basically the problem is as follows;
I want to extract
<bp:NAME ***stufff***>(I want this part)</bp:NAME>This tag can occur is serval places. For example here;
<bp:ORGANISM>
***bunch of tags***
<bp:NAME ***stufff***>***stufff***</bp:NAME>
***bunch of tags***
</bp:ORGANISM>or here;
<bp:DATABASE>
***bunch of tags***
<bp:NAME ***stufff***>***stufff***</bp:NAME>
***bunch of tags***
</bp:DATABASE>I do not want the content of those tags. I want the content of the <NAME> tag that is not between either the <ORGANISM> tags or the <DATABASE> tags. These tags can be in any order. I for the life of me cannot seem to figure this problem out. I tried several different approaches. For example I tried using the following regex
(?:<bp:NAME [^>]*>([^<]*).*?<bp:ORGANISM>.*?</bp:ORGANISM>|
<bp:ORGANISM>.*?</bp:ORGANISM>.*?<bp:NAME [^>]*>([^<]*))This kind of works, the information I want is either in the first captured group or in the second one. So I just check which group is not empty and that is the one I want. But this only works if there is only one other tag containing the name tag (in this particular regular expression that is the organism tag). Since there is another tag (the database tag) I have to work around, and these tags can be in any order, the regular expression then becomes three times as large and then there are six different groups in which the information I want can occur. This does not seem like a good idea to me. There has to be another way to do this. So I tried using the following regex;
(?:</bp:ORGANISM>)?.*?(?:</bp:DATABASE>)?.*?<bp:NAME [^>]*>([^<]*)I thought this would get rid of any occurences of the other tags in front of the name tag, but it doesn't work either. It seems like it is not greedy enough. Well I think you get the point. I don't know what to try next so I really need some help.
Here is an example of the type of data I will run into. The tags can be in any order and they do not always have to occur. In the example below the <DATABASE> tag is not part of the data and the name tag I want just happens to be in front of the organism tag but this is not always the case. The name tag I want is the firstname tag in the file, namely;
<bp:NAME rdf:datatype="xsd:string">Progesterone receptor</bp:NAME>So I don't want the name tag that is in between the organism tags.
<bp:protein rdf:ID="CPATH-27885">
−<bp:COMMENT rdf:datatype="xsd:string">
Belongs to the nuclear hormone receptor family. NR3 subfamily. SIMILARITY: Contains 1 nuclear receptor DNA-binding domain. WEB RESOURCE: Name=NIEHS-SNPs; URL="http://egp.gs.washington.edu/data/pgr/"; WEB RESOURCE: Name=Wikipedia; Note=Progesterone receptor entry; URL="http://en.wikipedia.org/wiki/Progesterone_receptor"; GENE SYNONYMS: NR3C3. COPYRIGHT: Protein annotation is derived from the UniProt Consortium (http://www.uniprot.org/). Distributed under the Creative Commons Attribution-NoDerivs License.
</bp:COMMENT>
<bp:SYNONYMS rdf:datatype="xsd:string">Nuclear receptor subfamily 3 group C member 3</bp:SYNONYMS>
<bp:SYNONYMS rdf:datatype="xsd:string">PR</bp:SYNONYMS>
<bp:NAME rdf:datatype="xsd:string">Progesterone receptor</bp:NAME>
−<bp:ORGANISM>
−<bp:bioSource rdf:ID="CPATH-LOCAL-112384">
<bp:NAME rdf:datatype="xsd:string">Homo sapiens</bp:NAME>
−<bp:TAXON-XREF>
−<bp:unificationXref rdf:ID="CPATH-LOCAL-112385">
<bp:DB rdf:datatype="xsd:string">NCBI_TAXONOMY</bp:DB>
<bp:ID rdf:datatype="xsd:string">9606</bp:ID>
</bp:unificationXref>
</bp:TAXON-XREF>
</bp:bioSource>
</bp:ORGANISM>
<bp:SHORT-NAME rdf:datatype="xsd:string">PRGR_HUMAN</bp:SHORT-NAME>
−<bp:XREF>
−<bp:relationshipXref rdf:ID="CPATH-LOCAL-112386">
<bp:DB rdf:datatype="xsd:string">ENTREZ_GENE</bp:DB>
<bp:ID rdf:datatype="xsd:string">5241</bp:ID>
</bp:relationshipXref>
</bp:XREF>
−<bp:XREF>
−<bp:unificationXref rdf:ID="CPATH-LOCAL-112387">
<bp:DB rdf:datatype="xsd:string">UNIPROT</bp:DB>
<bp:ID rdf:datatype="xsd:string">P06401</bp:ID>
</bp:unificationXref>
</bp:XREF>
−<bp:XREF>
−<bp:unificationXref rdf:ID="CPATH-LOCAL-112388">
<bp:DB rdf:datatype="xsd:string">UNIPROT</bp:DB>
<bp:ID rdf:datatype="xsd:string">A7X8B0</bp:ID>
</bp:unificationXref>
</bp:XREF>
−<bp:XREF>
−<bp:relationshipXref rdf:ID="CPATH-LOCAL-112389">
<bp:DB rdf:datatype="xsd:string">GENE_SYMBOL</bp:DB>
<bp:ID rdf:datatype="xsd:string">PGR</bp:ID>
</bp:relationshipXref>
</bp:XREF>
−<bp:XREF>
−<bp:relationshipXref rdf:ID="CPATH-LOCAL-112390">
<bp:DB rdf:datatype="xsd:string">REF_SEQ</bp:DB>
<bp:ID rdf:datatype="xsd:string">NP_000917</bp:ID>
</bp:relationshipXref>
</bp:XREF>
−<bp:XREF>
−<bp:unificationXref rdf:ID="CPATH-LOCAL-112391">
<bp:DB rdf:datatype="xsd:string">UNIPROT</bp:DB>
<bp:ID rdf:datatype="xsd:string">Q9UPF7</bp:ID>
</bp:unificationXref>
</bp:XREF>
−<bp:XREF>
−<bp:unificationXref rdf:ID="CPATH-LOCAL-113580">
<bp:DB rdf:datatype="http://www.w3.org/2001/XMLSchema#string">CPATH</bp:DB>
<bp:ID rdf:datatype="http://www.w3.org/2001/XMLSchema#string">27885</bp:ID>
</bp:unificationXref>
</bp:XREF>
</bp:protein>Edited by: Dani3ll3 on Nov 19, 2009 2:51 AM

Dani3ll3 wrote:
Thanks a lot after I did that the regular expression worked. :)Good. But remember that in real life, you would then have to apply the XML rules to get the actual contents of the text node. For example it might be a CDATA section or it might include characters like ampersands which have been escaped and which you need to unescape. That's why it's better to use a proper parser, as already suggested.
It seems to me this forum is full of posts where people are doing homework questions which teach them to do things the wrong way. But of course there's nothing the student can do about that.

How to write the regular expression for Square brackets?

Hi,
I want regular expression for the [] Square brackets.
I have tried to insert in the below code but the expression not validate the [] square brackets.
If anyone knows please help me how to write the regular expression for [] Square brackets.
private static final Pattern DESC_PATTERN = Pattern.compile("({1}[a-zA-Z])" +"([a-zA-Z0-9\\s.,_():}{/&#-]+)$");Thanks
Raghav

Since square brackets are meta characters in regex they need to be escaped when they need to be used as regular characters so prefix them with \\ (the escape character).

Regular expressions for file/FTP transport within OSB. How?

The OSB transport/polling guides say for the FILE, FTP and SFTP transports that the "File Mask" can be a Regular Expression but I can't get it to pick up files this way. Is there some trick to enabling regular expression mode or some strange syntax required?
For example I set up a very simple pattern of [A-Z]+ which should match any filename with one or more uppercase alphabetic characters only, but it does not pick up anything. It seems only to support the usual wildcard * operator in the non-regular expression mode.
Any help much appreciated.

Good point, but if you think about this description, you have to realize it just doesn't make sense. Again ...
Enter a regular expression to select the files that you want to pick from the directory. The default value is \*.*The problem is that \*.* is not a regular expression at all. :-)
1. The documentation is a mess in this particular point.
2. FTP servers (at least those I have experienced) don't have a support for regular expressions.
So I guess you can use only wildcards and not regular expressions with FTP transport.

Regular expression for middle of string

Bit of background. I'm getting both text (can contain numbers) and data (only numbers) from serial. Since I don't know which I'm receiving and when it starts/ends, I'm making the sender send "textSTART###textSTOP" where "###" is what I want to extract. ### can contain text, numbers, new line, carrige return or whatever.
The same for data&colon; "dataSTART###dataSTOP", where ### contains only numbers.
I think I should use Match Pattern, but I don't know how to make my regular expression.
Any help is appreciated.
Solved!
Go to Solution.

If the string does not contain anything outside these "delimiters" and there are exactly two per string, you could simply use scan strings for tokens. You can also add the "dataSTART/STOP" delimiters to the array to make it universal and look at the beginning of the raw string to determine if you are dealing with a "data" or "text" message.
Here's a quick draft.
LabVIEW Champion . Do more with less code and in less time .
Attachments:
TaggedText.png ‏10 KB

"Match Regular Expression" and "Match Pattern" vi's behave differently

Hi,
I have a simple string matching need and by experimenting found that the "Match Regular Expression" and "Match Pattern" vi's behave somewhat differently. I'd assume that the regular expression inputs on both would behave the same. A difference I've discovered is that the "|" character (the "vertical bar" character, commonly used as an "or" operator) is recognized as such in the Match Regular Expression vi, but not in the Match Pattern vi (where it is taken literally). Furthermore, I cannot find any documentation in Help (on-line or in LabVIEW) about the "|" character usage in regular expressions. Is this documented anywhere?
For example, suppose I want to match any of the following 4 words: "The" or "quick" or "brown" or "fox". The regular expression "The|quick|brown|fox" (without the quotes) works for the Match Regular Expression vi but not the Match Pattern vi. Below is a picture of the block diagram and the front panel results:
The Help says that the Match Regular Expression vi performs somewhat slower than the Match Pattern vi, so I started with the latter. But since it doesn't work for me, I'll use the former. But does anyone have any idea of the speed difference? I'd assume it is negligible in such a simple example.
Thanks!
Solved!
Go to Solution.

Yep-
You hit a point that's frustrated me a time or two as well (and incidentally, caused some hair-pulling that I can ill afford)
The hint is in the help file:
for Match regular expression "The Match Regular Expression function gives you more options for matching
strings but performs more slowly than the Match Pattern function....Use regular
expressions in this function to refine searches....
Characters to Find
Regular Expression
VOLTS
VOLTS
A plus sign or a minus sign
[+-]
A sequence of one or more digits
[0-9]+
Zero or more spaces
\s* or * (that is, a space followed by an asterisk)
One or more spaces, tabs, new lines, or carriage returns
[\t \r \n \s]+
One or more characters other than digits
[^0-9]+
The word Level only if it
appears at the beginning of the string
^Level
The word Volts only if it
appears at the end of the string
Volts$
The longest string within parentheses
The first string within parentheses but not containing any
parentheses within it
$[^()]*$
A left bracket
A right bracket
cat, cag, cot, cog, dat, dag, dot, and dag
[cd][ao][tg]
cat or dog
cat|dog
dog, cat
dog, cat cat dog,cat
cat cat dog, and so on
((cat )*dog)
One or more of the letter a
followed by a space and the same number of the letter a, that is, a a, aa aa, aaa aaa, and so
on
(a+) \1
For Match Pattern "This function is similar to the Search and Replace
Pattern VI. The Match Pattern function gives you fewer options for matching
strings but performs more quickly than the Match Regular Expression
function. For example, the Match Pattern function does not support the
parenthesis or vertical bar (|) characters.
Characters to Find
Regular Expression
VOLTS
VOLTS
All uppercase and lowercase versions of volts, that is, VOLTS, Volts, volts, and so on
[Vv][Oo][Ll][Tt][Ss]
A space, a plus sign, or a minus sign
[+-]
A sequence of one or more digits
[0-9]+
Zero or more spaces
\s* or * (that is, a space followed by an asterisk)
One or more spaces, tabs, new lines, or carriage returns
[\t \r \n \s]+
One or more characters other than digits
[~0-9]+
The word Level only if it begins
at the offset position in the string
^Level
The word Volts only if it
appears at the end of the string
Volts$
The longest string within parentheses
The longest string within parentheses but not containing any
parentheses within it
([~()]*)
A left bracket
A right bracket
cat, dog, cot, dot, cog, and so on.
[cd][ao][tg]
Frustrating- but still managable.
Jeff

Regular exression for matching function declarations or calls

Hi guys,
I used a regular expression like \\w + (\\s*) \$ .*\$ (\\s*) [\\{;] to match function
declarations.This regular expression works fine for all the declarations of the form init_queue(TREE **NODE) { and even for declarations of the form
init_queue (TREE **NODE)
But the problem occurs when i have a declaration of the form
init_queue(TREE **NODE ,
int size ) {
when i have a declaration of this form my regular expression doesnt parse function names.The regular expression . (DOT) means it recognizes anything except for line terminators.So i used the DOTALL option in pattern matching so that .(DOT) matches even line terminators.But using this has a negative effect like i am not able to match declarations of the form
init_queue(TREE **NODE) {
can anyone help me out in solving this
Thank you,
Akash

multipost: http://forum.java.sun.com/thread.jspa?threadID=5168705

Using Regular Expressions for Completion

I'm trying to build a text completer for a simple little editor. The general idea is that I have a regular expression which describes the syntax of an expression and a set of strings which are all semantically valid cases of the expression (the latter of which is not particularly important to my problem). I would like to be able to determine, using the expression described, whether or not a section of text is capable of beginning a syntactically valid expression, not matching it.
For example, given the expression
"#[A-Za-z0-9]#" the string "#name#" is syntactically valid, whereas the string "#_blarg" is not. What I would like to do is be able to determine that "#partial" has the potential to match the pattern with more input, even if it doesn't yet. Specifically, the eventual use will be in such a case as the string X=#partial+3. If the cursor is positioned before the "+" and my user presses the completion keystroke, I want to recognize that "#partial" is what I need to recognize. Also, positioning the cursor immediately after the "=" and pressing the keystroke will do nothing, since nothing before the "=" is capable of matching the pattern properly.
Is this possible? I don't have to use this exact approach, but it is important that I be able to use the regular expression in detecting a partially completed expression. If I can, the set of regular expressions which already exist in the code can be used to drive the auto completer. Otherwise, I'll have to write a special recognition module for each case; that wouldn't be pretty.
Thanks for your time! I'll provide other information upon request, if it'd help. :)

Thank you both for discussing this; it has definitely helped me in reaching a better understanding of uncle_alice's answer to my problem. I've adjusted my code to use this approach and, for the most part, it seems to work.
I say "for the most part" because I am compiling Patterns with the case insensitivity flag. This appears to do horrible, horrible things. Take a look at the following code, modified from uncle_alice's example:
String[] str = {"#test#hello", "#tes", "blargblarg", "", "#test#", "S"};
String rgx = "#[A-Za-z0-9]+#";
Pattern pc = Pattern.compile(rgx);
Pattern pi = Pattern.compile(rgx, Pattern.CASE_INSENSITIVE);
for (String s : str)
    System.out.println("    For string: "+s);
    for (Pattern p : new Pattern[]{pc, pi}) // once for each pattern
        Matcher m = p.matcher(s);
        if (m.matches())
            System.out.printf("Matched '%s'", m.group());
        } else
            System.out.print("No match");
        System.out.println("; hitEnd = " + m.hitEnd());
}That produces the following output:
    For string: #test#hello
No match; hitEnd = false
No match; hitEnd = true
    For string: #tes
No match; hitEnd = true
No match; hitEnd = true
    For string: blargblarg
No match; hitEnd = false
No match; hitEnd = true
    For string:
No match; hitEnd = true
No match; hitEnd = true
    For string: #test#
Matched '#test#'; hitEnd = false
Matched '#test#'; hitEnd = false
    For string: S
No match; hitEnd = false
No match; hitEnd = trueIt would seem that, with the case-insensitive flag set, hitEnd always returns true unless a match is found. Why is this? I find it quite confusing.
I can adjust my design to accomodate if this problem cannot be circumvented; however, I'd like to understand what has going wrong here. :)
Cheers! Thanks so much for all your help!

Using regular expressions for validation in i18n

Can we use regular expressions for validation of inputs in a java application taking care of i18N aspects too. Zip code for different locales are different. Can we use regular expressions to validate zipcode inputs from different locales

hi,
For that shall i have to create individual patterns for matching the inputs from different locales or a single pattern will do in the case of validating phone nos. around the world, zip codes etc. In case different patterns are required, programmer should have a konwledge of difference in patters for different locales.
regards
sdas

How to form a regular expression for matching the xml tag?

Similar Messages

Maybe you are looking for