Scope of Selection Nodes in Object Oriented Programs

Many complexity measures have been introduced to capture different aspects of code complexity. A factor that (in most cases) increases the difficulty of code is the excessive use of nesting constructs. In this work, we examine the difficulty created by nesting constructs in object oriented programs. We concentrate on measuring the scope of predicate (selection) statements within a method and between different methods by employing a new model named the control call inheritance graph (CCI). Unlike classic control flow graphs, the CCI graph captures the flow of control between the different statements of a method, between the different statements of different methods, and the flow created by inheritance relationships among different classes.