Timeline for How to perform a depth-first preorder traversal of an expression?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 9, 2012 at 4:42 | comment | added | Daniel Lichtblau | Yes, it builds an output expression. Sow is not an example function but rather is used in a necessary way. One could easily provide for a function to apply to subexpressions, though I did not. Main advantage is for deeply nested expressions because it will not blow up the program's subroutine stack. | |
| Aug 9, 2012 at 4:39 | comment | added | Mr.Wizard | Daniel, I see that this is Reaping expressions; unlike Scan this is building an output expression, right? Is Sow simply an example function to "scan" over the expression? What are the tradeoffs of this method compared to recursion? | |
| Aug 9, 2012 at 4:16 | history | answered | Daniel Lichtblau | CC BY-SA 3.0 |