Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

Version 1 Current »

it would be great to have a tree construction thing that lets me build an AST from "a=3;" raw text using a grammar for the target language. Also you can hook in ST to it so you can build a tree from "<lhs>=<rhs>". (smile) This only seems useful during tree parsing as you can't have the parser invoke itself to build an AST; the recursive definition wouldn't work in general. During tree rewriting, however, you could use this nicely.

  • No labels