On Wednesday 11 August 2010 00:45:44 Eric Niebler wrote:
On 8/10/2010 3:52
PM, Thomas Heller wrote:
On Tue, Aug 10, 2010 at 8:56 PM, Eric Niebler
wrote:
Good. Now if you are saying that Proto's existing transforms
are
too low-level and that things like pre- and post-order traversals
On 11/08/10 17:52, Eric Niebler wrote:
I don't exactly recall the details of Joel's technique. My experiments
to separate transforms from grammars were largely unsuccessful because
control flow often need pattern matching. I'd like to see alternate designs.
Mine was just a post-order
This is kind of like Proto's evaluation contexts, IIUC. I'm not wild for
them because often just the tag isn't enough information to find the
right handler. But maybe it covers enough use cases and can be made
easier to use. Right now, proto has an eval function that takes an
expression and
Thanks Joel,
This is food for thought!
On Aug 10, 2010, at 2:47 AM, joel falcou wrote:
On 10/08/10 05:24, Gordon Woodhull wrote:
I wonder if Dan Marsden's Traversal library would solve this out of
the box? http://boost-spirit.com/dl_docs/traversal/html/traversal/introduction.html
Oh nice
On 8/10/2010 2:52 PM, joel.fal...@lri.fr wrote:
Eric Niebler wrote:
A pre-order traversal, pushing each visited node into an mpl vector? How
about:
snip
I'm on a tiny mobile, but my idéa was to have such algo as proto
transforms grammar
Good. Now if you are saying that Proto's existing
On 7/27/2010 9:01 AM, joel falcou wrote:
what about having some Tree related trasnform/function/meta-function then ?
I'm often thinking : dang, this transform is basically a BFS for a node
verifying meta-function foo
and have to rewrite a BFS usign default_ and such, which is relatively
On 27/07/10 15:08, Eric Niebler wrote:
That would be awesome, Joel!
I'll count on you for helping me making those looking nice :p
What's the easiest ? getting a proto-tree branch or what ?
___
proto mailing list
proto@lists.boost.org
what about having some Tree related trasnform/function/meta-function then ?
I'm often thinking : dang, this transform is basically a BFS for a node
verifying meta-function foo
and have to rewrite a BFS usign default_ and such, which is relatively easy.
Now, sometimes it is dang, this code is
On 27/07/10 15:08, Eric Niebler wrote:
That would be awesome, Joel!
WHat's the easiest in term of code ?
I can bring up some git repo or shoudl I work in some svn branches of
proto somewhere at boost ?
___
proto mailing list
I think you should talk to Gordon Woodhull. He's building a metagraph
(among others) library, which I am going to use in msm for
compile-time calculations and fsm analysis. This means there will be
temporarily a metagraph library inside msm as proof of concept until
there can be a review.
10 matches
Mail list logo
