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

  • SEARCH
  • Home
  • 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 7715203
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 1, 20262026-06-01T02:19:34+00:00 2026-06-01T02:19:34+00:00

I am wondering if there is a way to check a subpattern match for

  • 0

I am wondering if there is a way to check a subpattern match for a given sequence so I can block it.

For example, lets say that I wanted to capture everything except a repeat of an earlier capture. So if I had the sentence [word plus word] the following should capture everything (word plus) up to the second occurrence of word.

(\w+)[^\1]+

The first (\w+) captures word. The second [^...] capture group tries to exclude it (it being the \1 captured earlier), but it only works on characters – not subpattern captures.

So is there anyway to do 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-06-01T02:19:35+00:00Added an answer on June 1, 2026 at 2:19 am

    You can use patterns like this:

    (\w+)(?:(?!\1).)*
    

    Which uses a negative lookahead to assert (at every character) that the previously matched word is not contained in the subexpression.

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

Sidebar

Related Questions

I'm wondering if there is a way to check wether a variable that has
I'm wondering if there is a proper way to check the dependencies. For example
I was wondering whether there is a way to check when the database was
I'm wondering if there's a better way to check out the initial version of
I'm wondering if there is a way for a SWF to check at runtime
I was wondering is there a way in PHP that you could tell where
I am wondering is there any way we can test the font size/color of
Wondering if there is any way to get the lambda expressions that result from
HI i was wondering if there is a way to check what is the
I was wondering if there is any way to check if an object is

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.