(1) equations such as
 (x,y,z)=[0,0,0];
were generated with -en unless -ec was specified.

I've fixed that by always breaking tuples, even when global_opt.ec
is false (this condition was strange anyway).

(2) During node expansion, I create a fresh variable for each local
var in the expanded node, but old var names were still appering in
clock expression

indeed, consider that example :
var
  c:bool;
  x when c :bool;

I was generating something equivalent to

var
  c_fresh:bool;
  x_fresh when c :bool;

bou... Of course, it was working because in -ec mode, I need to
remove clock annotation when declaring local variables, which was
hidding the problem.

nb : because I've change test_lus2lic_no_node to use -lv4 instead of
-ec to generate the lustre oracle, which exposes new pbs (cf above).

(3) When expanding a node on the base clock with arguments on another
clock, I was not propagating that information (let's keep the
finger-crossed and hope the current fix is complete).

nb : the number of failing test cases is the same (5 new pass, but 5
new fail!!), but it actually is a progression. Indeed, the new test
failures ares due to the fact that this current change fixes a
problem that expose yet another one!

Actually, the newly exposed bug is not in the compliler, but in the
oracle I generate via the --auto-test option ; indeed, for testing
nodes which not all interface variables are one the base clock, I
should generate oracle that do take them into account.

112 tests failed, and 127 passed !!

Add --gen-autotest option that generates  a Lutin file and an oracle Lustre file suitable to compare the result of 2 Lustre compilers

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).

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.

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!

nb : do not work for lv4/ec mode

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

Remove all test that now passes from the broken dir.

It was beacause the tables in LicVarName were cleaned and because the way
this module work sucks...

on programs containing equations such as :

    b3, b4, b5, b6 = (three_outputs(two_outputs(b1,b2),true), false);

because TUPLES where not correctly inlined (i.e., "...= n((x,y),z)" instead of "...=n(x,y,z)"

nb : I've transformed all the regressions I've seen into todo entries
in todo.org.

nb 2 : I did not mv the newly broken tests into the broken dirs. I'll
do that for those I do not want to fix in the short term.

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

nb: les tests ne passent toujours bien sur.

* Partie lus -> AST

predef.ml -> srcPredef.ml
syntaxTreeCore.ml -> astCore.ml
syntaxTree.ml     -> astV6.ml
syntaxTreeDump.mli-> astV6Dump.mli

* Partie Ast -> Ast

solveIdent.mli -> astRecognizePredef.mli
syntaxTab.mli -> astTab.mli
symbolTab.mli -> astTabSymbol.mli

* Partie  AST -> lic (static evaluation)

eff.ml  -> lic.ml
getEff.mli -> ast2lic.mli
lazyCompiler.mli -> licTab.mli
builtIn.ml -> licMetaOp.ml
predefEval*.ml -> licEval*.ml
name.mli -> licName.mli

* Partie Lic -> Lic

uniqueOutput.mli      -> l2lCheckOutputs.mli
structArrayExpand.mli -> l2lExpandArrays.mli
nodesExpand.mli       -> l2lExpandNodes.mli
doNoPoly.ml           -> l2lRmPoly.ml
doAliasTypes.ml       -> l2lAliasType.ml
doSplit.ml            -> l2lSplit.ml

+ remise en place du souk qu'il a mis dans le repertoire test.

- il a commencé à rajouter le CondAct (tout est parti de la en fait...)
- il a coupé le LazyCompiler en morceaux

Pour cela, il a créé un nouveau module LicPrg qui définit la
structure de données (SDD) en sortie du LazyCompiler. Ensuite, les
diverses tranformations src2src sont faites à partir de cette SDD.

- il a débranché (temporairement) l'expansion de noeud et de array/structure

- il a débranché ma pseudo inférence de type et a mis à la place une
vérification de types.

- Le traitement du polymorphisme est effectué via une transfo src2src
dans DoNoPoly (que je vais renommer en RmPoly)

--------------------------------------------------------------------------
Par ailleurs,

J'ai créé un todo.org et un README.org que je vais essayer de tenir à jour.

nb: les tests ne passent toujours bien sur.