An Algorithm for Optimal Procedural Nesting
Danny Crookes · The Computer Journal · 1985
This paper presents an algorithm for determining the hierarchical structure of a set of procedures, such that procedures are nested as tightly as possible. The algorithm is developed by first defining the problem more precisely. Arguments in favour of its optimality are presented. The algorithm has been used in the automatic generation of readable top-down parsers from extended BNF grammars.