scientific article; zbMATH DE number 4039266
Let be P a subprogram system. Programs which solve problems by executing sequences of calls to subprograms from P are called application programs (AP) for P. A programming technology for P and application programs is proposed. The conditions checking admissibility of sequences are removed from the application programs and the subprograms into a separate structure. This structure is a graph similar to the transition graph of a nondeterministic finite automata. Its vertices are labelled by subprograms from P and its arcs by subprograms which evaluate the actual parameters. Using this graph, the APs may generate only admissible sequences. To achieve this goal, the APs are equipped with tools for making transitions along arcs, calling subprograms from P, selecting at each vertex any of the allowed transitions, and backtracking to a previously traversed vertex in order to select a different admissible sequence.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777437)