Benjamin_Loison/Synchronous_reactive_systems
1
0
Fork 0
Code Issues 7 Pull Requests Packages Projects Releases Wiki Activity

Correct typos in src/passes.ml and src/test.node

Browse Source
This commit is contained in:
Benjamin Loison 2022-12-15 20:13:18 +01:00
parent 72ba196142
commit ca271eaf66
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/passes.ml
View File

@ -89,7 +89,7 @@ let chkvar_init_unicity verbose debug main_fn : t_nodelist -> t_nodelist option
let aux (node: t_node) : t_node option = let aux (node: t_node) : t_node option =
let incr_aux h n = let incr_aux h n =
match Hashtbl.find_opt h n with match Hashtbl.find_opt h n with
| None -> failwith "todo, should not happend." | None -> failwith "todo, should not happened."
| Some num -> Hashtbl.replace h n (num + 1) | Some num -> Hashtbl.replace h n (num + 1)
in in
let incr_eq h (((_, patt), _): t_equation) = let incr_eq h (((_, patt), _): t_equation) =
@ -109,7 +109,7 @@ let aux (node: t_node) : t_node option =
Hashtbl.iter Hashtbl.iter
(fun varname num' -> (fun varname num' ->
match Hashtbl.find_opt acc varname with match Hashtbl.find_opt acc varname with
| None -> failwith "non!" | None -> failwith "no!"
| Some num -> Hashtbl.replace acc varname (Int.max num num') | Some num -> Hashtbl.replace acc varname (Int.max num num')
) h_st) states; ) h_st) states;
Hashtbl.iter (fun v n -> Hashtbl.replace h v n) acc Hashtbl.iter (fun v n -> Hashtbl.replace h v n) acc

2
src/test.node
View File

@ -1,5 +1,5 @@
node diagonal_int (i: int) returns (o1, o2 : int); node diagonal_int (i: int) returns (o1, o2 : int);
let i: int; var i: int;
let let
(o1, o2) = (i, i); (o1, o2) = (i, i);
tel tel