Browsable Clafer Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: clafer/unknown/extracted
Source used for this grammar: Source unknown, This grammar looks like it was copy-pasted from a PDF, 15 June 2012

Summary

• Total 54 production rules with 122 top alternatives and 422 symbols.
• Vocabulary: 109 = 57 nonterminals + 52 terminals + 0 labels + 0 markers.
• Total 57 nonterminal symbols: 54 defined (Module, Declaration, Clafer, Constraint, Abstract, Elements, Element, Super, GCard, Card, GNCard, NCard, ExInteger, Name, LExp, LExp1, LExp2, LExp3, LExp4, LExp5, LExp6, Term, Iff, Implies, And, Xor, Or, Neg, CmpExp, Exp, Quant, ExQuant, SExp, SExp1, SExp2, SExp3, SExp4, SExp5, Decl, Disj, AExp, AExp1, AExp2, StrExp, EnumId, ModId, LocId, ListDeclaration, ListEnumId, ListElement, ListLExp, ListDecl, ListLocId, ListModId), 0 root (—), 1 top (Module), 3 bottom (Integer ⁴, String, Ident ⁷).
• Total 52 terminal symbols: 16 keywords ("enum", "abstract", "extends", "xor" ², "or", "mux", "opt", "else", "in" ², "not", "no", "lone", "one", "some", "all", "disj"), 0 letters (—), 0 numerics (—), 36 signs ("=" ², "[", "]", "{", "}", "‘", ":" ², "−>", "<" ², ">" ², "?", "+" ², "*" ³, "−" ², "..", "(" ³, ")" ³, "|" ², "<=>", "=>", "&&", "||", "~", "==", "<=", ">=", "!=", "/=", "++" ², "&", "<:", ":>", ".", "#", "," ², "/").

Syntax

Module ::=
	ListDeclaration

Declaration ::=
	"enum" Ident "=" ListEnumId
	Clafer
	Constraint

Clafer ::=
	Abstract GCard Ident Super Card Elements

Constraint ::=
	"[" ListLExp "]"

Abstract ::=
	ε
	"abstract"

Elements ::=
	ε
	"{" ListElement "}"

Element ::=
	Clafer
	"‘" Name Card Elements
	Constraint

Super ::=
	ε
	":" Name
	"extends" Name
	"−>" ListModId SExp

GCard ::=
	ε
	"xor"
	"or"
	"mux"
	"opt"
	"<" GNCard ">"

Card ::=
	ε
	"?"
	"+"
	"*"
	NCard

GNCard ::=
	Integer "−" ExInteger

NCard ::=
	Integer ".." ExInteger

ExInteger ::=
	"*"
	Integer

Name ::=
	ListModId Ident

LExp ::=
	LExp Iff LExp1
	LExp1

LExp1 ::=
	LExp1 Implies LExp2
	LExp1 Implies LExp2 "else" LExp2
	LExp2

LExp2 ::=
	LExp2 Or LExp3
	LExp3

LExp3 ::=
	LExp3 Xor LExp4
	LExp4

LExp4 ::=
	LExp4 And LExp5
	LExp5

LExp5 ::=
	Neg LExp6
	LExp6

LExp6 ::=
	Term
	"(" LExp ")"

Term ::=
	CmpExp
	SExp
	Quant SExp
	ListDecl
	"|"
	LExp

Iff ::=
	"<=>"

Implies ::=
	"=>"

And ::=
	"&&"

Xor ::=
	"xor"

Or ::=
	"||"

Neg ::=
	"~"

CmpExp ::=
	Exp "<" Exp
	Exp ">" Exp
	Exp "=" Exp
	Exp "==" Exp
	Exp "<=" Exp
	Exp ">=" Exp
	Exp "!=" Exp
	Exp "/=" Exp
	Exp "in" Exp
	Exp "not" "in" Exp

Exp ::=
	AExp
	StrExp

Quant ::=
	"no"
	"lone"
	"one"
	"some"

ExQuant ::=
	"all"
	Quant

SExp ::=
	SExp "++" SExp1
	SExp1

SExp1 ::=
	SExp1 "&" SExp2
	SExp2

SExp2 ::=
	SExp2 "<:" SExp3
	SExp3

SExp3 ::=
	SExp3 ":>" SExp4
	SExp4

SExp4 ::=
	SExp4 "." SExp5
	SExp5

SExp5 ::=
	Ident
	"(" SExp ")"

Decl ::=
	ExQuant Disj ListLocId ":" SExp

Disj ::=
	ε
	"disj"

AExp ::=
	AExp "+" AExp1
	AExp "−" AExp1
	AExp1

AExp1 ::=
	AExp1 "*" AExp2
	AExp2

AExp2 ::=
	"#" SExp
	SExp
	Integer
	"(" AExp ")"

StrExp ::=
	StrExp "++" StrExp
	String

EnumId ::=
	Ident

ModId ::=
	Ident

LocId ::=
	Ident

ListDeclaration ::=
	ε
	Declaration ListDeclaration

ListEnumId ::=
	EnumId
	EnumId
	EnumId "|" ListEnumId

ListElement ::=
	ε
	Element ListElement

ListLExp ::=
	ε
	LExp ListLExp

ListDecl ::=
	Decl
	Decl "," ListDecl

ListLocId ::=
	LocId
	LocId "," ListLocId

ListModId ::=
	ε
	ModId "/" ListModId

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