Browsable FL Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: toy/fl/concrete/antlr/extracted
Source used for this grammar: Ralf Lämmel, FL.g, 17 May – 16 July 2008 [GitHub]

Summary

Total 8 production rules with 14 top alternatives and 74 symbols.
Vocabulary: 32 = 11 nonterminals + 9 terminals + 12 labels + 0 markers.
Total 11 nonterminal symbols: 8 defined (program, function, expr, binary, apply, ifThenElse, atom, ops), 0 root (—), 1 top (program), 3 bottom (ID⁴, NEWLINE, INT).
Total 9 terminal symbols: 3 keywords ("if", "then", "else"), 0 letters (—), 0 numerics (—), 6 signs ("=", "(", ")", "==", "+", "-").
Total 12 labels: [f], [n], [a]³, [e]², [b], [i]², [l], [o], [r], [c], [e1], [e2].

program ::=
	[f]::function+

function ::=
	[n]::ID [a]::ID+ "=" [e]::expr NEWLINE+

expr ::=
	[b]::binary
	[a]::apply
	[i]::ifThenElse

binary ::=
	[l]::atom ([o]::ops [r]::atom)*

apply ::=
	[i]::ID [a]::atom+

ifThenElse ::=
	"if" [c]::expr "then" [e1]::expr "else" [e2]::expr

atom ::=
	ID
	INT
	"(" [e]::expr ")"

ops ::=
	"=="
	"+"
	"-"

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