Abstract
The program and data flow of a program given in a line oriented programming language is analised according to the rules of structured programming. This allows a structured representation of arbitrary programs as far as possible
The work started, when both authors were at the Computing Centre of the Ruhr University Bochum.
Preview
Unable to display preview. Download preview PDF.
Literatur
Schneider, H.J.: Chomsky Systeme für partielle Ordnungen, Arbeitsberichte des Inst. f. Mathe. u. Datenv. 3, 3, Erlangen (1970)
Nassi, I. Shneiderman, B.: Flowcharting Techniques for Structured Programming, Sigplan Notices Vol. 8, 8 (1973), 12–26
Rosen, B.K.: High Level Data Flow Analysis, Comm. ACM, Vol. 20 (1977), 712–724
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosendahl, M., Mankwald, K.P. (1979). Analysis of programs by reduction of their structure. In: Claus, V., Ehrig, H., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science and Biology. Graph Grammars 1978. Lecture Notes in Computer Science, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025737
Download citation
DOI: https://doi.org/10.1007/BFb0025737
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09525-5
Online ISBN: 978-3-540-35091-0
eBook Packages: Springer Book Archive