Examples of org.apache.regexp.RE

org.apache.regexp.RE

ile expression boolean matched = r.match("xaaaab"); // Match against "xaaaab"
String wholeExpr = r.getParen(0); // wholeExpr will be 'aaaab' String insideParens = r.getParen(1); // insideParens will be 'aaaa'
int startWholeExpr = getParenStart(0); // startWholeExpr will be index 1 int endWholeExpr = getParenEnd(0); // endWholeExpr will be index 6 int lenWholeExpr = getParenLength(0); // lenWholeExpr will be 5
int startInside = getParenStart(1); // startInside will be index 1 int endInside = getParenEnd(1); // endInside will be index 5 int lenInside = getParenLength(1); // lenInside will be 4 You can also refer to the contents of a parenthesized expression within a regular expression itself. This is called a 'backreference'. The first backreference in a regular expression is denoted by \1, the second by \2 and so on. So the expression:

 ([0-9]+)=\1

will match any string of the form n=n (like 0=0 or 2=2).

The full regular expression syntax accepted by RE is described here:

 
 Characters 
 unicodeChar          Matches any identical unicode character \                    Used to quote a meta-character (like '*') \\                   Matches a single '\' character \0nnn                Matches a given octal character \xhh                 Matches a given 8-bit hexadecimal character \\uhhhh               Matches a given 16-bit hexadecimal character \t                   Matches an ASCII tab character \n                   Matches an ASCII newline character \r                   Matches an ASCII return character \f                   Matches an ASCII form feed character 
 Character Classes 
 [abc]                Simple character class [a-zA-Z]             Character class with ranges [^abc]               Negated character class 
 Standard POSIX Character Classes 
 [:alnum:]            Alphanumeric characters.  [:alpha:]            Alphabetic characters.  [:blank:]            Space and tab characters.  [:cntrl:]            Control characters.  [:digit:]            Numeric characters.  [:graph:]            Characters that are printable and are also visible. (A space is printable, but not visible, while an `a' is both.)  [:lower:]            Lower-case alphabetic characters.  [:print:]            Printable characters (characters that are not control characters.)  [:punct:]            Punctuation characters (characters that are not letter, digits, control characters, or space characters).  [:space:]            Space characters (such as space, tab, and formfeed, to name a few).  [:upper:]            Upper-case alphabetic characters.  [:xdigit:]           Characters that are hexadecimal digits. 
 Non-standard POSIX-style Character Classes 
 [:javastart:]        Start of a Java identifier [:javapart:]         Part of a Java identifier 
 Predefined Classes 
 .                    Matches any character other than newline \w                   Matches a "word" character (alphanumeric plus "_") \W                   Matches a non-word character \s                   Matches a whitespace character \S                   Matches a non-whitespace character \d                   Matches a digit character \D                   Matches a non-digit character 
 Boundary Matchers 
 ^                    Matches only at the beginning of a line $                    Matches only at the end of a line \b                   Matches only at a word boundary \B                   Matches only at a non-word boundary 
 Greedy Closures 
 A*                   Matches A 0 or more times (greedy) A+                   Matches A 1 or more times (greedy) A?                   Matches A 1 or 0 times (greedy) A{n}                 Matches A exactly n times (greedy) A{n,}                Matches A at least n times (greedy) A{n,m}               Matches A at least n but not more than m times (greedy) 
 Reluctant Closures 
 A*?                  Matches A 0 or more times (reluctant) A+?                  Matches A 1 or more times (reluctant) A??                  Matches A 0 or 1 times (reluctant) 
 Logical Operators 
 AB                   Matches A followed by B A|B                  Matches either A or B (A)                  Used for subexpression grouping 
 Backreferences 
 \1                   Backreference to 1st parenthesized subexpression \2                   Backreference to 2nd parenthesized subexpression \3                   Backreference to 3rd parenthesized subexpression \4                   Backreference to 4th parenthesized subexpression \5                   Backreference to 5th parenthesized subexpression \6                   Backreference to 6th parenthesized subexpression \7                   Backreference to 7th parenthesized subexpression \8                   Backreference to 8th parenthesized subexpression \9                   Backreference to 9th parenthesized subexpression

All closure operators (+, *, ?, {m,n}) are greedy by default, meaning that they match as many elements of the string as possible without causing the overall match to fail. If you want a closure to be reluctant (non-greedy), you can simply follow it with a '?'. A reluctant closure will match as few elements of the string as possible when finding matches. {m,n} closures don't currently support reluctancy.

RE runs programs compiled by the RECompiler class. But the RE matcher class does not include the actual regular expression compiler for reasons of efficiency. In fact, if you want to pre-compile one or more regular expressions, the 'recompile' class can be invoked from the command line to produce compiled output like this:

 // Pre-compiled regular expression "a*b" char[] re1Instructions = { 0x007c, 0x0000, 0x001a, 0x007c, 0x0000, 0x000d, 0x0041, 0x0001, 0x0004, 0x0061, 0x007c, 0x0000, 0x0003, 0x0047, 0x0000, 0xfff6, 0x007c, 0x0000, 0x0003, 0x004e, 0x0000, 0x0003, 0x0041, 0x0001, 0x0004, 0x0062, 0x0045, 0x0000, 0x0000, }; 
 REProgram re1 = new REProgram(re1Instructions);

You can then construct a regular expression matcher (RE) object from the pre-compiled expression re1 and thus avoid the overhead of compiling the expression at runtime. If you require more dynamic regular expressions, you can construct a single RECompiler object and re-use it to compile each expression. Similarly, you can change the program run by a given matcher object at any time. However, RE and RECompiler are not threadsafe (for efficiency reasons, and because requiring thread safety in this class is deemed to be a rare requirement), so you will need to construct a separate compiler or matcher object for each thread (unless you do thread synchronization yourself).

ISSUES:

com.weusours.util.re is not currently compatible with all standard POSIX regcomp flags

com.weusours.util.re does not support POSIX equivalence classes ([=foo=] syntax) (I18N/locale issue)

com.weusours.util.re does not support nested POSIX character classes (definitely should, but not completely trivial)

com.weusours.util.re Does not support POSIX character collation concepts ([.foo.] syntax) (I18N/locale issue)

Should there be different matching styles (simple, POSIX, Perl etc?)

Should RE support character iterators (for backwards RE matching!)?

Should RE support reluctant {m,n} closures (does anyone care)?

Not *all* possibilities are considered for greediness when backreferences are involved (as POSIX suggests should be the case). The POSIX RE "(ac*)c*d[ac]*\1", when matched against "acdacaa" should yield a match of acdacaa where \1 is "a". This is not the case in this RE package, and actually Perl doesn't go to this extent either! Until someone actually complains about this, I'm not sure it's worth "fixing". If it ever is fixed, test #137 in RETest.txt should be updated.

@see recompile @see RECompiler @author Jonathan Locke @version $Id: RE.java,v 1.1 2000/04/27 01:22:33 jon Exp $

   */
  public static String parseNum(String src) {
    String result = null;
    final String rule = "[0-9��һ�����������߰˾�ʮҼ��������½��ƾ�ʰ]+";
    if (src != null) {
      RE re = new RE(rule);
      if (re.match(src)) {
        result = re.getParen(0);
      }
    }
    return result;
  }

View Full Code Here

   *         <code>mask</code>.
   */
  public static boolean isLike(String string, String mask, boolean ignoreCase) {
    try {
      // ? --> .
      RE re = new RE("\\?");
      String a = re.subst(mask, ".");
      // * --> .*
      re = new RE("\\*");
      String b = re.subst(a, ".*");
      // % --> .*
      re = new RE("\\%");
      String c = re.subst(b, ".*");
      // end with $ if started with .*
      if (c.startsWith(".*")) {
        c = c + "$";
      }
      // start with ^ if ended with .*
      if (c.endsWith(".*")) {
        c = "^" + c;
      }
      // choose level according to case insensitivity
      re = new RE(c, ignoreCase ? RE.MATCH_CASEINDEPENDENT
          : RE.MATCH_NORMAL);
      // return the matching result of regular expression
      return re.match(string);
    } catch (RESyntaxException e) {
      throw new IllegalArgumentException(e.getMessage());
    }
  }

View Full Code Here

  private String removeQuotes(String s)
  {
    if (s == null)
      return null;


    if (new RE("^\".+\"$").match(s) || new RE("^'.+'$").match(s)
        || new RE("^\\{.+\\}$").match(s)
        || new RE("^\\(.+\\)$").match(s) || new RE("^<.+>$").match(s)
        || new RE("^\\[.+\\]$").match(s))
    {
      s = s.substring(1, s.length() - 1);
    }


    return s;

View Full Code Here


      for (int i = 0; i < DISC_REGEXS.length; i++)
      {
        String kDISC_REGEX = DISC_REGEXS[i];


        RE re = new RE(kDISC_REGEX);
        if (re.match(s.toLowerCase()))
        {


          if (re.getParenCount() < 2)
          {
            Debug.debug("Disc missing number", s);
            Debug.dumpStack(3);
            continue;
          }
          int start = re.getParenStart(0);
          int end = re.getParenEnd(0);
          String value = re.getParen(1);
          // Debug.debug("value", value);
          Number number = parseNumber(value);
          if (number == null)
          {
            Debug.debug("Disc missing value", value);

View Full Code Here

    s = TextUtils.replace(s, " .", " ");
    s = TextUtils.replace(s, "  ", " ");


    // Debug.debug("rectifyGeneric_1 b", s);


    if (new RE("^\\?+$").match(s))
    {
      // Debug.debug("discarding question...", s);
      return null;
    }

View Full Code Here

  private String removeTrackNumbers(String s, IMusicMetadata flags)
  {
    if (s == null)
      return null;


    if (new RE("^(audio)? ?track ?[- ]?[0-9][0-9]?$")
        .match(s.toLowerCase()))
    {
      if (s.toLowerCase().startsWith("audio"))
        s = s.substring(5).trim();
      parseTrackNumber(s.substring(5), flags);
      // Debug.debug("discarding track...", s);
      return null;
    }
    if (new RE("^piste ?[- ]?[0-9][0-9]?$").match(s.toLowerCase()))
    {
      parseTrackNumber(s.substring(5), flags);
      // Debug.debug("discarding track...", s);
      return null;
    }


    // Debug.debug("removeTrackNumbers 1", s);


    if (new RE("^[0-9][0-9] - ").match(s)
        || new RE("^[0-9][0-9][0-9] - ").match(s)
        || new RE("^[aAbBcCdD][0-9] - ").match(s))
    {
      // Debug.debug("attempting to strip track number...", s);
      int index = s.indexOf('-');
      if (index >= 0)
      {
        String after = s.substring(index + 1).trim();
        // Debug.debug("\t" + "after", after);
        if (after.indexOf('-') < 0) // if mutiple -'s then ignore...
        {
          parseTrackNumber(s.substring(0, index), flags);
          s = after;
        }
      }
    }


    if (new RE("^\\([0-9][0-9]\\) ").match(s)
        || new RE("^\\([abcdABCD][0-9]\\) ").match(s))
    {
      // Debug.debug("attempting to strip track number...", s);
      int index = s.indexOf(')');
      if (index >= 0)
      {

View Full Code Here

    // Debug.debug("removeYearPrefixSuffix before", s);


    if (s == null)
      return null;


    if (new RE("^\\(199[0-9]\\)").match(s)
        || new RE("^\\(200[0-9]\\)").match(s))
      s = s.substring(7);


    if (new RE("^\\( 199[0-9] \\)").match(s)
        || new RE("^\\( 200[0-9] \\)").match(s))
      s = s.substring(9);


    if (new RE("\\(199[0-9]\\)$").match(s)
        || new RE("\\(200[0-9]\\)$").match(s))
      s = s.substring(0, s.length() - 7);


    if (new RE("\\( 199[0-9] \\)$").match(s)
        || new RE("\\( 200[0-9] \\)$").match(s))
      s = s.substring(0, s.length() - 9);


    if (new RE("199[0-9] - ").match(s) || new RE("200[0-9] - ").match(s))
    {
      int index = s.indexOf('-');
      if (index >= 0)
      {
        String temp = s.substring(index + 1);
        if (temp.indexOf('-') < 0)
          s = temp;
      }
    }


    if (new RE("- 199[0-9]").match(s) || new RE(" - 200[0-9]").match(s))
    {
      int index = s.lastIndexOf('-');
      if (index >= 0)
      {
        String temp = s.substring(0, index);

View Full Code Here

  {
    if (s == null)
      return null;


    {
      if (new RE("^http://").match(s.toLowerCase()))
        return null;
      // if (new RE("^[hH][tT][tT][pP]://").match(s))
      // return null;
    }


    {
      String temp = s;
      temp = TextUtils.replace(temp, ". ", ".");


      // Debug.debug("s1", s);
      RE re = new RE("^[\\w \\-]*\\.[\\w \\.\\-]*\\.(com|net|org|edu)$");
      // re.setMatchFlags(RE.MATCH_CASEINDEPENDENT);
      if (re.match(temp.toLowerCase()))
        return null;


      // Debug.debug("s2", s);


      // if (new RE(

View Full Code Here

      Vector featured_artists, String pattern)
  {
    if (s == null)
      return null;


    RE re = new RE(pattern);
    if (re.match(s.toLowerCase()))
    {
      // Debug.debug("\t" + "featuring match(" + pattern + ")", s);
      // String wholeExpr = re.getParen(0);
      // Debug.debug("\t" + "wholeExpr", wholeExpr);
      // String insideParens = re.getParen(1);
      // Debug.debug("\t" + "insideParens", insideParens);


      int startInside = re.getParenStart(1);
      // Debug.debug("\t" + "startInside", startInside);
      int endInside = re.getParenEnd(1);
      // Debug.debug("\t" + "endInside", endInside);


      String left = s.substring(0, startInside);
      // Debug.debug("\t" + "left", left);
      String right = s.substring(startInside, endInside);
      // Debug.debug("\t" + "right", right);
      // int pattern_length = TextUtils.replace(pattern. "\\", "\");


      int index = Integer.MAX_VALUE;
      right = right.trim();


      {
        int i = right.indexOf('.');
        if (i >= 0)
          index = Math.min(index, i);
      }
      {
        int i = right.indexOf(' ');
        if (i >= 0)
          index = Math.min(index, i);
      }
      if (index < 0)
      {
        Debug.debug("\t" + "couldn't use match(" + pattern + ")", s);
        return s;
      }
      right = right.substring(index + 1);
      if (right.endsWith(")"))
        right = right.substring(0, right.length() - 1);
      if (left.endsWith("("))
        left = left.substring(0, left.length() - 1);
      right = right.trim();


      RE re2 = new RE("(.*)(,.*)*\\&(.*)");
      if (re2.match(right))
      {
        Vector v = listToNames(re2);
        featured_artists.removeAll(v);
        featured_artists.addAll(v);
      } else
      {
        re2 = new RE("(.*)(,.*)*\\ And (.*)");
        if (re2.match(right))
        {
          Vector v = listToNames(re2);
          featured_artists.removeAll(v);
          featured_artists.addAll(v);
        } else

View Full Code Here

    try
    {
      // Debug.debug("\t"+"s", s);
      // Debug.debug("\t"+"pattern", pattern);


      RE re = REGEX_CACHE.getRegEx(pattern);
      // RE re = new RE(pattern.toLowerCase());
      // Debug.debug("prefix", prefix_pattern);
      if (!re.match(s.toLowerCase()))
        return s;
      // String match = re.getParen(0);
      // Debug.debug("match(" + pattern + ")", s);
      s = s.substring(0, re.getParenStart(0))
          + s.substring(re.getParenEnd(0));
      // Debug.debug("updating...new_name ", new_name);
      return s;
    } catch (Exception e)
    {
      Debug.debug("s", s);

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.apache.regexp.RE

ch.ethz.prose.filter.NameExpression

com.gftech.util.GFString

com.volantis.mcs.eclipse.ab.core.DeviceRepositoryAccessorManagerTestCase

com.volantis.mcs.servlet.CachingXDIMERequestProcessor

net.sf.regain.crawler.config.XmlCrawlerConfig

net.sf.regain.crawler.Crawler

net.sf.regain.crawler.document.AbstractPreparator

net.sf.regain.crawler.document.DocumentFactory

org.apache.catalina.valves.RequestFilterValve

org.apache.cocoon.acting.AbstractValidatorAction

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.