Grammar#
The Meson language is defined by the following token types and production rules.
Token type |
Matches (case-insensitive except for name tokens) |
---|---|
inf |
|
sup |
|
flow |
|
roam |
|
conj |
|
modal |
|
how |
|
name |
|
(skip) |
|
MesonScript ::= roam? initialSentence sentence*
initialSentence ::= assertion | supposition
sentence ::= conclusion | (roam|flow)? initialSentence
conclusion ::= inf assertion method?
assertion ::= nodes reason*
reason ::= sup nodes
method ::= how nodes
supposition ::= modal nodes
nodes ::= name (conj name)*