Showing papers on "Prim's algorithm published in 1970"

Algorithm 399: Spanning tree

Abstract: 7. Summary We have introduced a formalism which allows us to explicate certain rather gross properties of language processing systems. As it is, the notation should be useful for designing the outlines of complex programming systems and their implementation, and it should be especially good for documentation. The formalism should also provide a mathematical basis which can be extended to handle more detailed properties of such systems. Some specific inadequacies where it could be extended follow. 1. It does not describe the amount of compilation or interpretation, unless it is coupled with precise definitions of the languages involved. For instance, in (7) we have no idea whether IL is close to machine language or to the source language. IL could be little more than assembly language, or just a trivial modification of the source language , or anything in between. Of course precise definitions of SL, IL, and ML would clear this up. 2. It does not permit the description of such processes as incremental compilation. 3. It does not permit the formal description of systems involving programs which consist of two or more pieces written in different languages, such as FSL. Acknowledgment. We have benefitted from comments by J. Gray and J. Reynolds in preparing this paper.