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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 12, 20262026-06-12T01:13:03+00:00 2026-06-12T01:13:03+00:00

I am trying to make an algorithm for regex that finds uncalculated calculations such

  • 0

I am trying to make an algorithm for regex that finds uncalculated calculations such as ’15+15′, however; it should not match ’15+15=30′

So far I have made it work to find calculations such as 15+15, however; it also matches 15+15=30

What I have got so far is

\d{1,9}\+\d{1,9}

I tried with

\d{1,9}\+\d{1,9}[^=]

But it didn’t really work as I expected.

I am using the .net ‘Regex’ class

  • 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-12T01:13:04+00:00Added an answer on June 12, 2026 at 1:13 am

    What you need is a negative lookahead:

    (\d{1,9}\+\d{1,9})\b(?!=)
    

    This asserts that the pattern is not followed by =. The \b is a word boundary that makes sure that you don’t match 15+1 in 15+15=30 (because 5 is not =).

    The reason why your attempt with the negated character class doesn’t work is that it needs a non-= character after the match.

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

Sidebar

Related Questions

I am trying to make algorithm that takes two arrays, S and T of
I'm trying to make an algorithm in python that asks you to insert a
I am trying to make an algorithm for the following task: I have two
Okay, so I'm trying to make a game that uses this algorithm: http://www.codeproject.com/Articles/15573/2D-Polygon-Collision-Detection But
I'm trying to make an algorithm that calculates what keys can be pressed in
I have a bit counting method that I am trying to make as fast
I'm trying to make an algorithm that will find the most efficient ordering for
I'm trying to make a function in VB.net that will loop through an algorithm.
I am trying to make equivalence tests on an algorithm written in C++ and
I'm trying make an entity with doctrine that has three associations with other entities

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.