-
Notifications
You must be signed in to change notification settings - Fork 0
/
ast.js
93 lines (81 loc) · 1.64 KB
/
ast.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
// Simple AST module to represent all the algebra expression with
// all the CR/BR , chains of recurrences / basic recurrence.
class Position {
constructor( src , s , e ) {
this.source = src;
this.start = s;
this.end = e;
}
get snippet() {
return this.source.substr(this.start,this.end-this.start);
}
};
class Operator {
static get opAdd() { return 1; }
static get opSub() { return 2; }
static get opMul() { return 3; }
};
class Integer {
constructor( value , pos ) {
this.position = pos;
this.value = value;
}
};
class Variable {
constructor( name , pos ) {
this.position = pos;
this.name = name;
}
};
class AddRecurrence {
constructor( start , stride , pos ) {
this.position = pos;
this.start = start;
this.stride = stride;
}
};
class Negate {
constructor( opr , pos ) {
this.position = pos;
this.oprand = opr;
}
};
class Binary {
constructor( lhs , rhs, op, pos ) {
this.position = pos;
this.op = op;
this.lhs = lhs;
this.rhs = rhs;
}
};
class Var {
constructor( lhs , rhs , pos ) {
this.position = pos;
this.lhs = lhs;
this.rhs = rhs;
}
};
class Output {
constructor(pos,tuple) {
this.position = pos;
this.tuple = tuple;
}
};
class Program {
constructor(pos,stmt) {
this.position = pos;
this.statement= stmt;
}
};
module.exports = {
Position : Position ,
Operator : Operator ,
Integer : Integer ,
Variable : Variable ,
AddRecurrence : AddRecurrence,
Negate : Negate,
Binary : Binary,
Var : Var ,
Output : Output,
Program : Program
};