Home > Articles > Programming > C/C++

  • Print
  • + Share This
Like this article? We recommend

Like this article? We recommend

Replacing Text: Some Simple Examples

Replacing Text: Some Simple Examples

As I hinted earlier, groups have an important role in text replacement. To search-and-replace, you'll need to specify a replacement pattern string. Each character in this string is interpreted literally, with one exception: the dollar sign ($) has a special meaning. To use this syntax, the dollar sign is followed by a number:


This says, "Replace me with the nth group that was tagged (recognized) in the search string." (I'll explain tagging in a moment.) At this point, the natural question comes up, "What if I want to specify a literal dollar sign?" As you might guess by now, you'll use two dollar signs:


Let's look at a simple example. Bear in mind that the following items are involved:

  • Regular expression. Specifies the character(s) you want the search to find.
  • Replacement pattern string. Specifies how the searched string will be translated into new text.
  • Target string. The string to be "operated on"—that is, the input string.
  • Output string. The characters output by the C++ regular expression library.

Assume that we want to replace all double occurrences of a word with a single occurrence of that word. The following regular expression specifies the double-word pattern:

([a-zA-Z]+) \1

The expression [a-zA-Z]+ specifies a word. The range [a-zA-Z] accepts any lowercase or uppercase letter. The repeat operator (+) matches as many consecutive characters in this range as it can; that is, it matches as many letters in a row as it can. Matching stops when some non-alphabetic character is read, such as a space, or when the end of the target string is read.

The use of parentheses places [a-zA-Z]+ into a group, and something interesting happens: At runtime, a match group is tagged (remembered). The rest of the regular expression in our example says to match the first group again:


We need to make a critical distinction at this point: \1 means "Match group number 1 again." It doesn't produce the same result as this:

([a-zA-Z]+) ([a-zA-Z]+)

This would mean, "Match any word, match a space, and then match any word again." It would match input text such as the following:

cat dog

But that's not what we want. Instead, we want a word to be matched and then remembered, and then we want the program to attempt to match that same word again. That's what tagging does.

Consider the following target string:

The cat cat bites the dog dog.

Assume that the following regular expression is applied:

([a-zA-Z]+) \1

Using functions and datatypes I'll demonstrate in the next section, the program tries to match a word, which is a pattern of text matching [a-zA-Z]+. The first word in the example sentence, The, matches the pattern. Because the expression is in parentheses, it forms a group. So, at runtime, that found text is tagged.

The next sub-expression means "Match the text that was tagged in the first group":


Notice the use of the backslash, the escape character: This character takes away special meaning from characters such as these: * + ( ) and so on. However, the use of the backslash in this example is an exception to the general rule. In this case, the backslash adds special meaning rather than taking it away. The digit 1 by itself would mean "Match the digit 1." But in this case it means "Match the tagged text." Therefore, in this example, the next thing the search function will do is attempt to match a space followed by another occurrence of the word The. In this case, it would fail.

But the function then matches the word cat, which is tagged (remembered). The match then succeeds, as the function immediately reads a second occurrence of cat.

What do we want to use to replace each group of repeated words? You can specify any text here. Look at the target string again:

The cat cat bites the dog dog.

You could replace each group of repeated words with the word ERROR, although that doesn't seem very useful:

The ERROR bites the ERROR.

Instead, let's replace each instance of repeated words with just one copy of the word. That's what the following replacement string does. The text matched at runtime was tagged, so it can be reused in the replacement pattern:


Given this replacement string, each repeated-word substring is replaced with just one copy of the contents of group 1 (which in this case is the only group). So after the search-and-replace, the final result is this:

The cat bites the dog.

For the sake of illustration, consider that each double-word substring could have been replaced with three copies of the contents of group 1 (that is, three copies of the word). In that case, the replacement text would be as follows:


With this result:

The cat cat cat bites the dog dog dog.

Replacement Using C++ Functions

Now let's look at search-and-replace carried out in C++ code. The first thing to note is that the backslash is used here in the search pattern; but when you code C++ strings, you must use two backslashes to indicate a single backslash.

The code requires several things:

  • Regular expression to use for searching
  • String with replacement pattern
  • Target string

Before we proceed to the C++ code, some preliminaries:

#include <regex>
#include <string>
using std::regex;
using std::string;
using std::regex_replace;

Here are the string and regex declarations:

regex re("([a-zA-Z]+) \\1");    // Find double word.
string replacement = "$1";      // Replace with one word.
string target = "The cat cat bites the dog dog.";

You may notice a seeming inconsistency. The search pattern is declared as a special regex object, while the replacement pattern is just a standard string. That's just the way it works. The search pattern for any regex function is always a regex object. This design causes the program to build a special binary object, optimized for use at runtime. The replacement pattern is not built into a binary object until the function is called at runtime.

Finally, the regex_replace function carries out the search-and-replace. The action is to search for every sub-expression that matches the regex pattern (re) and then replace each occurrence with the replacement pattern:

string output_str = regex_replace(target, re, replacement);

If this string is displayed, the contents are now as follows:

The cat bites the dog.

Another Search-and-Replace Example

The previous examples were simplistic, but you should be able to see how complex text translations can be built upon these basic tools. In particular, you can tag and reuse any number of groups.

Consider a slightly more advanced usage. We could search for each substring having this form:

word1 bites word2

and replace it with this:

word2 bites word1

In other words, we're reversing the order. The following declarations set up this operation:

#include <regex>
#include <string>
using std::regex;
using std::string;
using std::regex_replace;

regex re("([a-zA-Z]+) bites ([a-zA-Z]+)");
string replacement = "$2 bites $1";

Two groups are specified in the regular expression (re); therefore, the replacement string can legally refer to up to two groups. In this case, the order of the two words is switched, while the word "bites" is preserved as is. We could even have made "bites" a group, although nothing would be gained in this case. (It would involve some unnecessary extra operations at runtime, although the hit on efficiency would be small.) In that case, the same replacement could have been written this way:

regex re("([a-zA-Z]+) (bites) ([a-zA-Z]+)");
string replacement = "$3 $2 $1";

With these three groups, the first and third words are switched.

Either way, the code performing the search-and-replace operation looks something like this:

string replacement = "The cat bites dog, the dog bites flea."
string output_str = regex_replace(target, re, replacement);

If the output string is then displayed, the result is the following:

The dog bites cat, the flea bites dog.
  • + Share This
  • 🔖 Save To Your Account

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020