Browsable PNML Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: automata/petri/pnml/standard/cyclic/extracted
Source used for this grammar: Lom Hillah, RELAX NG implementation of Cyclic Enumerations grammar, cyclicenumerations.rng, July 2008 [Download]

Summary

• Total 7 production rules with 8 top alternatives and 26 symbols.
• Vocabulary: 12 = 9 nonterminals + 0 terminals + 3 labels + 0 markers.
• Total 9 nonterminal symbols: 7 defined (BuiltInSort, BuiltInOperator, CyclicEnumeration, CyclicEnumOperator.content, CyclicEnumOperator, Successor, Predecessor), 0 root (—), 2 top (BuiltInSort, BuiltInOperator), 2 bottom (BuiltInOperator.content, FiniteEnumeration.content).
• Total 3 labels: [cyclicenumeration], [successor], [predecessor].

Syntax

BuiltInSort ::=
	CyclicEnumeration

BuiltInOperator ::=
	CyclicEnumOperator

CyclicEnumeration ::=
	[cyclicenumeration]::FiniteEnumeration.content

CyclicEnumOperator.content ::=
	BuiltInOperator.content

CyclicEnumOperator ::=
	Successor
	Predecessor

Successor ::=
	[successor]::CyclicEnumOperator.content

Predecessor ::=
	[predecessor]::CyclicEnumOperator.content

Maintained by Dr. Vadim Zaytsev a.k.a. @grammarware. Last updated in September 2015. [↑]