Browsable Hybrid Automaton Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: automata/hybrid/extracted
Source used for this grammar: Youssef Srour, HybridAutomata.ecore, 2006/07/13

Summary

• Total 5 production rules with 6 top alternatives and 29 symbols.
• Vocabulary: 13 = 5 nonterminals + 2 terminals + 6 labels + 0 markers.
• Total 5 nonterminal symbols: 5 defined (String, Boolean, Integer, FiniteTransition, FiniteState), 0 root (—), 3 top (Integer, FiniteTransition, FiniteState), 0 bottom (—).
• Total 2 terminal symbols: 2 keywords ("true", "false"), 0 letters (—), 0 numerics (—), 0 signs (—).
• Total 6 labels: [trigger], [guard], [action], [name], [position], [isInit].

Syntax

String ::=
	string

Boolean ::=
	"true"
	"false"

Integer ::=
	integer

FiniteTransition ::=
	[trigger]::String [guard]::String [action]::String

FiniteState ::=
	[name]::String [position]::String [isInit]::Boolean

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