nb : i have changed the var name in the generated nodes, which was a bad idea
(=painful to get it rigth again).

The bug was appearing a node was called on a non base clock that was
existing in the called nodes (name clash). Typically, it occurs on
recursive node called on some non-trivial clocks.

Also, use maps instead of list to hold the substitution between
params and args.

Ditto for Misc and Compile

Indeed, having two different mechanisms is bad.

In the end, I've kept mine (and not the one of Pascal), because the
it was depending on LicPrg.t, which was creating a circular dep
(which could of course be fixed, but I am lazy).

The translation was faithfull to the comment, but the comment was wrong :
in order to translate a condact, we need clocks (when) !

node condact_toto(i0:bool; i1:int; i2:int) returns (o0:int) = Lustre::condact<<toto, 0>>;

is now translated into:

condact_toto(i0:bool; i1:int; i2:int) returns (o0:int)
let
  o0 = if i0 then current(toto(i1 when i0, i2 when i0) ) else (0 fby o0);
tel

Some generated intermediary variables where declared as int instead
of bool.  Funnily, ecexe was ok with that...

More precisely, it was always returning the default value when the
activation condition was false instead of returning "dft_val fby out".

Actually, it was a misunderstanding of mine (R1) ; the behavior was consistent
with the lv6 doc, but not with the v4 behavior...

Indeed, # means "at most 1 among n", not "exactly one among n" as I tought...

As far as ldbg is concerned, it only traces the toplevel node, at
call event.

Note that I needed to rename quite a lot of modules to avoid name clashes
between lus2lic.a and ltop.

I've also merged the Verbose module with the one of Lutin so that
they can be shared (there were sharing 95% already).

nb: thus it works with red and fill since they are exactly the same !!!

1) At the Lic level, there's no reason to distinguish betwenn node
calls, and predef node calls. Indeed it makes things simpler and more
homogeneous afterwards.

2) int strings are only converted when necessary (constant evaluation).

3) const are handled directly under Lic.by_pos_op instead of being under
   PREDEF_CALL, which make things easier and more logical.

Pascal prepared « the field » for that change.

The only culprit was the one in unifyClock.ml::249, but
I've lazyfied most of the non-trivial verbose call.

The 2 remaining unresolved testq that were timeout-ing now pass in a few ms...

The whole non-reg test time has been divided by more than 2!

Also fix some bugs in DumpLic when printing condact in other modes.

Also call L2lCheckOutputs.check_node for all compiled nodes at the end
of all the l2l transfo.