Browsable Finite Automaton Grammar

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

Summary

• Total 5 production rules with 5 top alternatives and 39 symbols.
• Vocabulary: 15 = 5 nonterminals + 0 terminals + 10 labels + 0 markers.
• Total 5 nonterminal symbols: 5 defined (FiniteAutomaton, Transition, State, String, Integer), 0 root (—), 2 top (FiniteAutomaton, Integer), 0 bottom (—).
• Total 10 labels: [alphabet], [transitionSet], [initialState], [finalStateSet], [StateSet], [letter], [source], [target], [name], [combination].

Syntax

FiniteAutomaton ::=
	[alphabet]::String+ [transitionSet]::Transition+ [initialState]::State [finalStateSet]::State+ [StateSet]::State+

Transition ::=
	[letter]::String [source]::State [target]::State

State ::=
	[name]::String [combination]::State

String ::=
	string

Integer ::=
	integer

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