Skip to main content

Part of the book series: Text and Monographs in Computer Science ((MCS))

  • 116 Accesses

Abstract

A new unstructured type may be declared as an enumeration, i.e. by enumerating the set of values which belong to this type. The type declaration

$$T = ({c_1},{c_2},...,{c_n})$$

introduces the new, unstructured type T, whose values are denoted by the n constant identifiers c1, c2, ... , cn. These are the only values belonging to that type. The syntax for the enumeration type declaration is

$$\$ {\text{enumeration = ''(''IdentList}}'')''.$$

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Wirth, N. (1988). Enumeration Types. In: Programming in Modula-2. Text and Monographs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83565-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83565-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83567-4

  • Online ISBN: 978-3-642-83565-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics