Browsable Control Flow Graph Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: meta/analysis/cfg/sottet/extracted
Source used for this grammar: Jean-Sébastien Sottet, CFG.ecore, 2009/03/20

Summary

• Total 8 production rules with 9 top alternatives and 35 symbols.
• Vocabulary: 14 = 7 nonterminals + 2 terminals + 5 labels + 0 markers.
• Total 7 nonterminal symbols: 7 defined (AbstractNode, Node, ConditionalNode, Expression, Boolean, String, Integer), 0 root (—), 4 top (AbstractNode, Expression, Boolean, Integer), 0 bottom (—).
• Total 2 terminal symbols: 2 keywords ("true", "false"), 0 letters (—), 0 numerics (—), 0 signs (—).
• Total 5 labels: [inNode], [outNode], [trueConditionNode], [falseConditionNode], [expressionName].

Syntax

AbstractNode ::=
	Node

AbstractNode ::=
	ConditionalNode

Node ::=
	[inNode]::Node [outNode]::Node

ConditionalNode ::=
	[trueConditionNode]::Node [falseConditionNode]::Node

Expression ::=
	[expressionName]::String

Boolean ::=
	"true"
	"false"

String ::=
	string

Integer ::=
	integer

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