Grammar file

mail@pastecode.io avatar
unknown
plain_text
3 years ago
477 B
13
Indexable
Never
using semantics ProseMath.Semantics;
using learners ProseMath.WitnessFunctions;

language ProseMath;

@complete feature double Score = ProseMath.RankingScore, ProseMath.PerformanceScore;

@input int[] v;

@start int? program := Sum(Elem,Elem);

int? Elem := Mul(v,pos,pos) | Div(v,pos,pos) | ElementAt(v,pos);

int? pos := AbsPos(v,k);

int k;



// Temp comment for pastecode.

// Any math expression containing '+' element can be re arranged to make that as root node of AST.