Abstract
A program in a two-dimensional language is expressed in some diagrammatic, pictorial form, whereas a program in a “normal” language consists of a one-dimensional (linear) string of characters. To put it briefly, in the former case a program is “drawn”, whilst in the latter case it is “written”. A two-dimensional notation has been used or seems to be worthwhile at least in the following areas:
-
1.
Mathematical expressions are much more readable, if their sub- and superscripts, fractional lines, summation and integration signs with lower and upper bounds, etc. can be written in their usual two-dimensional, not in a somehow linearized form. Due to its non-numeric nature PLAN2D does not deal with such features.
-
2.
The most common use of a two-dimensional notation is the representation of control structures, especially with flow charts.+) But there are still other possibilities for exploiting the two dimensions for describing the flow of control in algorithms. Besides the features used in PLAN2D, e.g. parallelism and synchronisation in non-sequential algorithms might be well expressed diagrammatically. No major effort in this direction is known to the authors.
-
3.
Description and manipulation of linked data structures are the main concern of PLAN2D. There is a motivation for that, as simple as convincing: when dealing with linked data structures most programmers develop their algorithms with the aid of diagrams. In /Kn 68/, p. 256 Knuth recommends:“... it is helpful to draw ”before and after“ diagrams and to compare them to see which links need to be changed.” But if these diagrams are so closely related to the problem, why translating them into the linear notation of some programming language instead of using them as programs directly understandable to the computer? So, the basic feature of PLAN2D consists of “before and after” diagrams which are merged into one diagram describing the desired manipulations of links and other entities. Matching the “before” diagram with the data structure is required, i.e. pattern matching is — besides the two-dimensional notation — the most important feature of PLAN2D.
One picture is worth more than ten thousand words.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Proceedings of a Symposium on Two-D,únen Lonak Man-Machine Communication (M.B.Wells, J.B.Morris, eds), Los Alamos, ACM SIGPLAN Notices, Vol.7, No.10, Oct.1972
Wells, M.B., A Review a6 Two-D.í.menh.LonaL Pnognamm.Lng Languages, in: /TDMMC 72/, pp. 1–10
Christensen, C., An Example ob the ManLpuwatLon o6 Directed Graphs in the AMBIT/G Pnognamm-í.ng Language, in: Klerer, M., Reinfelds, J.(eds), Interactive Systems for Experimental Applied Mathematics, Acad. Press, N.Y. 68
Wolfberg, M.S., Fundamevttats o6 the AMBIT/L LL -Pnoces4Lng Language, in: /TDMMC 72/, pp. 66–75
Leavenworth, B.M., Sammet, J.E., An Ovjtv.Lew o6 Nonpnoceduta.0 Languages, Proceedings of a Symposium on Very High Level Languages, Santa Monica, Cal., ACM SIGPLAM Notices, Vol.9, No.4,April 74
Schneider, H.J., Chomfky-Systeme 61701. pantLete Okdnungen, Arbeitsberichte des Instituts für Math.Maschinen und Datenverarbeitung, Band 3, Nr. 3, Erlangen, Aug. 1970
Knuth, D.E., The Art ofComputer Programming, Vol.1, Addison-Wesley 1968
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Denert, E., Franck, R., Streng, W. (1975). PLAND2D — Towards a Two-Dimensional Programming Language. In: Siefkes, D. (eds) GI-4.Jahrestagung. Lecture Notes in Computer Science, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-40087-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-662-40087-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-39104-4
Online ISBN: 978-3-662-40087-6
eBook Packages: Springer Book Archive