On: Is there a regular expression to detect a valid regular expression?

[nightfly]

)))((()(()

[gerdesj → nightfly]

When I check brackets by hand or manually I do actually get my hands out and when I say open I uncurl a finger, and when I say close, I furl a finger. "Open, open, open, close, open, close, close, close". Provided I have no fingers on display at the end, then the brackets are balanced. They might not be in the right place but at least they are balanced. If I find myself starting with close then I close the lid and go and do something else.

I'm sure some sort of rather cheap algorithm falls out of the above. It wont guarantee correctness in what the balanced brackets actually contain but they will at least be balanced.

[sixstringtheory → nightfly]

Good edge case. I’d say to immediately return an ‘unbalanced’ result once the count goes negative.

[lioeters → sixstringtheory]

((((()

[detaro → lioeters]

doesn't end up with zero at the end, rejected?

[lioeters → detaro]

I was just trying to suggest a possible edge case, a failing test.

[jessaustin → nightfly]

"never go negative"