Browsable PNML Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: automata/petri/pnml/standard/arbitrary/extracted
Source used for this grammar: Lom Hillah, RELAX NG implementation of High-level Petri nets user-defined grammar, arbitrarydeclarations.rng, July 2008 [Download]

Summary

• Total 6 production rules with 6 top alternatives and 30 symbols.
• Vocabulary: 16 = 11 nonterminals + 0 terminals + 5 labels + 0 markers.
• Total 11 nonterminal symbols: 6 defined (Declaration, SortDeclaration, OperatorDeclaration, ArbitrarySort, ArbitraryOperator, Unparsed), 0 root (—), 3 top (Declaration, SortDeclaration, OperatorDeclaration), 5 bottom (anyElement, Sort ², SortDeclaration.content, Declaration.content, OperatorDeclaration.content).
• Total 5 labels: [arbitrarysort], [input], [output], [arbitraryoperator], [unparsed].

Syntax

Declaration ::=
	Unparsed

SortDeclaration ::=
	ArbitrarySort

OperatorDeclaration ::=
	ArbitraryOperator

ArbitrarySort ::=
	[arbitrarysort]::SortDeclaration.content

ArbitraryOperator ::=
	[arbitraryoperator]::(OperatorDeclaration.content [input]::Sort* [output]::Sort)

Unparsed ::=
	[unparsed]::(Declaration.content anyElement*)

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