Browsable FL Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: toy/fl/concrete/sdf/extracted
Source used for this grammar: Ralf Lämmel, Vadim Zaytsev, FL.sdf, Syntax.sdf, Numbers.sdf, Optimiser.sdf, 1–25 Aug 2008 [GitHub]

Summary

• Total 11 production rules with 11 top alternatives and 64 symbols.
• Vocabulary: 24 = 7 nonterminals + 9 terminals + 8 labels + 0 markers.
• Total 7 nonterminal symbols: 4 defined (Program, Function, Expr, Ops), 0 root (—), 1 top (Program), 3 bottom (Newline, Int, Name ⁴).
• Total 9 terminal symbols: 3 keywords ("if", "then", "else"), 0 letters (—), 0 numerics (—), 6 signs ("=", "(", ")", "-", "+", "==").
• Total 8 labels: [binary], [apply], [ifThenElse], [argument], [literal], [minus], [plus], [equal].

Syntax

Program ::=
	Function+

Function ::=
	Name Name+ "=" Expr Newline+

Expr ::=
	[binary]::(Expr Ops Expr)

Expr ::=
	[apply]::(Name Expr+)

Expr ::=
	[ifThenElse]::("if" Expr "then" Expr "else" Expr)

Expr ::=
	"(" Expr ")"

Expr ::=
	[argument]::Name

Expr ::=
	[literal]::Int

Ops ::=
	[minus]::"-"

Ops ::=
	[plus]::"+"

Ops ::=
	[equal]::"=="

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