Java pattern matching - perl like

I have an XML file and I try to match something like this:
Pattern p = Pattern.compile("category code=\\S{1,} validFrom=\\S{1,}");
Matcher m = p.matcher (content);
while (m.find ()) {
System.out.println ("Found " + m.group ());
This code works and extracts groups according to the pattern but I want to extract only the value.
Exemple:
the string is: category code=23 validFrom=2011-01-01
I want to extract only *23* and *2011-01-01*.
Can I do this without manualy parsing the string?
Thank you.

XPath is the best solution for this. If you must have regex, see java.until.regex.

Similar Messages

Java Pattern Matcher (Pattern.class bug? Stuck in Infinite Loop)

Hi,
I'm using the java pattern matcher and it appears to be stuck in an infinite loop and will not return from Pattern.class.
It stays stuck in the following two code sequences...
I'm using the following regex...
java.util.regex.Matcher[pattern=[a-z0-9!#$%&'*+/=?^_`{|}~-]+(?:\.[a-z0-9!#$%&'*+/=?^_`{|}~-]+)*@(?:[a-z0-9](?:[a-z0-9-]*[a-z0-9])?\.)+(?:[A-Z]{2}|com|org|net|biz|info) region=0,353648 lastmatch=
MAIN BLOCK STUCK IN LOOP:
boolean study(TreeInfo info) {
if (type != INDEPENDENT) {
int minL = info.minLength;
atom.study(info);
info.minLength = minL;
info.deterministic = false;
return next.study(info);
} else {
atom.study(info);
return next.study(info);
SECOND BLOCK STUCK IN LOOP:
boolean match(Matcher matcher, int i, CharSequence seq) {
// Check for zero length group
if (i > matcher.locals[beginIndex]) {
int count = matcher.locals[countIndex];
if (count < cmin) {
matcher.locals[countIndex] = count + 1;
boolean result = body.match(matcher, i, seq);
// If match failed we must backtrack, so
// the loop count should NOT be incremented
if (!result)
matcher.locals[countIndex] = count;
return result;
if (next.match(matcher, i, seq))
return true;
if (count < cmax) {
matcher.locals[countIndex] = count + 1;
boolean result = body.match(matcher, i, seq);
// If match failed we must backtrack, so
// the loop count should NOT be incremented
if (!result)
matcher.locals[countIndex] = count;
return result;
return false;
return next.match(matcher, i, seq);
Is this a bug with the Java 1.6 Pattern Matcher?
Thanks
V$h3r

The Java Pattern Matcher is getting stuck in the following code...
boolean study(TreeInfo info) {
if (type != INDEPENDENT) {
int minL = info.minLength;
atom.study(info);
info.minLength = minL;
info.deterministic = false;
return next.study(info);
} else {
atom.study(info);
return next.study(info);
boolean match(Matcher matcher, int i, CharSequence seq) {
// Check for zero length group
if (i > matcher.locals[beginIndex]) {
int count = matcher.locals[countIndex];
if (count < cmin) {
matcher.locals[countIndex] = count 1;
boolean result = body.match(matcher, i, seq);
// If match failed we must backtrack, so
// the loop count should NOT be incremented
if (!result)
matcher.locals[countIndex] = count;
return result;
if (next.match(matcher, i, seq))
return true;
if (count < cmax) {
matcher.locals[countIndex] = count + 1;
boolean result = body.match(matcher, i, seq);
// If match failed we must backtrack, so
// the loop count should NOT be incremented
if (!result)
matcher.locals[countIndex] = count;
return result;
return false;
return next.match(matcher, i, seq);
}Here is a copy of the REGEX that I'm using...
It works on most of the other STRINGS but when I do a REGEX on the the html source for http://www.exponent.com it will get stuck...
Pattern p = Pattern.compile("[a-zA-Z0-9+_~-]+(?:\\.[a-zA-Z0-9+_~-]+)*@(?:[a-zA-Z0-9](?:[a-zA-Z0-9-]*[a-zA-Z0-9])?\\.)+(?:com|org|net|biz|info|[a-zA-Z]{2})");Thanks,
V$h3r

Java pattern matching

Hi all
i want to delete some particular string likes "<?xml:namespace prefix = o ns = "urn:schemas-microsoft-com:office:office" />" , "<?xml:namespace prefix = o ns = \"urn:schemas-microsoft-com:office:smarttags" />" from my string. for that i'm using regex mattern matching to delate like this string from my string.. Below is my code for deleting like this string from my string.....
public static String getPattern(String htmlcontent){
 Pattern p = null;
 Pattern palign = null;
 String splitPattern = "<?xml:namespace.*"+ICAReportConstants.URN_TAG+"./>";
 try{
 p = Pattern.compile(splitPattern);
 catch(PatternSyntaxException e){
 e.printStackTrace();
 StringBuffer s = new StringBuffer(htmlcontent);
 Matcher m = p.matcher (s);
 while(m.find()){
 s.delete(m.start()-2,m.end());
 return s.toString();
But my code doesnt work properly. here the htmlcontent is my string is passing to the getpattern method.. Please do advise me.... asap. Tks

FYI, you're making this task a lot more difficult than it needs to be. You can replace all the code in that method with return htmlcontent.replaceAll("<\\?xml:namespace.*?\"" + ICAReportConstants.URN_TAG + "\"./>", "");except that this approach won't remove the two characters preceding the tag. You should be matching them with the regex anyway, instead of using that egregious "m.start() - 2" hack, so what are they? If they're whitespace, you can add "\\s\\s" to the beginning of the regex, or maybe "\\s+".
However, even with the reluctant dot-star, that regex isn't really correct. If it encounters a tag that starts with "<?xml:namespace" but doesn't contain the URN_TAG string, it will run on past the end of the tag it's in and keep looking. It will probably get stopped by a line separator before it finds an incorrect match (assuming you haven't used the DOTALL flag), but it will still waste a lot of time looking. Judging by the examples you provided, this regex should match correctly or fail quickly: "\\s++<\\?xml:namespace[^/\"]*+\"" + ICAReportConstants.URN_TAG + "\"\\s*+/>"

OBIEE 11G : Remove label (is like pattern match) in the prompt

Hi Experts,
I have Gone through this thread Re: OBIEE 11G : Remove label (is like pattern match) in the prompt and applied JS as mentioed but
It works for the first display of the page but its back as soon as you hit the apply button
can be it be removed permanently? Thanks in Advance

Hi Nagen,
You can try the following:
Create a variable prompt with the column vales that you want to match
Create a filter in the analysis criteria tab on the column, set to pick up the variable, and define the IS LIKE here.
It is effectively doing the same task as the standard prompt approach does, but in a round-a-bout way which doesn't include adding any of Oracle's text in.

How to use AND,OR,NOT condition in Pattern Matching in java

how to use AND,OR,NOT condition in Pattern Matching in java
Please anyone give example..

Stop asking these stupid vague questions and do some of your own research.
Start here:
http://www.regular-expressions.info/
http://java.sun.com/j2se/1.5.0/docs/api/java/util/regex/Pattern.html

Regular expression and pattern matching/replacing

I have a list of key words. It has around 1000 key word now but can grow to 5000 keywords.
My web application displays lot of texts which are stored in the database. My requirement is to scan each text for the occurance of any of the above keywords. If any keyword is present I have to replace that with some custom values, before showing it to the user.
I was thinking of using using regular expression for replacing the keyword in the text using matcher.replaceAll method as follows:
Pattern pattern = Pattern.compile(patternStr);
Matcher matcher = pattern.matcher(inputStr);
String output = matcher.replaceAll(replacementStr);
But My pattern string will have around 5000 keywords with the 'OR' Logical Operator like- keyword1| keyword2 I keyword3 | ..........
Will such a big pattern string adversly affect the performance? What can I do to speed up the performance? (Since my keyword list is not static i would prefer to do the replacement just before showing the text to the user)
Any suggestions are most welcome.

I don't think a pure regex approach would be that slow, but it would be a maintenance nightmare. I think a combined regex/table-lookup approach would be best: use a regex to identify potential keywords, then look them up in the table to confirm. For instance, to find all Java keywords you could use the regex "\\b[a-z]{2,12}+\\b" to filter out anything that can't possibility be a keyword.
What are you going to replace the keywords with? Will it vary depending on which keyword is found? If so, you'll have to use a table--and you won't be able to use the replaceAll method, because it can't handle dynamically generated replacement values. You would have to use the lower-level appendReplacement and appendTail method instead.

Latin 1 supplement for Pattern matching

Hi All,
I am trying to pattern match a string with the following pattern:
"\\p{InLatin1Supplement}+"(want to allow only characters in Latin 1 Supplement charset)
However I get java.util.regex.PatternSyntaxException: Unknown character family {Latin1Supplement}Please suggest what should be the proper string for the pattern.
Thank you !!

Hm, have your checked Blocks-3.txt, as it says in the javadocs?
"Unicode blocks and categories are written with the \p and \P constructs as in Perl. \p{prop} matches if the input has the property prop, while \P{prop} does not match if the input has that property. Blocks are specified with the prefix In, as in InMongolian. Categories may be specified with the optional prefix Is: Both \p{L} and \p{IsL} denote the category of Unicode letters. Blocks and categories can be used both inside and outside of a character class.
The supported blocks and categories are those of The Unicode Standard, Version 3.0. The block names are those defined in Chapter 14 and in the file Blocks-3.txt of the Unicode Character Database except that the spaces are removed; "Basic Latin", for example, becomes "BasicLatin". The category names are those defined in table 4-5 of the Standard (p. 88), both normative and informative."
Other than that, I don't know, sorry.

SQL pattern matching

Hi experts,
I have a requirement for which I need to write a SQL. On our orders search screen there are 2 prompts.
1) Dealer name (Table.column - DLR_NAM)
2) State name (Table.column - STATE_NAM)
When user wants to find the orders placed by all dealers whose name starts with 'A' and state name with 'B', then our query is something like this
SELECT ORDER_ID, ORDER_ITEM, ORDER_QTY, ORDER_VALU
FROM ORDERS
WHERE DLR_NAM LIKE 'A%'
AND STATE_NAM LIKE 'B%'; -- A and B entered by user in the respective prompt text box
But there are countries like Greece for which states doesn't exists. In that case STATE_NAME is NULL and the above query becomes something like the below and doesn't return right results
SELECT ORDER_ID, ORDER_ITEM, ORDER_QTY, ORDER_VALU
FROM ORDERS
WHERE DLR_NAM LIKE 'A%'
AND STATE_NAM LIKE '%'; -- Pattern matching goes wrong due to this AND clause.
Please suggest how to fix this. It appears simple and my brain is not working after non-stop working for several days.

You are saying that the user types something in both variables.
And then this query:
SELECT ORDER_ID, ORDER_ITEM, ORDER_QTY, ORDER_VALU
FROM ORDERS
WHERE DLR_NAM LIKE :bind_dealer || '%'
AND ( (:bind_state IS NULL) OR (:bind_state IS NOT NULL AND STATE_NAM LIKE :bind_state || '%') );returns rows with STATE_NAM null.
That does not make sense. If the users types in both variables, then the bindvariable :bind_state is not null, and then STATE_NAM has to begin with the value of :bind_state.
The only thing I can think of is if you are binding wrong? What is your application coded in? C#? Java? ASP? .NET? How do you prepare your SQL query from your user inputs?
You will have to post a test case. Create table, insert some test data, run the sql and show it returns the wrong result. I cannot think of any problem without knowing more details :-)

Help for image pattern matching

Hello Everyone
I am working for my last year project. In my project I will work on the image processing to find a moving object. I will work by JMF. I have finished to grab a frame from the webcam video clips. Now I need a algorithm to find a Image pattern from the grabed image. But I donot know which algorithm is fine for image pattern matching as well as how can I implement in java. Is anyone know please help me very urgently.
Thank you
Md. Mainul Hasan

If you would like to take a look at http://www.exactfutures.com/index01.htm and http://www.exactfutures.com/index02.htm and http://www.codeproject.com/useritems/activity.asp then these pages and links may well be useful to you. It may not be exactly what you are looking for, but it does point to some examples with source for video analytics, and at the very least they illustrate how to capture & handle the data including a fast movement detection algorithm. If you want to find a specific shape then search the internet for information on chamfer distance transforms - one can use JMF or extend these simple examples to apply those techniques.

Pattern-Matcher

hi guys.. i need help on pattern-matcher. below is a simplified portion of my problem.
using line A, if you run it.. u will see that when u type in *&word*, the result would be Doesn't Match. i believe it is due to the *\b* notation in the Pattern.compile where it specifies the word boundary that excludes whitespaces and punctuation mark.
I know it will work when i use line B instead. but the occurance would also be detected when i input blabla&word or *&wordblabla* or bla&wordbla (this is true but somehow it doesn't work in this simplified code)
thus.. my question is.. how do i specify a word boundary (like what \b does) and at the same time.. allow for punctuation marks to occur in my word?
for example.. i would like to encounter for these patterns:
*<word>*
*&word*
i hope u guys can help me out. thank you in advance.
import javax.swing.*;
import java.util.regex.*;
public class PatternMatcherTest
 public PatternMatcherTest()
 String regex = "&word";
 Pattern p = Pattern.compile("\\b" + regex + "\\b"); // -- line A
 //Pattern p = Pattern.compile(regex); // -- line B
 Matcher m = p.matcher(JOptionPane.showInputDialog(null, "Enter string: "));
 if (m.matches())
 System.out.println("Match!");
 else
 System.out.println("Doesn't Match");
 public static void main (String [] args)
 PatternMatcherTest pmt = new PatternMatcherTest();
}

I'm not sure I understand your requirements, but try this: Pattern p = Pattern.compile("(?<!\\w)" + regex + "(?!\\w)"); If that doesn't solve your problem, post some examples of inputs and the outputs that you want to get for them.
hlfrk414 wrote:
Have you tried making the word boundaries reluctant? If you want to see if the punctuation matches later, then change the \b to \b??
The ?? tell the regex to choose the minimum needed to make the group happy. So the \b?? wont take punctuation unless no other groups want it.Ummmm... no.

Pattern matching help

Hi!
I'm new to pattern matching and need a little code to get me started. I currently have it where the user enters a name and it compares that name to a string pulled from a file using String.indexOf(). If it does not match, it pulls the next name string from the file and trys again until it finds a match or reaches the end of the file.
For example, if I enter "hn smith" it will match to "john smith" in the string pulled from the file.
This works ok, but it would be a lot nicer if the user could enter in
jo.n smith or jo* smith
where it can match parts of the phrase instead of the exact phrase. I have done a slight bit of this in perl, but I am having a harder time in java.
I would appreciate any help. Thank you!

that's good when you know it, but when you are
starting out it is nice to have an example to work
with, one that is explained well, unlike many of the
sites I have visited.http://java.sun.com/docs/books/tutorial/extra/regex/index.html
The very first result from Google is a tutorial that explains regular expressions.

RegEx, need help with pattern matching

im going thru a list of Strings...and id like to match some input to it..but the tutorial for regex wont let me find a smaller string within a bigger one if it exists
for example i have a String "java.sun.com" and i want to find "sun" or "java" or "com" or "jav" or ".co"
i think the only way regex will work is if i group the entire thing into
any ideas on how i can manipulate the string into a proper regex pattern so that itll find any of those "searches"
thanks

No, that is not correct. A regex can be constructed to return a match on anything you want. A single character, a newline character, a numeric character and any combination of them. There are limitless possibilities for pattern matching.
See here:
http://java.sun.com/j2se/1.4.1/docs/api/java/util/regex/Pattern.html
Any of the patterns may be compiled into a regex for searching using the matcher.
An alternative is to use the indexOf method of the string class to find what you are looking for.
Example:
String myString = "java.sun.com";
String matchThis = "n.co";
int patternFoundAtThisIndexPosition = myString.indexof(matchThis);patternFoundAtThisIndexPosition will be 7;
or simply:
int index = myString.indexof("sun");index will be 5;

New language feature: lazy local pattern matching

In the upcoming release of the Open Quark Framework, CAL gets a new language feature: lazy local pattern matching. The new local pattern match syntax allows one to bind one or more variables to the fields of a data constructor or a record in a single declaration inside a let block. For example: // data constructor patterns: public foo1 = let Prelude.Cons a b = ["foo"]; in a; public foo2 = let Prelude.Cons {head=a, tail=b} = ["foo"]; in a; // list cons patterns: public foo3 = let a:b = [3]; in a; // tuple patterns: public foo4 = let (a, b, c) = (b, c, 1 :: Prelude.Int); in abc; // record patterns: public foo5 = let = {a = "foo"}; in a; // non-polymorphic record pattern public foo6 = let {_ | a} = {a = "foo", b = "bar"}; in a; // polymorhpic record pattern Whereas a case expression such as (case expr of a:b -> ...) forces the evaluation of expr to weak-head normal form (WHNF), a similar pattern match declaration (let a:b = expr; in ...) does not force the evaluation of expr until one of a or b is evaluated. In this sense, we can regard this as a form of lazy pattern matching. Thus, let a:b = []; in 3.0; is okay and would not cause a pattern match failure, but the case expression case [] of a:b -> 3.0; would cause a pattern match failure. This laziness is useful in situations where unpacking via a case expression may result in an infinite loop. For example, the original definition of List.unzip3 looks like this: // Original implementation of List.unzip3 unzip3 :: [(a, b, c)] -> ([a], , [c]); public unzip3 !list = case list of [] -> ([], [], []); x : xs -> let ys = unzip3 xs; in case x of (x1, x2, x3) -> //do not do a "case" on the ys, since this makes unzip3 strictly evaluate the list! (x1 : field1 ys, x2 : field2 ys, x3 : field3 ys); ; ; The use of the accessor functions field1, field2 and field3 here is necessary, as the alternate implementation shown below would result in "unzip3 xs" to be evaluated to WHNF during the evaluation of "unzip3 (x:xs)". Thus if the input list is infinite, the function would never terminate. // Alternate (defective) implementation of List.unzip3 unzip3 :: [(a, b, c)] -> ([a], , [c]); public unzip3 !list = case list of [] -> ([], [], []); x : xs -> let ys = unzip3 xs; in case x of (x1, x2, x3) -> case ys of // the use of "case" here is inappropriate, as it causes "unzip3 xs" to be evaluated to WHNF (y1, y2, y3) -> (x1 : y1, x2 : y2, x3 : y3); ; ; ; With the new syntax, the original implementation can be expressed more nicely without changing its semantics: // New implementation of List.unzip3, revised to use the local pattern match syntax unzip3 :: [(a, b, c)] -> ([a], , [c]); public unzip3 !list = case list of [] -> ([], [], []); x : xs -> let (y1, y2, y3) = unzip3 xs; // using a tuple pattern to perform a lazy local pattern match in case x of (x1, x2, x3) -> (x1 : y1, x2 : y2, x3 : y3); ; ; It is important to note that in places where a case expression can be used (without having an unwanted change in the laziness of the expression being unpacked), it should be used instead of this local pattern match syntax. Things to note about the new syntax: - local type declarations on the pattern-bound variables are allowed, and these type declarations can have associated CALDoc comments. On the other hand, the actual local pattern match declaration itself cannot have a type declaration nor a CALDoc comment. - this syntax cannot be used for top-level definitions, only local definitions in let blocks - one cannot use patterns with multiple data constructors, e.g. let (Left|Right) = ...; is not allowed - one cannot specify a variable for the base record pattern, e.g. let {r | a, b} = ...; is not allowed, but this is okay: let {_ | a, b} = ...; - patterns without no variables are disallowed, e.g. let _ = ...; let [] = ...; let () = ...; let : = ...; let {_|#1} = ...; 

If you use just / it misinterprets it and it ruins
your " " tags for a string. I don't think so. '/' is not a special character for Java regex, nor for Java String.
The reason i used
literal is to try to force it to directly match,
originally i thought that was the reason it wasn't
working.That will be no problem because it enforces '.' to be treated as a dot, not as a regex 'any character'.
Message was edited by:
hiwa

File events: exclusive pattern match

Is there a way for a file monitor to do an inverse match ie "all files except those with <pattern> in the name" ?
For example the file mask could be !<pattern> like with some of the common unix utilities.
If not perhaps it might make a useful feature enhancement.
Cheers

Upgrade to 1.4.2 and then this will work.
import java.util.regex.*;
class Test
 public static void main(String[] args)
 for(int i = 0; i<args.length;i++)
 System.out.println(args[i]+" "+Pattern.matches("\\d\\d\\d\\-\\d\\d\\d\\d", args));
 System.exit(0);
Otherwise convert the string to a char[] and test that you have 8 characters, ch[3] is '-' and the rest are between '0' and '9'.
tokenizing the string on '-' and trying to make integers will allow some invalid phone number to pass. You will have to at least confirm that the numbers aren't negative and have the right number of digits.

Getting Log File Pattern Matched Line Count metric to work ?

Hi
has anyone been able to get this to work with more complex Perl expressions ?
Basically I can get simple, single expressions to match.
EG *(does not exist)* will match the text *"does not exist"* anywhere in a file.
However, if I want to match either does not exist OR file not found I should be able to do something like
*(does not exist)|(file not found)* OR *(does not exist|file not found)* but this just doesn't work.
I want to be able to do more complex expressions, using *\i* (ignore case), and *^* (start of line) *$* (end of line) expressions too.
I can test the matching functionality using a simple perl program, and I know the expression works in Perl.
Oracle is supposed to be using a perl pattern match but seems to fail unless it is a single simple expression.
Anyone been able to use this functionality at all.
Many thanks.

I have a chance to look into the parse-log1.pl script which is responsible for monitoring the log files and generating the alerts for EMGC. I am just pasting the comments given in this file
# This script is used in EMD to parse log files for critical and
# warning patterns. The script holds the last line number searched
# for each file in a state file for each time the script is run. The
# next run of the script starts from the next line. The state file name
# is read from the environment variable $EM_STATE_FILE, which must
# be set for the script to run.
but in my case this is not happending according to log files it is storing the lst read line of the log file but it is not using that info in its next run. The file will be scanned from the begining again but this is not the case with emagent.log file monitoring its working fine as expected and explained in the script file.
According to my observation this is becasue of the script is rotating my log file for each run i dont know how stop it. I just want to scan my log file I dont want to rotate my log file for each run of the script. Could any one please help me to solve this problem
Thanks
Ashok Chava.

Java pattern matching - perl like

Similar Messages

Maybe you are looking for