as many  new local  variables as necessary  so that an  expression is
made at most of one operator.

The rational  for that  is to obtain  a lic  code that is  trivial to
clock check (nested node calls, for example, make it less simple).

The old behavior can still be obtained using --keep-nested-calls.

During  that  change,   I  realised  that  I  did   not  clock  check
asserts. Hence, I have also added this check.

to avoid name clashes in the lic.

behaves in the same manner on all configurations.

account into the expected output of the non-reg tests.

it breaks non-reg tests when executed in the original directory.

test/should_work/Pascal/t1.lus

+ typos

lexing nightmares in lic2loc.

to avoid priority errors.

iterators (e.g.,  "Lustre::plus" instead of "Lustre::+")  in order to
make the life of lic3loc easier.

to avoid priority errors.

to avoid priority errors.

to avoid priority errors.

parenthesis, but after an equal sign, as in lv6.

profiles constain only named types.

Typically, instead of printing:

           node toto(x: int ^ 4) ...

print something like :

           type int4 = int ^ 4
           node toto(x: int4) ...

Moreover, in  order to  avoid name clashes,  we prefix all  user name
type by "_".

e.g., instead of

        type toto = toto { ... };

we now print

        type toto = struct { ... };

Add some tests with various kinds of expr that we can have after a when.

PredefEvelClock, in a similar manner as for type checking.

clock_info, and  therefore also  remove clock_info. The  rationale of
this  change is  that  it  makes things  slightly  simpler, and  more
homogeneous with what is done in type checking.

Not yet implemented (assert false): iterators, struct

Add a UnifyClock module, and rename Unify into UnifyType.

nb : a lot of test are now broken, because
   - the clock checking is now plugged ;-)
   - iterators, struct are not yet implemented

compact, cleaner, and correct wrt negative steps in array slices.

are defined exactly once.

This  algo is  naive and does not  work with  slices of  slices with
negative steps.  I commit it  before trying a  new one to  get better
non-reg test.

Fix some non-reg test in the should_work dir that this new check revealed.

when printing (left part) field acces.

definition instead of the type name in node profiles.

It  does not  work, I  have changed  my mind  to use  a  more general
clocking algorithm based on  unification. I commit that current state
just in case I change my mind again...

the parameters  input types are  compatible with Unify.f.   Apply (if
necessary) the resulting substitution to the output parameters.

Also,  when checking array  concat, try  to unify  the types  of both
arrays instead of just checking their equality.

This of course triggers some errors in the non-reg tests.  One of
this error is due to a bug in the parser, where the list of parameter
was inversed twice. I've also fixed that in this change.

ordering in order to handle  clocks properly, but I forget to reorder
them back for the interface variables!