1- This program takes two arguments. The first one is the name of the input hierarchy under the format .inh. The second one is the name of the ouput is a file where the list of the nodes of the hierarchy and their bit-vector codes will be stored. This is an implementation of the dichotomic algorithm. The input hierarchy have to be a TREE hierarchy.

        Example:

        Input file toto.inh

            super Object name Rectangle
            super Rectangle name Square
            super Object name Triangle

        Output file toto.bit

            Object 000
            Rectangle 100
            Square 110
            Triangle 001

2- The program uses standard C++ libraries.