251 lines
7 KiB
OCaml
251 lines
7 KiB
OCaml
%{
|
|
|
|
open Signature
|
|
open Names
|
|
open Ident
|
|
open Types
|
|
open Location
|
|
open Minils
|
|
open Mls_utils
|
|
|
|
|
|
%}
|
|
|
|
%token DOT LPAREN RPAREN LBRACE RBRACE COLON SEMICOL
|
|
%token EQUAL EQUALEQUAL BARBAR COMMA BAR LET TEL
|
|
%token <string> CONSTRUCTOR
|
|
%token <string> NAME
|
|
%token <int> INT
|
|
%token <float> FLOAT
|
|
%token <bool> BOOL
|
|
%token <string * string> PRAGMA
|
|
%token TYPE NODE RETURNS VAR OPEN
|
|
%token FBY PRE WHEN
|
|
%token OR STAR NOT
|
|
%token AMPERSAND
|
|
%token AMPERAMPER
|
|
%token RESET
|
|
%token IF THEN ELSE
|
|
%token DOUBLE_LESS DOUBLE_GREATER
|
|
%token ARROW
|
|
%token MERGE
|
|
%token POWER
|
|
%token AROBASE
|
|
%token WITH
|
|
%token DOTDOT
|
|
%token DEFAULT
|
|
%token LBRACKET RBRACKET
|
|
%token MAP FOLD MAPFOLD
|
|
%token <string> PREFIX
|
|
%token <string> INFIX0
|
|
%token <string> INFIX1
|
|
%token <string> INFIX2
|
|
%token <string> SUBTRACTIVE
|
|
%token <string> INFIX3
|
|
%token <string> INFIX4
|
|
%token EOF
|
|
|
|
%right AROBASE
|
|
%left ELSE
|
|
%left OR
|
|
%left AMPERSAND
|
|
%left INFIX0 EQUAL
|
|
%right INFIX1 EQUALEQUAL BARBAR AMPERAMPER
|
|
%left INFIX2 prefixs
|
|
%left STAR INFIX3
|
|
%left INFIX4
|
|
%left WHEN
|
|
%right FBY
|
|
%right PRE
|
|
%right POWER
|
|
|
|
|
|
%start program
|
|
%type <Minils.program> program
|
|
|
|
%%
|
|
|
|
/** Tools **/
|
|
%inline slist(S, x) : l=separated_list(S, x) {l}
|
|
%inline snlist(S, x) : l=separated_nonempty_list(S, x) {l}
|
|
%inline tuple(x) : LPAREN h=x COMMA t=snlist(COMMA,x) RPAREN { h::t }
|
|
%inline option(P,x):
|
|
|/* empty */ { None }
|
|
| P v=x { Some(v) }
|
|
|
|
qualified(x) :
|
|
| n=x { Name(n) }
|
|
| m=CONSTRUCTOR DOT n=x { Modname({ qual = m; id = n }) }
|
|
|
|
structure(field): LBRACE s=snlist(SEMICOL,field) RBRACE {s}
|
|
|
|
localize(x): y=x { y, (Loc($startpos(y),$endpos(y))) }
|
|
|
|
|
|
program:
|
|
| pragma_headers open_modules type_decs node_decs EOF /*TODO const decs */
|
|
{{ p_pragmas = List.rev $1;
|
|
p_opened = List.rev $2;
|
|
p_types = $3;
|
|
p_nodes = $4;
|
|
p_consts = []}} /*TODO consts dans program*/
|
|
|
|
pragma_headers: l=list(PRAGMA) {l}
|
|
|
|
open_modules: l=list(opens) {l}
|
|
opens: OPEN c=CONSTRUCTOR {c}
|
|
|
|
name: n=NAME | LPAREN n=infix_ RPAREN | LPAREN n=prefix_ RPAREN { n }
|
|
ident: n=name { ident_of_name n }
|
|
|
|
field_type : n=NAME COLON t=type_ident { mk_field n t }
|
|
|
|
type_ident: NAME { Tid(Name($1)) }
|
|
|
|
type_decs: t=list(type_dec) {t}
|
|
type_dec:
|
|
| TYPE n=NAME
|
|
{ mk_type_dec ~loc:(Loc ($startpos,$endpos)) ~type_desc:Type_abs n }
|
|
| TYPE n=NAME EQUAL e=snlist(BAR,NAME)
|
|
{ mk_type_dec ~loc:(Loc ($startpos,$endpos)) ~type_desc:(Type_enum e) n }
|
|
| TYPE n=NAME EQUAL s=structure(field_type)
|
|
{ mk_type_dec ~loc:(Loc ($startpos,$endpos)) ~type_desc:(Type_struct s) n }
|
|
|
|
node_decs: ns=list(node_dec) {ns}
|
|
node_dec:
|
|
NODE n=name p=params(n_param) LPAREN args=args RPAREN
|
|
RETURNS LPAREN out=args RPAREN vars=loc_vars eqs=equs
|
|
{ mk_node ~input:args ~output:out ~local:vars
|
|
~eq:eqs ~loc:(Loc ($startpos,$endpos)) n }
|
|
|
|
|
|
args_t: SEMICOL p=args {p}
|
|
args:
|
|
| /* empty */ {[]}
|
|
| h=var t=loption(args_t) {h@t}
|
|
|
|
loc_vars_t: SEMICOL h=var t=loc_vars_t {h@t}
|
|
loc_vars_h: VAR h=var t=loc_vars_t {h@t}
|
|
loc_vars: l=loption(loc_vars_h) {l}
|
|
|
|
var:
|
|
| ns=snlist(COMMA, NAME) COLON t=type_ident
|
|
{ List.map (fun id -> mk_var_dec (ident_of_name id) t) ns }
|
|
|
|
equs: LET e=slist(SEMICOL, equ) TEL { e }
|
|
equ: p=pat EQUAL e=exp { mk_equation ~loc:(Loc ($startpos,$endpos)) p e }
|
|
|
|
pat:
|
|
| n=NAME {Evarpat (ident_of_name n)}
|
|
| LPAREN p=snlist(COMMA, pat) RPAREN {Etuplepat p}
|
|
|
|
longname: l=qualified(name) {l} /* qualified var (not a constructor) */
|
|
|
|
constructor: /* of type longname */
|
|
| ln=qualified(CONSTRUCTOR) {ln}
|
|
| b=BOOL { Name(if b then "true" else "false") }
|
|
|
|
const:
|
|
| INT { Cint($1) }
|
|
| FLOAT { Cfloat($1) }
|
|
| constructor { Cconstr($1) }
|
|
|
|
exps: LPAREN e=slist(COMMA, exp) RPAREN {e}
|
|
|
|
field_exp: longname EQUAL exp { ($1, $3) }
|
|
|
|
simple_exp:
|
|
| e=_simple_exp {mk_exp e ~loc:(Loc ($startpos,$endpos)) }
|
|
_simple_exp:
|
|
| NAME { Evar (ident_of_name $1) }
|
|
| s=structure(field_exp) { Estruct s }
|
|
| t=tuple(exp) { Eapp(mk_op ~op_kind:Etuple, t, None) }
|
|
| LPAREN e=_exp RPAREN { e }
|
|
|
|
|
|
exp:
|
|
| e=simple_exp { e }
|
|
| e=_exp { mk_exp e ~loc:(Loc ($startpos,$endpos)) }
|
|
_exp:
|
|
| e=simple_exp { e }
|
|
| c=const { Econst c }
|
|
| const FBY exp { Efby(Some($1),$3) }
|
|
| PRE exp { Efby(None,$2) }
|
|
| op=funop a=exps r=reset { Ecall(op, a, r) }
|
|
| e1=exp i_op=infix e2=exp
|
|
{ Eapp(mk_op ~op_kind:Efun i_op, [e1; e2], None) }
|
|
| p_op=prefix e=exp %prec prefixs
|
|
{ Eapp(mk_op ~op_kind:Efun p_op, [e], None) }
|
|
| IF e1=exp THEN e2=exp ELSE e3=exp { Eifthenelse(e1, e2, e3) }
|
|
| e=simple_exp DOT m=longname { Efield(e, m) }
|
|
| e=exp WHEN c=constructor LPAREN n=ident RPAREN
|
|
{ Ewhen(e, c, n) }
|
|
| MERGE n=ident h=handlers { Emerge(n, h) }
|
|
| LPAREN r=exp WITH DOT ln=longname EQUAL nv=exp
|
|
{ Efield_update(ln, r, nv) }
|
|
| op=array_op { Earray_op op }
|
|
| LBRACKET es=slist(COMMA, exp) RBRACKET { Earray es }
|
|
|
|
array_op:
|
|
| e=exp POWER p=e_param { Erepeat(p, e) }
|
|
| e=simple_exp i=indexes(e_param) { Eselect(i, e) }
|
|
| e=exp i=indexes(exp) DEFAULT d=exp { Eselect_dyn(i, e ,d) }
|
|
| LPAREN e=exp WITH i=indexes(e_param) EQUAL nv=exp { Eupdate(i, e, nv) }
|
|
| e=simple_exp LBRACKET i1=e_param DOTDOT i2=e_param RBRACKET
|
|
{ Eselect_slice(i1, i2, e) }
|
|
| e1=exp AROBASE e2=exp { Econcat(e1,e2) }
|
|
| LPAREN f=iterator LPAREN op=funop RPAREN
|
|
DOUBLE_LESS p=e_param DOUBLE_GREATER
|
|
RPAREN a=exps r=reset { Eiterator(f,op,p,a,r) }
|
|
|
|
/* Static indexes [p1][p2]... */
|
|
indexes(param): is=nonempty_list(index(param)) { is }
|
|
index(param): LBRACKET p=param RBRACKET { p }
|
|
|
|
|
|
|
|
|
|
/* Merge handlers ( B -> e)( C -> ec)... */
|
|
handlers: hs=nonempty_list(handler) { hs }
|
|
handler: LPAREN c=constructor ARROW e=exp RPAREN { c,e }
|
|
|
|
|
|
iterator:
|
|
| MAP { Imap }
|
|
| FOLD { Ifold }
|
|
| MAPFOLD { Imapfold }
|
|
|
|
reset: r=option(RESET,ident) { r }
|
|
|
|
funop: ln=longname p=params(e_param) { mk_op ~op_kind:Enode ~op_params:p ln }
|
|
|
|
|
|
e_param: e=exp { static_exp_of_exp e }
|
|
n_param: n=NAME { mk_param n }
|
|
params(param):
|
|
| /*empty*/ { [] }
|
|
| DOUBLE_LESS p=slist(COMMA, param) DOUBLE_GREATER { p }
|
|
|
|
|
|
/*Inlining is compulsory in order to preserve priorities*/
|
|
%inline infix: op=infix_ { Name(op) }
|
|
%inline infix_:
|
|
| op=INFIX0 | op=INFIX1 | op=INFIX2 | op=INFIX3 | op=INFIX4 { op }
|
|
| STAR { "*" }
|
|
| EQUAL { "=" }
|
|
| EQUALEQUAL { "==" }
|
|
| AMPERSAND { "&" } | AMPERAMPER { "&&" }
|
|
| OR { "or" } | BARBAR { "||" }
|
|
|
|
prefix: op=prefix_ { Name(op) }
|
|
prefix_:
|
|
| op = PREFIX { op }
|
|
| NOT { "not" }
|
|
| op = SUBTRACTIVE { "~" ^ op } /*TODO test 3 * -2 and co */
|
|
|
|
|
|
|
|
|
|
|
|
%%
|