Skip to main content

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 78))

  • 50 Accesses

Summary

Four classes of control structures for sequential programs are shown to offer increasing expressive power. They allow control to be specified by

  1. (1)

    four well-chosen structures with one entry and one exit each,

  2. (2)

    the one-entry loop with escapes,

  3. (3)

    the distributor-entered loop with escapes, and

  4. (4)

    the unrestricted jump.

It is shown that a given program scheme can be described by the one-entry loop with escapes if and only if all control paths from the start to a cycle enter that cycle at the same node (irrespective of the number of nodes where the cycle is re-entered).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • E. Ashcroft and Z. Manna, The translation of “go to” programs to “while” programs, IFIP Congress, Ljubljana, preprint TA-2, 147–152, August 1971.

    Google Scholar 

  • M. Clint and C.A.R. Hoare, Program proving: jumps and functions, Acta informatica 1, 214–224, 1972.

    Article  Google Scholar 

  • E.W. Dijkstra, Notes on structured programming, Report 70-Wsk-03, Technical University Eindhoven, April 1970.

    Google Scholar 

  • D. E. Knuth and R.W. Floyd, Notes on avoiding “go to” statements, Information processing letters 23–31, February 1971.

    Google Scholar 

  • M. Richards, BCPL: A tool for compiler writing and systems programming, AFIPS SJCC 34, 557–566, 1969.

    Google Scholar 

  • E.Wegner, A generalized completer for ALGOL 68, ALGOL Bulletin, to be published.

    Google Scholar 

  • A.van Wijngaarden, B.J. Mailloux, J.E.L. Peck, and C.H.A. Köster, Report on the algorithmic language ALGOL 68, Numerische Mathematik 14, 79–218, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  • N. Wirth, Program development by stepwise refinement, Comm. ACM 14, 221–227, April 1971.

    Article  MATH  Google Scholar 

  • W.A. Wulf, Programming without the goto, IFIP Congress, Ljubljana, preprint TA-3, 84–88, August 1971.

    Google Scholar 

  • W.A. Wulf, D.B. Russell, and A.N. Habermann, BLISS: A language for systems programming, Comm. ACM 14, 780–790, December 1971.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Wegner, E. (1973). A Hierarchy of Control Structures. In: Deussen, P. (eds) GI. Gesellschaft für Informatik e.V. 2. Jahrestagung. Lecture Notes in Economics and Mathematical Systems, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80732-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80732-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06127-4

  • Online ISBN: 978-3-642-80732-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics