Remove a lot of warnings (considered as errors by dune).

- add a sectiuon on operators priority
- fix the automatic latex grammar generator (now calles yacc2latex)

also force the -rif in the utils/luciole-rif script when used with
lutin or lus2lic.

* la syntaxe est changee pour l'accepter
* la stucture IdSolver (compil "lazy") contient maintenant
  "all_srcs" qui permet d'acceder si besoin a n'importe quelle info source,
  notamment les params statiques des noeuds identifies par "Pack::name"

  More precisely, a node that has memory ougth to be declared using
  "node", and using "function" otherwise.

  Moreover, a node that performs side-effects (i.e., if it calls an
  extern node that performs side effects) ougth to be declared as
  "unsafe".

  Safe/unsafe mismatches raise an error.

  Memory mismatches raise an error in one way (a "function" that uses
  memory), and a warning in the other way (a "node" that uses no
  memory).

Also fix some errors done when transmitting the unsafe flag (well, it's
the first time I use it!).

Currently no integrity check is performed (i.e., check that each node
that uses an unsafe node is itself declared as unsafe).

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

Also, force the merge to operate over an ident rather than on any val_exp.

nb : do not work for lv4/ec mode

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

et donc ne marchent plus !

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

Add a -tlex option to debug the lexer.

Also, rename the rules in parser.mly now that their appear in the manual.
This renaming work is in progress though.

as extern constants.

Also  fix  a  bug   in  the  struct/array  expanser:  when  expanding
structured constants  into val_exp,  I need to  add a entry  into the
type and clock val_exp tables.

by position). Rename ExpandPack into InstanciateModel.

change the parser and accept only clock expressions after a when.

A clock is now made of 2 idents: one for the clock constructor, and
one for the clock variable.

simple, and also avoids  3 shift/reduce conflicts. It also make
the pragma stuff more homogeneous  and simple to explain in the
manual.

Moreover, pramgma  are no  more attached to  AST nodes,  but to
lexemes.

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.

type_eff_ext into type_eff btw). The  rationale is to be able to type
alias           on           polymorphic          nodes           (cf
test/should_fail/semantics/bad_call03.lus,  that now  have  a correct
error msg).  It also makes  to code more compact (no more translation
from one  to the  other), and more  general (type_eff_ext  being more
general than type_eff).  User polymorphic nodes should be easy now.

move all the code in parsey.mly into parserUtil.ml (ease the debug).

equations is not done at all yet). Also, print the clock decorations
(when clk) in the generated file.

SolveIdent.recognize_predef_op  that  replaces  node call  by  Predef
constructor  when   necessary,  via  a  complete   traversal  of  the
SyntaxTree (instead  of doing it  in the parser). The  rationales for
this change are that:

- it is quite tedious to do it in parser as multiple locations are involved
- I did missed some locations
- It makes the parser more focused on parsing issues
- that traversal  is a first step  do deal with  idref solving (hence
 the name of the new module that contains that function

Note that lsrc/test/should_work/fab_test/lecteur.lus was using
"plus" as a variable ident, which raised an error, which

before '..'.

Also, in verbose mode, print the full path of the openned files.

package.

Better  error msg  when instanciating  a  model by  provided a  wrong
number of arguments.