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 6561791
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 25, 20262026-05-25T13:37:51+00:00 2026-05-25T13:37:51+00:00

I am aware that the regex engine moves significantly faster without having to keep

  • 0

I am aware that the regex engine moves significantly faster without having to keep track of backreferences. I am also aware that I can add a ?: at the start of the inside of the brackets to prevent the regex engine from performing a backreference.

However is there anyway I can invert the behavior such that non-matching becomes the default behavior ?(rather like the U flag)

  • 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-25T13:37:52+00:00Added an answer on May 25, 2026 at 1:37 pm

    Short answer: no.

    PHP uses the PCRE library for parsing regular expressions.

    PCRE uses an NFA-based parser which keeps track of backreferences. What you are describing is a DFA-based parser or a Thompson NFA.

    I’m not a PHP developer, but the PCRE library does indeed come with a “DFA mode.” Most Linux distros will come equipped with “pcretest.” If you don’t have it, it comes with the PCRE library.

    In the CLI:

    $ pcretest
      re> /(foo)\1/
    data> foofoo
      0: foofoo
      1: foo
    

    Now if we run this with the “-dfa” flag:

    $ pcretest -dfa
      re> /(foo)\1/
    data> foofoo
    Error -16
    

    You may also want to look into “possessive quantifiers” to prevent backtracking.

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

Sidebar

Related Questions

I am aware that regEx are common across languages...But I am having trouble in
I aware that this will be a less programming question, but still... How can
I'm fully aware that set division can be accomplished through a series of other
I am aware that you can lock an object in c# using lock but
I'm aware that in Vim I can often repeat a command by simply adding
I'm aware that in WPF you want to keep the sizes of controls as
I am aware that I can Google HTML Form Validation and would get a
I am increasingly aware that my code in any single file can often span
I am aware that regex is not ideal for use with HTML strings and
Is there such a thing that finds numbers using regex and can perform simple

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.