|
|
Boost Users : |
Subject: Re: [Boost-users] [Proto] proto::reverse_fold_tree
From: Joel Falcou (joel.falcou_at_[hidden])
Date: 2009-02-02 14:21:28
Dave Jenkins a écrit :
> You can see that both are broken if you try the expression
> "(a*b+c)*(do*e+f)".
> That displays [f e d] for reverse_fold_tree and [a b] for fold_tree.
>
Then, is there anyway to implement a real Depth First or Breadth First
traversal of the whole AST in Proto ?
-- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net