Browsable Finite State Machine Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: automata/fsm/extracted
Source used for this grammar: Youssef Srour, Finite State Machine 1.0, FiniteStateMachine.ecore, 2006/07/14

Summary

• Total 11 production rules with 11 top alternatives and 73 symbols.
• Vocabulary: 20 = 8 nonterminals + 0 terminals + 12 labels + 0 markers.
• Total 8 nonterminal symbols: 8 defined (MgaObject, Transition, State, StateMachine, RootFolder, AssociationStateState, String, Integer), 0 root (—), 2 top (MgaObject, Integer), 0 bottom (—).
• Total 12 labels: [name] ², [position], [stateMachine] ³, [associationStateState], [associationStateStatedst], [associationStateStatesrc], [rootFolder], [state], [transition] ², [rootFolders], [dstTransition], [srcTransition].

Syntax

MgaObject ::=
	Transition

MgaObject ::=
	State

MgaObject ::=
	StateMachine

MgaObject ::=
	[name]::String [position]::String

Transition ::=
	[stateMachine]::StateMachine [associationStateState]::AssociationStateState

State ::=
	[stateMachine]::StateMachine [associationStateStatedst]::AssociationStateState+ [associationStateStatesrc]::AssociationStateState+

StateMachine ::=
	[rootFolder]::RootFolder [state]::State+ [transition]::Transition+

RootFolder ::=
	[name]::String [rootFolders]::RootFolder+ [stateMachine]::StateMachine+

AssociationStateState ::=
	[transition]::Transition [dstTransition]::State+ [srcTransition]::State+

String ::=
	string

Integer ::=
	integer

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