Browsable Execution Graphs Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: meta/analysis/eg/extracted
Source used for this grammar: Youssef Srour, EG.ecore, 2006/07/24

Summary

• Total 27 production rules with 34 top alternatives and 139 symbols.
• Vocabulary: 24 = 16 nonterminals + 2 terminals + 6 labels + 0 markers.
• Total 16 nonterminal symbols: 16 defined (ExecutionGraph, Node, Start, End, Control, Basic, Branch, Loop, Fork, Join, Acquire, Release, Split, String, Boolean, Integer), 0 root (—), 3 top (String, Boolean, Integer), 0 bottom (—).
• Total 2 terminal symbols: 2 keywords ("true", "false"), 0 letters (—), 0 numerics (—), 0 signs (—).
• Total 6 labels: [node], [nodeNested], [predecessor] ⁴, [successor] ⁴, [executionGraph] ⁴, [nested] ⁴.

Syntax

ExecutionGraph ::=
	[node]::Node+ [nodeNested]::Node

Node ::=
	Start

Node ::=
	End

Node ::=
	Control

Node ::=
	Basic

Node ::=
	[predecessor]::Node+ [successor]::Node+ [executionGraph]::ExecutionGraph [nested]::ExecutionGraph+

Start ::=
	[predecessor]::Node+ [successor]::Node+ [executionGraph]::ExecutionGraph [nested]::ExecutionGraph+

End ::=
	[predecessor]::Node+ [successor]::Node+ [executionGraph]::ExecutionGraph [nested]::ExecutionGraph+

Control ::=
	Branch

Control ::=
	Loop

Control ::=
	Fork

Control ::=
	Join

Control ::=
	Acquire

Control ::=
	Release

Control ::=
	Split

Control ::=
	Branch
	Loop
	Fork
	Join
	Acquire
	Release
	Split

Basic ::=
	[predecessor]::Node+ [successor]::Node+ [executionGraph]::ExecutionGraph [nested]::ExecutionGraph+

Branch ::=
	ε

Loop ::=
	ε

Fork ::=
	ε

Join ::=
	ε

Acquire ::=
	ε

Release ::=
	ε

Split ::=
	ε

String ::=
	string

Boolean ::=
	"true"
	"false"

Integer ::=
	integer

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