help-bison
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: about counting the times of 'recursion'


From: xelanoimis
Subject: Re: about counting the times of 'recursion'
Date: Sun, 7 Jun 2009 16:23:16 -0700 (PDT)

Just a thought on this, in case you don't need only a 1:1 parallel
assignment:
 
I wanted to support this too, along with returning more than one value, like
LUA does. It is pretty tricky if you don't know at compile time how many
values are expected or returned. Even LUA messes up these assigns in some
cases.

For example, you can have a,b,c = GetAB(), GetC(); where GetAB returns 2
elements. However, if it does not returns 2 and returns 3 elements, you need
some runtime check to handle it.

I wanted to use it for something like x,y,z = GetPosition() or even
object.pos = x, y, z


-- 
View this message in context: 
http://www.nabble.com/about-counting-the-times-of-%27recursion%27-tp23910504p23916433.html
Sent from the Gnu - Bison - Help mailing list archive at Nabble.com.





reply via email to

[Prev in Thread] Current Thread [Next in Thread]