Browsable ASF Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: transform/asf/sdf/extracted
Source used for this grammar: Jurgen Vinju, SDF Library, asf/syntax/*.sdf, February 2006 [Explore]

Summary

Total 19 production rules with 19 top alternatives and 145 symbols.
Vocabulary: 35 = 12 nonterminals + 14 terminals + 9 labels + 0 markers.
Total 12 nonterminal symbols: 9 defined (ASF-Condition, ASF-Conditions, Tree, ASF-ConditionalEquation, ASF-Equation, ASF-Module, ASF-Section, ASF-Tag, ASF-TestEquation), 0 root (—), 1 top (ASF-Module), 3 bottom (ASF-Implies², ASF-TagId, CHAR).
Total 14 terminal symbols: 4 keywords ("amb", "when"², "equations", "tests"), 0 letters (—), 0 numerics (—), 10 signs ("!=", "==", ":=", "!:=", ","², "("², ")"², "=", "["², "]"²).
Total 9 labels: [lhs]⁵, [unequal], [rhs]⁵, [equality], [match]², [list]⁴, [ambs], [name], [test-list].

ASF-Condition ::=
	[lhs]::Tree [unequal]::"!=" [rhs]::Tree

ASF-Condition ::=
	[lhs]::Tree [equality]::"==" [rhs]::Tree

ASF-Condition ::=
	[lhs]::Tree [match]::":=" [rhs]::Tree

ASF-Condition ::=
	[lhs]::Tree [match]::"!:=" [rhs]::Tree

ASF-Conditions ::=
	[list]::(ASF-Condition ("," ASF-Condition)*)

Tree ::=
	"amb" "(" [ambs]::(Tree ("," Tree)*)? ")"

Tree ::=
	[name]::Tree "(" [list]::CHAR* ")"

ASF-ConditionalEquation ::=
	ASF-Tag ASF-Equation

ASF-ConditionalEquation ::=
	ASF-Tag ASF-Conditions ASF-Implies ASF-Equation

ASF-ConditionalEquation ::=
	ASF-Tag ASF-Equation "when" ASF-Conditions

ASF-Equation ::=
	[lhs]::Tree "=" [rhs]::Tree

ASF-Module ::=
	[list]::ASF-Section*

ASF-Section ::=
	"equations" [list]::ASF-ConditionalEquation*

ASF-Section ::=
	"tests" [test-list]::ASF-TestEquation*

ASF-Tag ::=
	"[" "]"

ASF-Tag ::=
	"[" ASF-TagId "]"

ASF-TestEquation ::=
	ASF-Tag ASF-Condition

ASF-TestEquation ::=
	ASF-Tag ASF-Conditions ASF-Implies ASF-Condition

ASF-TestEquation ::=
	ASF-Tag ASF-Condition "when" ASF-Conditions

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