Houlala, this is not CF at all ! at all at all at all ! I wonder what Mark will say about that !MtnViewJohn wrote:This is exactly what I meant.And there's an awsesome feature : we could even "rebounce"... Or did I miss something ?
Target values and recursion depth
Moderators: MtnViewJohn, chris, mtnviewmark
- MtnViewJohn
- Site Admin
- Posts: 882
- Joined: Fri May 06, 2005 2:26 pm
- Location: Mountain View, California
- Contact:
I know! I have veered off into L-systems or something. Mark and Chris are probably shaking their heads. We can argue that recursion limiting is a convenient shortcut that eliminates tedium and improves clarity. But rebouncing at the recursion limit is all about enabling new, non-CF, stuff. But it would be so cool.
Now I see why your two friends don't say anything - But I'm sure they hate me less as they hate you.MtnViewJohn wrote:I know! I have veered off into L-systems or something. Mark and Chris are probably shaking their heads. We can argue that recursion limiting is a convenient shortcut that eliminates tedium and improves clarity. But rebouncing at the recursion limit is all about enabling new, non-CF, stuff. But it would be so cool.
Well - we have managed to skew things so that they look clear and clean under the CF light, until... rebouncing. The programming language argument can still be used, but you're pushing the limits, ho you nasty John !
Nasty lazy John !MtnViewJohn wrote:L-systems or something.
Well, I guess I can live with that.
I wish you courage for the implementation.
Btw, a last comment on syntax, I was about to forget.
Code: Select all
A { n 10 n < 1 }
Maybe
Code: Select all
A { n 10 parent.n < 1 }
Some options I prefer :
Code: Select all
n < 1 ? A { n 10 }
Code: Select all
A { n 10 } if n < 1
Code: Select all
A { n 10 } unless n > 0
Code: Select all
n < 1 ? A { n 10 } : B { }