the includer file, instead of the compiling directory.

Also, avoid loops when including files.

Add a --nonreg-test option that prevent the compiler to print file
name paths in error messages. Indeed, this change makes all file
names absolute, which complicates the non-regression tests automatic
perusal.

including files) was wrong (well, at least, too restrictive, numbers
were forbidden in file names...).

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

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

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.

This is useful to be able to compile V4 program that uses include.

Fix a performance bug that was occuring with programs having a lot of variables and that were using constant.

cf test/should_work/NONREG/fresh_name.lus

where the local variable _n1e1_1 was defined twice !

The fix contist the following idea : prefix fresh var name by "_",
   except if at least one user ident begins by "_". In that case, we
   try to prefix them by "_1", and then "_2", and so on. We take the
   first possible one.

   nb : this won't work if the user defined idents from "_1" to
   "_1073741823" (on 32-bits machine), but I bet that this compiler
   would die before anyway...

E.g., when creating a fresh var using the name of "L1", I was creating a var names "_L11", and then
"_L12", and so on. But if a var is named "L11", "_L111" is created. If if "L1" is used to generate
11 frash vart names, the name "_L111" clashes !!!

The fix contist in adding an underscore before : "L1" produces "_L1_1", "_L1_2", ..., and "_L1_11".

nb : the naming scheme is still wrong for other reasons... Next fix.

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

maintaining (ugly and error-prone) hash tables.

That change revealed an untriggered bug in EvalClock.check_args: it was wrong
to add in subst the substitutions made of the parameters and the arguments (it
is enough to unify the clocks of the pars and of the args). For instance, consider
the node (in should_work/clock/clock.lus)

   node clock5(x :  bool; y:  bool when x; z: bool when y)

and the call

  z2 = clock5(a, b when a, c when e);

I was adding y/b in the subst, which was wrong.

Other minor changes:
 - move const_to_val_eff from Eff to UnifyClock.
 - GetEff.translate_val_exp now returns a substitution, in order to be able
   to unify clock vars and propagate the resulting substitution.

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.