628 lines
14 KiB
OCaml
628 lines
14 KiB
OCaml
|
%{
|
||
|
(* START HEADER *)
|
||
|
|
||
|
open Region
|
||
|
open AST
|
||
|
|
||
|
(* END HEADER *)
|
||
|
%}
|
||
|
|
||
|
(* Entry points *)
|
||
|
|
||
|
%start program
|
||
|
%type <AST.t> program
|
||
|
|
||
|
%%
|
||
|
|
||
|
(* RULES *)
|
||
|
|
||
|
(* Compound constructs *)
|
||
|
|
||
|
par(X):
|
||
|
LPAR X RPAR {
|
||
|
let region = cover $1 $3
|
||
|
in {region; value = $1,$2,$3}
|
||
|
}
|
||
|
|
||
|
braces(X):
|
||
|
LBRACE X RBRACE {
|
||
|
let region = cover $1 $3
|
||
|
in {region; value = $1,$2,$3}
|
||
|
}
|
||
|
|
||
|
brackets(X):
|
||
|
LBRACKET X RBRACKET {
|
||
|
let region = cover $1 $3
|
||
|
in {region; value = $1,$2,$3}
|
||
|
}
|
||
|
|
||
|
(* Sequences
|
||
|
|
||
|
Series of instances of the same syntactical category have often to
|
||
|
be parsed, like lists of expressions, patterns etc. The simplest of
|
||
|
all is the possibly empty sequence (series), parsed below by
|
||
|
[seq]. The non-empty sequence is parsed by [nseq]. Note that the
|
||
|
latter returns a pair made of the first parsed item (the parameter
|
||
|
[X]) and the rest of the sequence (possibly empty). This way, the
|
||
|
OCaml typechecker can keep track of this information along the
|
||
|
static control-flow graph. The rule [sepseq] parses possibly empty
|
||
|
sequences of items separated by some token (e.g., a comma), and
|
||
|
rule [nsepseq] is for non-empty such sequences. See module [Utils]
|
||
|
for the types corresponding to the semantic actions of those rules.
|
||
|
*)
|
||
|
|
||
|
(* Possibly empty sequence of items *)
|
||
|
|
||
|
seq(X):
|
||
|
(**) { [] }
|
||
|
| X seq(X) { $1::$2 }
|
||
|
|
||
|
(* Non-empty sequence of items *)
|
||
|
|
||
|
nseq(X):
|
||
|
X seq(X) { $1,$2 }
|
||
|
|
||
|
(* Non-empty separated sequence of items *)
|
||
|
|
||
|
nsepseq(X,Sep):
|
||
|
X { $1, [] }
|
||
|
| X Sep nsepseq(X,Sep) { let h,t = $3 in $1, ($2,h)::t }
|
||
|
|
||
|
(* Possibly empy separated sequence of items *)
|
||
|
|
||
|
sepseq(X,Sep):
|
||
|
(**) { None }
|
||
|
| nsepseq(X,Sep) { Some $1 }
|
||
|
|
||
|
(* Inlines *)
|
||
|
|
||
|
%inline var : Ident { $1 }
|
||
|
%inline type_name : Ident { $1 }
|
||
|
%inline fun_name : Ident { $1 }
|
||
|
%inline field_name : Ident { $1 }
|
||
|
%inline map_name : Ident { $1 }
|
||
|
|
||
|
(* Main *)
|
||
|
|
||
|
program:
|
||
|
seq(type_decl)
|
||
|
parameter_decl
|
||
|
storage_decl
|
||
|
operations_decl
|
||
|
seq(lambda_decl)
|
||
|
block
|
||
|
EOF {
|
||
|
object
|
||
|
method types = $1
|
||
|
method parameter = $2
|
||
|
method storage = $3
|
||
|
method operations = $4
|
||
|
method lambdas = $5
|
||
|
method block = $6
|
||
|
method eof = $7
|
||
|
end
|
||
|
}
|
||
|
|
||
|
parameter_decl:
|
||
|
Parameter var COLON type_expr {
|
||
|
let stop = type_expr_to_region $4
|
||
|
in {region = cover $1 stop;
|
||
|
value = $1,$2,$3,$4}
|
||
|
}
|
||
|
|
||
|
storage_decl:
|
||
|
Storage type_expr {
|
||
|
let stop = type_expr_to_region $2
|
||
|
in {region = cover $1 stop;
|
||
|
value = $1,$2}
|
||
|
}
|
||
|
|
||
|
operations_decl:
|
||
|
Operations type_expr {
|
||
|
let stop = type_expr_to_region $2
|
||
|
in {region = cover $1 stop;
|
||
|
value = $1,$2}
|
||
|
}
|
||
|
|
||
|
(* Type declarations *)
|
||
|
|
||
|
type_decl:
|
||
|
Type type_name Is type_expr {
|
||
|
{region = cover $1 (type_expr_to_region $4);
|
||
|
value = $1,$2,$3,$4}
|
||
|
}
|
||
|
|
||
|
type_expr:
|
||
|
cartesian { Prod $1 }
|
||
|
| sum_type { Sum $1 }
|
||
|
| record_type { Record $1 }
|
||
|
|
||
|
cartesian:
|
||
|
nsepseq(core_type,TIMES) {
|
||
|
let region = nsepseq_to_region type_expr_to_region $1
|
||
|
in {region; value=$1}
|
||
|
}
|
||
|
|
||
|
core_type:
|
||
|
type_name {
|
||
|
TAlias $1
|
||
|
}
|
||
|
| type_name type_tuple {
|
||
|
let region = cover $1.region $2.region
|
||
|
in TypeApp {region; value = $1,$2}
|
||
|
}
|
||
|
| par(type_expr) {
|
||
|
ParType $1
|
||
|
}
|
||
|
|
||
|
type_tuple:
|
||
|
par(nsepseq(type_name,COMMA)) { $1 }
|
||
|
|
||
|
sum_type:
|
||
|
nsepseq(variant,VBAR) {
|
||
|
let region = nsepseq_to_region (fun x -> x.region) $1
|
||
|
in {region; value=$1}
|
||
|
}
|
||
|
|
||
|
variant:
|
||
|
Constr Of cartesian {
|
||
|
let region = cover $1.region $3.region
|
||
|
in {region; value = $1,$2,$3}
|
||
|
}
|
||
|
|
||
|
record_type:
|
||
|
Record
|
||
|
nsepseq(field_decl,SEMI)
|
||
|
End {
|
||
|
let region = cover $1 $3
|
||
|
in {region; value = $1,$2,$3}
|
||
|
}
|
||
|
|
||
|
field_decl:
|
||
|
field_name COLON type_expr {
|
||
|
let stop = type_expr_to_region $3 in
|
||
|
let region = cover $1.region stop
|
||
|
in {region; value = $1,$2,$3}
|
||
|
}
|
||
|
|
||
|
(* Function and procedure declarations *)
|
||
|
|
||
|
lambda_decl:
|
||
|
fun_decl { FunDecl $1 }
|
||
|
| proc_decl { ProcDecl $1 }
|
||
|
|
||
|
fun_decl:
|
||
|
Function fun_name parameters COLON type_expr Is
|
||
|
block
|
||
|
With expr {
|
||
|
let region = cover $1 (expr_to_region $9) in
|
||
|
let value =
|
||
|
object
|
||
|
method kwd_function = $1
|
||
|
method var = $2
|
||
|
method param = $3
|
||
|
method colon = $4
|
||
|
method ret_type = $5
|
||
|
method kwd_is = $6
|
||
|
method body = $7
|
||
|
method kwd_with = $8
|
||
|
method return = $9
|
||
|
end
|
||
|
in {region; value}
|
||
|
}
|
||
|
|
||
|
proc_decl:
|
||
|
Procedure fun_name parameters Is
|
||
|
block {
|
||
|
let region = cover $1 $5.region in
|
||
|
let value =
|
||
|
object
|
||
|
method kwd_procedure = $1
|
||
|
method var = $2
|
||
|
method param = $3
|
||
|
method kwd_is = $4
|
||
|
method body = $5
|
||
|
end
|
||
|
in {region; value}
|
||
|
}
|
||
|
|
||
|
parameters:
|
||
|
par(nsepseq(param_decl,SEMI)) { $1 }
|
||
|
|
||
|
param_decl:
|
||
|
var_kind var COLON type_expr {
|
||
|
let start = var_kind_to_region $1 in
|
||
|
let stop = type_expr_to_region $4 in
|
||
|
let region = cover start stop
|
||
|
in {region; value = $1,$2,$3,$4}
|
||
|
}
|
||
|
|
||
|
var_kind:
|
||
|
Var { Mutable $1 }
|
||
|
| Const { Const $1 }
|
||
|
|
||
|
block:
|
||
|
value_decls
|
||
|
Begin
|
||
|
instructions
|
||
|
End {
|
||
|
let region = cover $1.region $4 in
|
||
|
let value =
|
||
|
object
|
||
|
method decls = $1
|
||
|
method opening = $2
|
||
|
method instr = $3
|
||
|
method close = $4
|
||
|
end
|
||
|
in {region; value}
|
||
|
}
|
||
|
|
||
|
value_decls:
|
||
|
sepseq(var_decl,SEMI) {
|
||
|
let region = sepseq_to_region (fun x -> x.region) $1
|
||
|
in {region; value=$1}
|
||
|
}
|
||
|
|
||
|
var_decl:
|
||
|
Var var COLON type_expr ASGNMNT expr {
|
||
|
let region = cover $1 (expr_to_region $6) in
|
||
|
let value =
|
||
|
object
|
||
|
method kind = Mutable $1
|
||
|
method var = $2
|
||
|
method colon = $3
|
||
|
method vtype = $4
|
||
|
method setter = $5
|
||
|
method init = $6
|
||
|
end
|
||
|
in {region; value}
|
||
|
}
|
||
|
| Const var COLON type_expr EQUAL expr {
|
||
|
let region = cover $1 (expr_to_region $6) in
|
||
|
let value =
|
||
|
object
|
||
|
method kind = Const $1
|
||
|
method var = $2
|
||
|
method colon = $3
|
||
|
method vtype = $4
|
||
|
method setter = $5
|
||
|
method init = $6
|
||
|
end
|
||
|
in {region; value}
|
||
|
}
|
||
|
|
||
|
instructions:
|
||
|
nsepseq(instruction,SEMI) {
|
||
|
let region = nsepseq_to_region instr_to_region $1
|
||
|
in {region; value=$1}
|
||
|
}
|
||
|
|
||
|
instruction:
|
||
|
single_instr { Single $1 }
|
||
|
| block { Block $1 }
|
||
|
|
||
|
single_instr:
|
||
|
conditional { Cond $1 }
|
||
|
| match_instr { Match $1 }
|
||
|
| asgnmnt { Asgnmnt $1 }
|
||
|
| loop { Loop $1 }
|
||
|
| proc_call { ProcCall $1 }
|
||
|
| Null { Null $1 }
|
||
|
|
||
|
proc_call:
|
||
|
fun_call { $1 }
|
||
|
|
||
|
conditional:
|
||
|
If expr Then instruction Else instruction {
|
||
|
let region = cover $1 (instr_to_region $6) in
|
||
|
let value =
|
||
|
object
|
||
|
method kwd_if = $1
|
||
|
method test = $2
|
||
|
method kwd_then = $3
|
||
|
method ifso = $4
|
||
|
method kwd_else = $5
|
||
|
method ifnot = $6
|
||
|
end
|
||
|
in {region; value}
|
||
|
}
|
||
|
|
||
|
match_instr:
|
||
|
Match expr With cases End {
|
||
|
let region = cover $1 $5 in
|
||
|
let value =
|
||
|
object
|
||
|
method kwd_match = $1
|
||
|
method expr = $2
|
||
|
method kwd_with = $3
|
||
|
method cases = $4
|
||
|
method kwd_end = $5
|
||
|
end
|
||
|
in {region; value}
|
||
|
}
|
||
|
|
||
|
cases:
|
||
|
nsepseq(case,VBAR) {
|
||
|
let region = nsepseq_to_region (fun x -> x.region) $1
|
||
|
in {region; value=$1}
|
||
|
}
|
||
|
|
||
|
case:
|
||
|
pattern ARROW instruction {
|
||
|
let region = cover $1.region (instr_to_region $3)
|
||
|
in {region; value = $1,$2,$3}
|
||
|
}
|
||
|
|
||
|
asgnmnt:
|
||
|
var ASGNMNT expr {
|
||
|
let region = cover $1.region (expr_to_region $3)
|
||
|
in {region; value = $1,$2,$3}
|
||
|
}
|
||
|
|
||
|
loop:
|
||
|
while_loop { $1 }
|
||
|
| for_loop { $1 }
|
||
|
|
||
|
while_loop:
|
||
|
While expr block {
|
||
|
let region = cover $1 $3.region
|
||
|
in While {region; value=$1,$2,$3}
|
||
|
}
|
||
|
|
||
|
for_loop:
|
||
|
For asgnmnt Down? To expr option(step_clause) block {
|
||
|
let region = cover $1 $7.region in
|
||
|
let value =
|
||
|
object
|
||
|
method kwd_for = $1
|
||
|
method asgnmnt = $2
|
||
|
method down = $3
|
||
|
method kwd_to = $4
|
||
|
method bound = $5
|
||
|
method step = $6
|
||
|
method block = $7
|
||
|
end
|
||
|
in For (ForInt {region; value})
|
||
|
}
|
||
|
|
||
|
| For var option(arrow_clause) In expr block {
|
||
|
let region = cover $1 $6.region in
|
||
|
let value =
|
||
|
object
|
||
|
method kwd_for = $1
|
||
|
method var = $2
|
||
|
method bind_to = $3
|
||
|
method kwd_in = $4
|
||
|
method expr = $5
|
||
|
method block = $6
|
||
|
end
|
||
|
in For (ForCollect {region; value})
|
||
|
}
|
||
|
|
||
|
step_clause:
|
||
|
Step expr { $1,$2 }
|
||
|
|
||
|
arrow_clause:
|
||
|
ARROW var { $1,$2 }
|
||
|
|
||
|
(* Expressions *)
|
||
|
|
||
|
expr:
|
||
|
expr OR conj_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Or {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| conj_expr { $1 }
|
||
|
|
||
|
conj_expr:
|
||
|
conj_expr AND comp_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
And {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| comp_expr { $1 }
|
||
|
|
||
|
comp_expr:
|
||
|
comp_expr LT cat_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Lt {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| comp_expr LEQ cat_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Leq {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| comp_expr GT cat_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Gt {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| comp_expr GEQ cat_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Geq {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| comp_expr EQUAL cat_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Equal {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| comp_expr NEQ cat_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Neq {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| cat_expr { $1 }
|
||
|
|
||
|
cat_expr:
|
||
|
cons_expr CAT cat_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Cat {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| cons_expr { $1 }
|
||
|
|
||
|
cons_expr:
|
||
|
add_expr CONS cons_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Cons {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| add_expr { $1 }
|
||
|
|
||
|
add_expr:
|
||
|
add_expr PLUS mult_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Add {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| add_expr MINUS mult_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Sub {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| mult_expr { $1 }
|
||
|
|
||
|
mult_expr:
|
||
|
mult_expr TIMES unary_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Mult {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| mult_expr SLASH unary_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Div {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| mult_expr Mod unary_expr {
|
||
|
let start = expr_to_region $1
|
||
|
and stop = expr_to_region $3 in
|
||
|
let region = cover start stop in
|
||
|
Mod {region; value = $1,$2,$3}
|
||
|
}
|
||
|
| unary_expr { $1 }
|
||
|
|
||
|
unary_expr:
|
||
|
MINUS core_expr {
|
||
|
let stop = expr_to_region $2 in
|
||
|
let region = cover $1 stop in
|
||
|
Neg {region; value = $1,$2}
|
||
|
}
|
||
|
| Not core_expr {
|
||
|
let stop = expr_to_region $2 in
|
||
|
let region = cover $1 stop in
|
||
|
Not {region; value = $1,$2}
|
||
|
}
|
||
|
| core_expr { $1 }
|
||
|
|
||
|
core_expr:
|
||
|
Int { Int $1 }
|
||
|
| var { Var $1 }
|
||
|
| String { String $1 }
|
||
|
| Bytes { Bytes $1 }
|
||
|
| C_False { False $1 }
|
||
|
| C_True { True $1 }
|
||
|
| C_Unit { Unit $1 }
|
||
|
| tuple { Tuple $1 }
|
||
|
| list_expr { List $1 }
|
||
|
| empty_list { EmptyList $1 }
|
||
|
| set_expr { Set $1 }
|
||
|
| empty_set { EmptySet $1 }
|
||
|
| none_expr { NoneExpr $1 }
|
||
|
| fun_call { FunCall $1 }
|
||
|
| Constr arguments {
|
||
|
let region = cover $1.region $2.region in
|
||
|
ConstrApp {region; value = $1,$2}
|
||
|
}
|
||
|
| C_Some arguments {
|
||
|
let region = cover $1 $2.region in
|
||
|
SomeApp {region; value = $1,$2}
|
||
|
}
|
||
|
| map_name DOT brackets(expr) {
|
||
|
let region = cover $1.region $3.region in
|
||
|
let value =
|
||
|
object
|
||
|
method map_name = $1
|
||
|
method selector = $2
|
||
|
method index = $3
|
||
|
end
|
||
|
in MapLookUp {region; value}
|
||
|
}
|
||
|
|
||
|
fun_call:
|
||
|
fun_name arguments {
|
||
|
let region = cover $1.region $2.region
|
||
|
in {region; value = $1,$2}
|
||
|
}
|
||
|
|
||
|
tuple:
|
||
|
par(nsepseq(expr,COMMA)) { $1 }
|
||
|
|
||
|
arguments:
|
||
|
tuple { $1 }
|
||
|
|
||
|
list_expr:
|
||
|
brackets(nsepseq(expr,COMMA)) { $1 }
|
||
|
|
||
|
empty_list:
|
||
|
par(LBRACKET RBRACKET COLON type_expr { $1,$2,$3,$4 }) { $1 }
|
||
|
|
||
|
set_expr:
|
||
|
braces(nsepseq(expr,COMMA)) { $1 }
|
||
|
|
||
|
empty_set:
|
||
|
par(LBRACE RBRACE COLON type_expr { $1,$2,$3,$4 }) { $1 }
|
||
|
|
||
|
none_expr:
|
||
|
par(C_None COLON type_expr { $1,$2,$3 }) { $1 }
|
||
|
|
||
|
(* Patterns *)
|
||
|
|
||
|
pattern:
|
||
|
nsepseq(core_pattern,CONS) {
|
||
|
let region = nsepseq_to_region core_pattern_to_region $1
|
||
|
in {region; value=$1}
|
||
|
}
|
||
|
|
||
|
core_pattern:
|
||
|
var { PVar $1 }
|
||
|
| WILD { PWild $1 }
|
||
|
| Int { PInt $1 }
|
||
|
| String { PString $1 }
|
||
|
| C_Unit { PUnit $1 }
|
||
|
| C_False { PFalse $1 }
|
||
|
| C_True { PTrue $1 }
|
||
|
| C_None { PNone $1 }
|
||
|
| list_patt { PList $1 }
|
||
|
| tuple_patt { PTuple $1 }
|
||
|
| C_Some par(core_pattern) {
|
||
|
let region = cover $1 $2.region
|
||
|
in PSome {region; value = $1,$2}
|
||
|
}
|
||
|
|
||
|
list_patt:
|
||
|
brackets(sepseq(core_pattern,COMMA)) { Sugar $1 }
|
||
|
| par(cons_pattern) { Raw $1 }
|
||
|
|
||
|
cons_pattern:
|
||
|
core_pattern CONS pattern { $1,$2,$3 }
|
||
|
|
||
|
tuple_patt:
|
||
|
par(nsepseq(core_pattern,COMMA)) { $1 }
|