Abstract

AbstractCertain types of computer language popular in areas such as decision support systems have the property that language statements need not be written in execution sequence, as the correct evaluation order can be established by dependency analysis. The uncontrolled use of these ‘nonsequential’ languages can lead to the development of programs and systems that are difficult to comprehend and maintain. This paper describes a method of clustering such code statements into sequential (procedural) modules to clarify visual presentation. The technique is based on depth‐first search of directed graphs and will group those statements which are most strongly related to each other into a module.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call