12. The computer program product of claim 11 , wherein the tree data structure is traversed by setting the current node of the tree data structure to be a root node of the subtree associated with the clause.
12. The computer program product of claim 11 , wherein the tree data structure is traversed by setting the current node of the tree data structure to be a root node of the subtree associated with the clause. 17. The computer program product of claim 12 , further comprising: fifth sub-instructions for determining if there are any child nodes of the current node corresponding to a “wildcard” node; and sixth sub-instructions for adding any target resources or rules associated with the “wildcard” node to a list of matched resources or rules.