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.

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

- plus de macros prefefinies (e.g. FILL, BOOLRED etc...)
  (remplacé par la notion de BuiltIn)
- split.ml adapté et remanié pour rentrer dans le moule
  source to source (voir DoSplit)

et donc ne marchent plus !

IDENT remplacé par VAR_REF/CONST_REF
- plus de node_exp dans les CALL, juste une ref (node_key)
- reste a faire pareil pour les NodeStaticArgEff

importante du mecanisme de UnifyType :
- fait :
  * definition de Eff.poly_match
  * TypeVar type_var au lieu de Any/Overload
    avec type_var = Any | AnyNum
    (pour l'instant et pour longtemps ?!)
- à faire :
  * revoir UnifyType pour qu'il rende un poly_match
  * stocker là où c'est nécessaire les poly_match
    calculés lors du type check
    (pour les CALL et peut-être les sargs ?)

parametric nodes (or predef iterators) are nested.

Before, nested iterators were handles as follows : a source-level
(i.e., not compiled) alias node was created on-the-fly, and then
compiled. But this way to proceed was buggy for static args coming
from nested iterators or nested parametric nodes.

Now, I rely on Inline.iterators to get rid of iterators (the iterator
inlining is now recursive).

not use the module name. Otherwise, names with "::" are created, and
sometimes the lhs of the "::" does not even correpond to an existing
module.

'+' replaced by "p"
(see "correct_num_string" in LicDump.ml)

'-' replaced by 'm', '.' by 'd',
(see "correct_num_string" in LicDump.ml)

message if the constant is abstract ("an integer is expected whereas an int is
provided" was not a great message...).

not expanded.

info is attached to all  val_exp. Moreover, this allow to perfrom all
the  type checking  in  EvalType.f, instead  of  doin part  of it  in
GetEff.translate_val_exp.

maintaining (ugly and error-prone) hash tables.

constants that  are not  on the base  clock, add the  suitable "when"
statement if it was not present  in the source code (the lic (and the
ec/lv4) backend  does not  perform such kind  of clock  inference for
constants.

instead of silently generate  (syntactically) wrong lustre v4 (or ec).

instanciated by a polymorphic operator.

iterated, was still printed using the prefix/long name method (e.g.,
"Lustre__not(a)"  instead   of  "not  a").   Moreover,  equality  was
inconsistently represented as "eq" and "equal". I choose the former.

still   printed   using    the   prefix/long   name   method   (e.g.,
"Lustre__and(a,b)" instead of "a and b".

expansed) type  definitions that were containing struct  or arrays in
the expand_structs mode.

var only! Hence, I tranform "#(a)" into "a" in the lv4 mode.