[EMAIL PROTECTED] wrote:

> glad to see you back in good "form" (pun itended ;-).

Thing is, I'm very busy lately. ;-) However I'm always reading
every message from this list. :-)

> Correct. What is it due to?
[...]

I agree with your speculation. Parens can be used recursively too,
and they seem to use a bit less stack than parameterles functions
(this example is on WinNT):

>> test: make paren! [x: x + 1 test]
== (x: x + 1 test)
>> test
** Internal Error: Stack overflow.
** Where: test
>> x
== 5341
>> test: func [] [x: x + 1 test]
>> x: 1
== 1
>> test
** Internal Error: Stack overflow.
** Where: x: x + 1 test
>> x
== 3233

Notice that paren! is not the only datatype that has a different
behaviour in case of evaluation:

>> b: 2
== 2
>> a: to-set-word 'b
== b:
>> a 3
== 3
>> b
== 3
>> :a
== b:

Ciao,
    /Gabriele./
o--------------------) .-^-. (----------------------------------o
| Gabriele Santilli / /_/_\_\ \ Amiga Group Italia --- L'Aquila |
| GIESSE on IRC     \ \-\_/-/ /  http://www.amyresource.it/AGI/ |
o--------------------) `-v-' (----------------------------------o

Reply via email to