in reply to Re^2: IT's not counting...
in thread IT's not counting...

I made an oops before I posted!

$testString is supposed to be the local $string! A leftover from when I was just trying to get it to work at all haha! Which gives us more room to work with since you know that we can do whatever we want as long as the number of parentheses are counted!

And I don't really want to use too much regex (not much understanding of regex) if I can avoid it. (Why on earth did I try making a simple line parser? :P )

As a note, samar pointed me to what I think I'll need... but eventually the concept will have to be expanded eventually to fit my needs...

Replies are listed 'Best First'.
Re^4: IT's not counting...
by JavaFan (Canon) on Nov 16, 2010 at 11:05 UTC
    If you want to find out whether parenthesis are balanced in a string, you do not need a complicated regexp. In fact, you could even do it without a regexp at all, but let me present you a solution with a simple regexp:
    sub is_balanced { my $_ = shift; my $c = 0; while (/([()])/g) { if ($1 eq '(') {$c++; next} return if --$c < 0; } $c == 0; }
    The trick is to keep a counter. Increase the counter by 1 each time you see a '(', decrement the counter by 1 each time you see a ')'. If the counter ever becomes less than 0, or if the counter isn't 0 when reaching the end of the string, the parens aren't balanced. Otherwise, they are.