On Wed, Oct 30, 2013 at 4:26 PM, Brian Slesinsky <[email protected]>wrote:
> Not a compiler expert, but I wouldn't be surprised since in the AST it > will be represented as a binary tree of JBinaryOperation nodes and the > visitors walk the tree recursively. So balancing the tree should result in > a smaller stack. > Right, the issue is that a long run of concatenation resulted in a degenerate tree like concat(a,concat(b,concat(c,...))) and you could blow out the stack on a recursive traversal. I remember discussions about special-casing string concatenation (it seemed unlikely to affect other operators), either into a balanced tree or simply a multi-arg concat operator. I don't know if anything was ever done. -- John A. Tamplin -- http://groups.google.com/group/Google-Web-Toolkit-Contributors --- You received this message because you are subscribed to the Google Groups "GWT Contributors" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
