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= 〈c1,c2, ... , cn〉 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 $ enumeration = “〈” IdentList “〉”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wirth, N. (1983). Enumeration types. In: Programming in Modula-2. Texts and Monographs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96757-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-96757-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-96759-7
Online ISBN: 978-3-642-96757-3
eBook Packages: Springer Book Archive