RELAX NG implementation of Finite Enumerations grammar.
Finite enumerations are part of high-level common sorts.
They are used by both HLPNGs and Symmetric Nets.
They define any finite enumeration sort and related operators
over elements of that sort.
File name: finiteenumerations.rng
Version: 2009
(c) 2007-2009
Lom Hillah (AFNOR)
Revision:
July 2008 - L.H
An Operator declaration is a user-declared operator using built-in.
constructs.
FiniteEnumeration is a built-in sort.
The content of a Finite Enumeration is composed of constants.
A Finite Enumeration is a built-in sort.
It is a built-in constant. It is a finite enumeration element.