-
Notifications
You must be signed in to change notification settings - Fork 0
/
parser.mly
146 lines (126 loc) · 4.46 KB
/
parser.mly
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
%{ open Ast %}
%token SEMI LPAREN RPAREN LBRACE RBRACE LBRACK RBRACK COMMA DOUBLECOL
%token PLUS MINUS TIMES DIVIDE INCR DECR MOD ASSIGN NOT
%token EQ NEQ LT LEQ GT GEQ TRUE FALSE AND OR
%token RETURN NULL IF ELIF ELSE NEW FOR WHILE NUM INT BOOL STRING VOID DOT
%token QUEUE LINKEDLIST STACK BSTREE
%token <float> NUM_LITERAL
%token <int> INT_LITERAL
%token <string> STRING_LITERAL
%token <string> ID
%token EOF
%nonassoc NOELSE
%nonassoc ELSE
%nonassoc ELIF
%left INCR DECR
%right ASSIGN
%left OR
%left AND DOT
%left EQ NEQ
%left LT GT LEQ GEQ
%left PLUS MINUS
%left TIMES DIVIDE
%right MOD
%right NOT NEG
%start program
%type <Ast.program> program
%%
program:
decls EOF { $1 }
decls:
/* nothing */ { [] }
| decls fdecl { $2 :: $1 }
fdecl:
typ ID LPAREN formals_opt RPAREN LBRACE stmt_list RBRACE
{ { typ = $1;
fname = $2;
formals = $4;
body = List.rev $7 } }
formals_opt:
/* nothing */ { [] }
| formal_list { List.rev $1 }
formal_list:
typ ID { [($1,$2)] }
| formal_list COMMA typ ID { ($3,$4) :: $1 }
primitive:
NUM { Num }
| INT { Int }
| STRING { String }
| BOOL { Bool }
| VOID { Void }
ds_type:
primitive LBRACK INT_LITERAL RBRACK { Arraytype($1, $3) }
| QUEUE DOUBLECOL primitive { QueueType($3) }
| LINKEDLIST DOUBLECOL primitive { LinkedListType($3) }
| STACK DOUBLECOL primitive { StackType($3) }
| BSTREE DOUBLECOL primitive { BSTreeType($3) }
typ:
primitive { $1 }
| ds_type { $1 }
stmt_list:
/* nothing */ { [] }
| stmt_list stmt { $2 :: $1 }
stmt:
expr SEMI { Expr $1 }
| RETURN SEMI { Return Noexpr }
| RETURN expr SEMI { Return $2 }
| LBRACE stmt_list RBRACE { Block(List.rev $2) }
| IF LPAREN expr RPAREN stmt %prec NOELSE { If($3, $5, Block([])) }
| IF LPAREN expr RPAREN stmt ELSE stmt { If($3, $5, $7) }
| IF LPAREN expr RPAREN stmt else_stmt { If($3, $5, $6) }
| FOR LPAREN expr_opt SEMI expr SEMI expr_opt RPAREN stmt
{ For($3, $5, $7, $9) }
| WHILE LPAREN expr RPAREN stmt { While($3, $5) }
else_stmt:
ELIF LPAREN expr RPAREN stmt %prec NOELSE { If($3, $5, Block([])) }
| ELIF LPAREN expr RPAREN stmt else_stmt { If($3, $5, $6) }
| ELIF LPAREN expr RPAREN stmt ELSE stmt { If($3, $5, $7) }
expr_opt:
/* nothing */ { Noexpr }
| expr { $1 }
expr:
literal { $1 }
| expr PLUS expr { Binop($1, Add, $3) }
| expr MINUS expr { Binop($1, Sub, $3) }
| expr TIMES expr { Binop($1, Mult, $3) }
| expr DIVIDE expr { Binop($1, Div, $3) }
| expr MOD expr { Binop($1, Mod, $3) }
| expr EQ expr { Binop($1, Equal, $3) }
| expr NEQ expr { Binop($1, Neq, $3) }
| expr LT expr { Binop($1, Less, $3) }
| expr LEQ expr { Binop($1, Leq, $3) }
| expr GT expr { Binop($1, Greater, $3) }
| expr GEQ expr { Binop($1, Geq, $3) }
| expr AND expr { Binop($1, And, $3) }
| expr OR expr { Binop($1, Or, $3) }
| MINUS expr %prec NEG { Unop(Neg, $2) }
| NOT expr { Unop(Not, $2) }
| expr INCR { Postop($1, Incr) }
| expr DECR { Postop($1, Decr) }
| typ ID { Assign($1, $2, Noexpr) }
| typ ID ASSIGN expr { Assign($1, $2, $4) }
| expr DOT ID LPAREN actuals_opt RPAREN { ObjectCall($1, $3, $5) }
| ID ASSIGN expr { Reassign($1, $3) }
| ID LPAREN actuals_opt RPAREN { FuncCall($1, $3) }
| LBRACK actuals_opt RBRACK { ArrayLit($2) }
| ID LBRACK expr RBRACK { ArrayAccess($1, $3) }
| ID LBRACK expr RBRACK ASSIGN expr { ArrayElementAssign($1, $3, $6) }
| LPAREN expr RPAREN { $2 }
| NEW QUEUE DOUBLECOL typ LPAREN actuals_opt RPAREN { QueueLit($4, $6) }
| NEW LINKEDLIST DOUBLECOL typ LPAREN actuals_opt RPAREN { LinkedListLit($4, $6) }
| NEW STACK DOUBLECOL typ LPAREN actuals_opt RPAREN { StackLit($4, $6) }
| NEW BSTREE DOUBLECOL typ LPAREN actuals_opt RPAREN { BSTreeLit($4, $6) }
literal:
STRING_LITERAL { StringLit($1) }
| ID { Id($1) }
| INT_LITERAL { IntLit($1) }
| NUM_LITERAL { NumLit($1) }
| TRUE { BoolLit(true) }
| FALSE { BoolLit(false) }
| NULL { Null }
actuals_opt:
/* nothing */ { [] }
| actuals_list { List.rev $1 }
actuals_list:
expr { [$1] }
| actuals_list COMMA expr { $3 :: $1 }