Symbolic link as as I did are a bad idea. I will synchronise them
using git subtrees or submodules latter, as explained here:

http://www.elegantchaos.com/node/432
http://www.elegantchaos.com/high-level-git-subtree-scripts

Also Merge the Global and the MainArg module as they were
(bizzarely) both handling command args options.

I took the data type definition from SocExecValue to define a Data
module that is a strict extension of the Lutin Data module.

The duplicated Genlex module is now also identical to the one of
Lurette.

Quite boring, but simple thanks to the ocaml type system.

Now the arrow in handled as a predef statement; in order to know
if we are at the first step of a node, we do as for condact and
store the value of the first_step var in the current ctx.

In order to do that, I've generalised the type of merge : now the clock
argument can be any expression. Some assert false still prevent its use,
but it should be easy to get rid of them (I'll do that latter).

In order to do that, I've generalised the type of merge : now the clock
argument can be any expression. Some assert false still prevent its use,
but it should be easy to get rid of them (I'll do that latter).

nb : programs do run, but I did not check that they run correctly...

Also fix a regression introduced in the previous change where
incorrect ec code was generated for diese.

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

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

F**k! socExec.ml was not gitted!!!

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.

Can be tried unsing the -exec option.

currently only working with trivial programs manipulating equalities
(wires) and predef operators (no pre, ->, arrays, and node calls).

Indeed, the data structure in output of the lis2loc parser was very
similar to Lic.t/LicPrg.t. Hence, this shunt.

At this stage it compiles, but it's untested and does not work.

BTW, put everything that concerns node environement into the new
IdSolver module (from the Lic module).

Indeed, part of licDump was done in lic, but that part should
not depend in the compil option.

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!

 - translate merge on bools in terms of current and ite
 - do not print the clock info in node profile in en mode

+ various fixes in lustre test files.

nb : now all tests in the should_work dir passes !!!