Hello Michaël,
> + /* the argument list has been built in reverse order, it is fixed here */
> + expr->u.function.args = reverse_elist(args);
> Hm. I may be missing something, but why is that necessary? This is
> basically doing a double-reversion to put all the arguments in the
> correct order when parsing the function arguments.
This is because the expression list is parsed left to right and the list
is built as a stack to avoid looking for the last argument to append the
next expression, but then the list is in reverse order at the end of
parsing, so it is reversed once to make it right. This way the complexity
is kept as O(n).
If this is too much I can switch to O(n**2) by appending each expression
at the end of the list.
--
Fabien.
