By looking Figure 3.1 it is seen that all subsets that belong to properties are located into tree. While examining rule reducts that belong to an object, in tree first of all, the way which will be followed starts from the root, and then goes to left child and finally the right child. Working principle of PRG algorithm can be told in detail as follows:
Step 0: Number of objects is assigned to be i 1.

Step 1: By building up the tree, all keys in nodes are assigned to be k=0. Step 2: Node = Root. Step 3: SEQUENCEOFACTION (Node)
Step 4: Seti i  1. If all objects are done, go to step 5, if not go to step 1.

Step 5: Finish. SEQUENCEOFACTION (Node)
IF (RULEREDUCTION (Node))
Node is assigned to be Node.key = 1 The Rule Reduct in node is declared. For all nodes connected to right child of the node and all nodes that are in same line with the mentioned node and includes all properties that the node has, assign Node.key = 1. This process makes redundant branches of tree pruned.

If Node.left null SEQUENCEOFACTION(Node.left)
If Node.rightnull and Node.key = 0 SEQUENCEOFACTION(Node.right)
RULEREDUCTION (Node)
If Node.key = 1 return "FALSE"

```
If for all j,j  i; [(1 1
                                   
                        a j,k  ai,k
                                    ) or (2 21
                                                       
                                           a j,k  ai,k) or …t t
                                                                            
                                                                 a j,k  ai,k
                                                                             )] then the case

Fk aik Fk aik Fk t aik d di
                   t
                   
 ,,..., 1 1 2 2
            
                         is rule reduct. Return "TRUE"

```
