Browsable DTMP (discrete time Markov processes) 1.0 Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: automata/dtmp/extracted
Source used for this grammar: Youssef Srour, DTMP (discrete time Markov processes) 1.0, DTMP.ecore, 2006/07/24

Summary

• Total 6 production rules with 7 top alternatives and 52 symbols.
• Vocabulary: 20 = 6 nonterminals + 2 terminals + 12 labels + 0 markers.
• Total 6 nonterminal symbols: 6 defined (String, Boolean, Integer, State, Transition, Parameter), 0 root (—), 1 top (Integer), 0 bottom (—).
• Total 2 terminal symbols: 2 keywords ("true", "false"), 0 letters (—), 0 numerics (—), 0 signs (—).
• Total 12 labels: [name] ², [isStart], [isEnd], [isFail], [incoming], [outGoing], [formalParam], [transProb], [to], [from], [type], [state].

Syntax

String ::=
	string

Boolean ::=
	"true"
	"false"

Integer ::=
	integer

State ::=
	[name]::String [isStart]::Boolean [isEnd]::Boolean [isFail]::Boolean [incoming]::Transition+ [outGoing]::Transition+ [formalParam]::Parameter+

Transition ::=
	[transProb]::String+ [to]::State [from]::State

Parameter ::=
	[name]::String+ [type]::String+ [state]::State

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