Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 941567
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T22:08:22+00:00 2026-05-15T22:08:22+00:00

Given a string of identifiers separated by : , is it possible to construct

  • 0

Given a string of identifiers separated by :, is it possible to construct a regular expression to extract the unique identifiers into another string, also separated by :?

How is it possible to achieve this using a regular expression? I have tried s/(:[^:])(.*)\1/$1$2/g with no luck, because the (.*) is greedy and skips to the last match of $1.

Example: a:b:c:d:c:c:x:c:c:e:e:f should give a:b:c:d:x:e:f

Note: I am coding in perl, but I would very much appreciate using a regex for this.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-15T22:08:23+00:00Added an answer on May 15, 2026 at 10:08 pm

    In .NET which supports infinite repetition inside lookbehind, you could search for

    (?<=\b\1:.*)\b(\w+):?
    

    and replace all matches with the empty string.

    Perl (at least Perl 5) only supports fixed-length lookbehinds, so you can try the following (using lookahead, with a subtly different result):

    \b(\w+):(?=.*\b\1:?)
    

    If you replace that with the empty string, all previous repetitions of a duplicate entry will be removed; the last one will remain. So instead of

    a:b:c:d:x:e:f
    

    you would get

    a:b:d:x:c:e:f
    

    If that is OK, you can use

    $subject =~ s/\b(\w+):(?=.*\b\1:?)//g;
    

    Explanation:

    First regex:

    (?<=\b\1:.*): Check if you can match the contents of backreference no. 1, followed by a colon, somewhere before in the string.

    \b(\w+):?: Match an identifier (from a word boundary to the next :), optionally followed by a colon.

    Second regex:

    \b(\w+):: Match an identifier and a colon.

    (?=.*\b\1:?): Then check whether you can match the same identifier, optionally followed by a colon, somewhere ahead in the string.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

what would be the regular expression to check if a given string contains atleast
What regular expression can I use (if any) to validate that a given string
Possible Duplicate: how to rotate the given string to left or right in C?
Algorithm to generate all possible letter combinations of given string down to 2 letters
Given i have the type: type NewsMessage(identifier:string, headline:string) and this record: type NewsMessageParams =
Given a string how to create a unique identifier / hash for that string
I'm trying to compress any given string to a shorter version, copy paste-able compressed
I'm in need to modify a given string to contain only alpha numerical characters,
I've been looking for a way to hash a given string in C# that
How do I create an array in smarty from a given string like 22||33||50

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.