On Wed, Sep 08, 2004 at 07:33:45AM -0600, Patrick R. Michaud wrote: : We're in the beginning stages of building a basic perl 6 grammar engine : (i.e., probably without p6 closures) that compiles to parrot and handles : basic optimizations.
I wonder whether, in the absence of closures, we'll have to have some similar way to embed syntax-tree building code (PIR?) as actions in the grammar. Perhaps most of the grammar can rely on the built-up tree of $0 nodes, but we'll at least have to have an escape down into the operator precedence parser. (Though we could bootstrap with pure (slow) recursive descent and then layer the operator precedence over that later, I suppose. We'd only have to rewrite a few <expr>-like rules at that point. But I'm just a little scared that operator precedence will be one of those optimizations that's always the project after this one...) Larry
