> From: Jack J. Woehr [mailto:[EMAIL PROTECTED] > > Ant should behave analagously to m4: recursively expand until it > > either hits ground or an uninstantiated ${decorated} name. > > Oh, and the algorithm should be something like: > > 1. While argument X contains any "${}" expressions { > 2. Y : = Expansion of leftmost innermost "${ }" expressions in X > 3. Call Step 1 with (Y) as the argument > 4. Replace in X the leftmost innermost "${}" expression with the > result of the call. } > 5. Return X > > Do I have that right?
I wouldn't know, my algorithmic's pretty bad I now recognize. But you side stepped the BC issue. You can always implement (and test) the algorithm above, and see if you can get the committers to put it in. --DD --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
