P
Peter Michaux
Hi,
In the following string I would like to find the word that comes after
"test" as long as test is not inside parenthesis. In this example the
match would be "two".
"the (test one) test two"
I found some indication that Perl regexp can do this with some sort of
recursive regexp. Can JavaScript regular expressions ensure that all
parentheses to the right of "test" are closed before proclaiming a
match? If so how? If not must I walk through the string counting how
nested each character is?
Thank you,
Peter
In the following string I would like to find the word that comes after
"test" as long as test is not inside parenthesis. In this example the
match would be "two".
"the (test one) test two"
I found some indication that Perl regexp can do this with some sort of
recursive regexp. Can JavaScript regular expressions ensure that all
parentheses to the right of "test" are closed before proclaiming a
match? If so how? If not must I walk through the string counting how
nested each character is?
Thank you,
Peter