No label defined (Q3777437)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4039266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4039266 |
Statements
1987
0 references
subprogram system
0 references
backtracking
0 references
0.83093065
0 references
0.8061023
0 references
0.8022437
0 references
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.
0 references