To  do  that, we  centralized  the ident  name  creation  into a  new
dedicated module Name.

+ fix should_work/NONREG/param_node.lus, we contained a combinational loop.

The rationale for this change is that this is necessary for constants
appearing static  arg to  be replaced. One  problem is that  they are
handled in exactly  the same way as top-level  constants, which could
be left  un-expanded. I could make  something in order  to not expand
those top-levelconstants, but is it worth the trouble ?

To do that,  I have changed sligthly the  representation of Eff.ARRAY
(the elements  are now  attached to the  constructor itself,  and the
operands  is empty)  and  the one  of  array constant  (we attach  to
Array_const_eff  a  list  instead  of  an  array,  for  the  sake  of
homogeneity) with what is done in Eff.val_eff.

is  part  of  the  Eff.node_ney  via  static  node  parameters.   The
consequence  was  that some  nodes  (the  ones  with node  as  static
parameters) were and printer several times (if used several times in
the user program)!

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.

around the rigth-hand-side.

polymorphic operators.

For instance, when LicDumping expression such as

    map<<map<<+,4>>,5>>

an  alias  node was  created  for  "map<<+,4>>"  (to unnest  iterator
calls). Fut this node is intrically overloaded (polymorphic). In this
change, we  look at  the type this  innr call  is used to  generate a
specialised (mono-morphic) version of the node alias.

Note that we currently still generate type variable when users write

     node mymap = map<<+,4>>;

+ enhance  error msg  (which helped finding  the bug, but  that migth
also be useful for ed-users...).

The  idea  is  the  following:  each  time  a  nested  iterator  call
(map<<map<<n,3>>,4>>) is  encountered, we  create a fresh  alias name
(create_alias_name) ad we  add it in the node_alias_tbl.   At the end
of the  compilation, LicDump.dump_node_alias is  called, which prints
the definition of those node aliases.

For example, the expression  "map<<map<<n,3>>,4>>" is printed like this:

    map<<_node_alias1, 4>>

and later, the node alias is defined:

    node _node_alias1(x:int) returns(y:int); let y = map<<n,3>>(x); tel;

prefixed by "_".

was used in  the local variables generated to  split expressions into
atomic expressions.

Indeed,  when  such an  intermediary  expression  is  inferred to  be
variable, it is  ok to consider that  it is on the base  clock. And I
was missing such a case.

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.

lexing nightmares in lic2loc.

to avoid priority errors.

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.

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.

when printing (left part) field acces.

definition instead of the type name in node profiles.