RWCRegexp (deprecated)

Module:  Essential Tools Module   Group:  String Processing Classes

Does not inherit

• Local Index
• Synopsis
• Deprecation Notice
• Description
• Persistence
• Example
• Public Constructors
• Public Destructor
• Assignment Operators
• Public Member Functions

Members

index() operator=()

RWCRegexp() status()

~RWCRegexp()

#include <rw/regexp.h>
RWCRegexp re(".*\\.doc");// Matches filename with suffix ".doc"

This alternative interface is now deprecated and may be eliminated from a later release. For more information on the support of deprecated classes, please contact your Rogue Wave account representative.

Use the RWTRegex<T> interface instead of this class. RWTRegex<T> provides enhanced functionality and increased performance.

---

NOTE -- If you need backreferencing, you must continue to use this class. Backreferencing is not provided in RWTRegex<T>.

---

Class RWCRegexp represents a regular expression. The constructor "compiles" the expression into a form that can be used more efficiently. The results can then be used for string searches using class RWCString.

The regular expression (RE) is constructed as follows:

The following rules determine one-character REs that match a single character:

1. Any character that is not a special character (to be defined) matches itself.

2. A backslash (\) followed by any special character matches the literal character itself. I.e., this "escapes" the special character.

---

NOTE -- There is one exception to this rule. \^char is interpreted as a control character: thus \^R is control-R. To match the circumflex ^ itself, use \x5e in ASCII environments.

---

3. The "special characters" are:

   +     *     ?     .     [     ]     ^     $ 

4. The period (.) matches any character except the newline. For example, ".umpty" matches either "Humpty" or "Dumpty."

5. A set of characters enclosed in brackets ([]) is a one-character RE that matches any of the characters in that set. Example: "[akm]" matches either an "a", "k", or "m". A range of characters can be indicated with a dash. Example: "[a-z]" matches any lower-case letter. However, if the first character of the set is the caret (^), then the RE matches any character except those in the set. It does not match the empty string. Example: [^akm] matches any character except "a", "k", or "m". The caret loses its special meaning if it is not the first character of the set.

The following rules can be used to build a multicharacter RE.

1. A one-character RE followed by an asterisk (*) matches zero or more occurrences of the RE. Hence, [a-z]* matches zero or more lower-case characters.

2. A one-character RE followed by a plus (+) matches one or more occurrences of the RE. Hence, [a-z]+ matches one or more lower-case characters.

3. A question mark (?) is an optional element. The preceding RE can occur zero or once in the string -- no more. For example, xy?z matches either xyz or xz.

4. The concatenation of REs is a RE that matches the corresponding concatenation of strings. For example, [A-Z][a-z]* matches any capitalized word.

Finally, the entire regular expression can be anchored to match only the beginning or end of a line:

1. If the caret (^) is at the beginning of the RE, then the matched string must be at the beginning of a line.

2. If the dollar sign ($) is at the end of the RE, then the matched string must be at the end of the line.

The following escape codes can be used to match control characters:

The most frequent problem with use of this class is in being able to specify a backslash character to be parsed. If you are attempting to parse a regular expression that contains backslashes, you must be aware that the C++ compiler and the regular expression constructor will both assume that any backslashes they see are intended to escape the following character. Thus, to specify a regular expression that exactly matches "a\a", you would have to create the regular expression using four backslashes as follows: the regular expression needs to see "a\\a", and for that to happen, the compiler would have to see "a\\\\a".

     RWCRegexp reg("a\\\\a");
                     ^|^|
                      1 2

The backslashes marked with a ^ are an escape for the compiler, and the ones marked with | will thus be seen by the regular expression parser. At that point, the backslash marked 1 is an escape, and the one marked 2 will actually be put into the regular expression.

Similarly, if you really need to escape a character, such as a ".", you will have to pass two backslashes to the compiler:

    RWCRegexp regDot("\\.")
                      ^|

Once again, the backslash marked ^ is an escape for the compiler, and the one marked with | will be seen by the regular expression constructor as an escape for the following ".".

None

#include <iostream>

#include <rw/regexp.h>
#include <rw/cstring.h>

int main ()
{
    RWCString s("Hark! Hark! the lark");

    std::cout << "Searching for expressions beginning with \"l\" in \"" 
              << s << "\".\n";

    // A regular expression matching any lower-case word
    // starting with 'l':
    RWCRegexp reg("l[a-z]*");
    std::cout << "Found \"" << s(reg) << "\"." << std::endl;

    return 0;
}

Program output:

Searching for expressions beginning with "l" in "Hark! Hark! the lark".
Found "lark".

RWCRegexp(const char* pat);

Construct a regular expression from the pattern given by pat. The status of the results can be found by using member function status().

RWCRegexp(const RWCRegexp& r);

Copy constructor. Uses value semantics -- self will be a copy of r.

~RWCRegexp();

Destructor. Releases any allocated memory.

RWCRegexp&
operator=(const RWCRegexp&);

Uses value semantics -- sets self to a copy of r.

RWCRegexp&
operator=(const char* pat);

Recompiles self to the pattern given by pat. The status of the results can be found by using member function status().

size_t
index(const RWCString& str,size_t* len, size_t start=0)
      const;

Returns the index of the first instance in the string str that matches the regular expression compiled in self, or RW_NPOS if there is no such match. The search starts at index start. The length of the matching pattern is returned in the variable pointed to by len. If an invalid regular expression is used for the search, an exception of type RWInternalErr will be thrown. Note that this member function is relatively clumsy to use -- class RWCString offers a better interface to regular expression searches.

statVal
status();

Returns the status of the regular expression and resets status to OK:

Table 14: RWCRegexp statVal Values

statVal	Meaning
RWCRegexp::OK	No errors
RWCRegexp::ILLEGAL	Pattern was illegal
RWCRegexp::TOOLONG	Pattern exceeded maximum length. (To change the amount of space allocated for a pattern, edit regexp.cpp to change the value of RWCRegexp::maxval_, then recompile and insert the changed object into the appropriate library.)

© Copyright Rogue Wave Software, Inc. All Rights Reserved.
Rogue Wave and SourcePro are registered trademarks of Rogue Wave Software, Inc. in the United States and other countries. All other trademarks are the property of their respective owners.
Contact Rogue Wave about documentation or support issues.