Re: Logical expressions

[Zaxo]

Would a little boolean logic parser help? You could construct a Parse::RecDescent parser from standard BNL with actions to populate the hash.

What is the benefit of poking a hash full of this? Is it a parse tree to be executed, like perl constructs in its compile time? In that case it might be convenient to retain order by using arrays instead of hashes. Your (1,2,3) keys suggest you want to order them.

[rsiedl]

my thinking was to break the string down to run a series of tests on the articles it is examining.
the idea behind the hash and ordering is i can work out which tests to run first and if the important ones fail first (AND|NOT), there is no need to continue running the rest of the tests.