Browsable PNML Grammar

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

Summary

• Total 5 production rules with 5 top alternatives and 18 symbols.
• Vocabulary: 8 = 6 nonterminals + 0 terminals + 2 labels + 0 markers.
• Total 6 nonterminal symbols: 5 defined (OperatorDeclaration, BuiltInSort, FiniteEnumeration.content, FiniteEnumeration, FEConstant), 0 root (—), 2 top (OperatorDeclaration, BuiltInSort), 1 bottom (OperatorDeclaration.content).
• Total 2 labels: [finiteenumeration], [feconstant].

Syntax

OperatorDeclaration ::=
	FEConstant

BuiltInSort ::=
	FiniteEnumeration

FiniteEnumeration.content ::=
	FEConstant*

FiniteEnumeration ::=
	[finiteenumeration]::FiniteEnumeration.content

FEConstant ::=
	[feconstant]::OperatorDeclaration.content

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