Pancode and boxcharts: structured programming revisited

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Pancode and boxcharts: structured programming revisited

Full text

Pdf (745 KB)

Source

ACM SIGPLAN Notices archive
Volume 22 , Issue 8 (August 1987) table of contents

Pages: 89 - 98

Year of Publication: 1987

ISSN:0362-1340

Author

Dan Jonsson

Univ. of Go¨teborg

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 8, Citation Count: 5

Additional Information:

abstract references cited by index terms

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/35596.35605 What is a DOI?

ABSTRACT

Some new ideas regarding control structures, program charts, and the relationship between the two are presented. It is claimed that the 'pancode' primitives do, if, repeat, else, also, {, and } suffice to build control structures which are more powerful and more readable than those currently used. It is also demonstrated that an equivalent graphical representation of program structure can be obtained by means of 'boxcharts'.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Corrado Böhm , Giuseppe Jacopini, Flow diagrams, turing machines and languages with only two formation rules, Communications of the ACM, v.9 n.5, p.366-371, May 1966 [doi>10.1145/355592.365646]
	2	Edsger W. Dijkstra, Letters to the editor: go to statement considered harmful, Communications of the ACM, v.11 n.3, p.147-148, March 1968 [doi>10.1145/362929.362947]
	3	Donald E. Knuth, Structured Programming with go to Statements, ACM Computing Surveys (CSUR), v.6 n.4, p.261-301, Dec. 1974 [doi>10.1145/356635.356640]
	4	O. J. Dahl , E. W. Dijkstra , C. A. R. Hoare, Structured programming, Academic Press Ltd., London, UK, 1972
	5	Niklaus Wirth, Algorithms + Data Structures = Programs, Prentice Hall PTR, Upper Saddle River, NJ, 1978
	6	M. A. Jackson, Principles of Program Design, Academic Press, Inc., Orlando, FL, 1975
	7	I. Nassi , B. Shneiderman, Flowchart techniques for structured programming, ACM SIGPLAN Notices, v.8 n.8, p.12-26, August 1973 [doi>10.1145/953349.953350]
	8	8. M. Fitter & T. R. G. Green, "When do diagrams make good computer languages?" Int. J. Man-Machine Studies, 11, 235-261 (1979).
	9	9. M. C. Pong & N. Ng, "PIGS - A system for programming with interactive graphical support", Software - Practice and Experience, 13, 847-855 (1983).
	10	S. Matwin , T. Pietrzykowski, PROGRAPH: a preliminary report, Computer Languages, v.10 n.2, p.91-126, 1985 [doi>10.1016/0096-0551(85)90002-5]
	11	Irving B. Elliott, The EPN and ESN notations, ACM SIGPLAN Notices, v.19 n.7, July 1984 [doi>10.1145/988574.988576]
	12	Dennis W. Leinbaugh, Indenting for the compiler, ACM SIGPLAN Notices, v.15 n.5, p.41-48, May 1980 [doi>10.1145/947639.947644]

CITED BY 5

	T. A. Kovats, Comments on innovative control constructs in pancode and EPN, ACM SIGPLAN Notices, v.23 n.12, p.151-157, Dec. 1988
	T. Kovats, A conservative alternative to pancode, ACM SIGPLAN Notices, v.25 n.11, p.80-84, Nov. 1990
	D. Jonsson, The flow of control notations pancode and boxcharts, ACM SIGPLAN Notices, v.25 n.8, p.106-119, Aug. 1990
	D. Jonsson, Next: the elimination of Goto-patches?, ACM SIGPLAN Notices, v.24 n.3, p.85-92, March 1989
	D. Jonsson, Graphical program notations, ACM SIGSOFT Software Engineering Notes, v.14 n.5, p.78-79, July 1989