Variations on Trees

Martin Maly (one of the chief architects of the DLR) has written another blog entry on creating dynamic languages with the Dynamic Language Runtime. This entry is a comparison of DLR trees (the ASTs used by the DLR to represent dynamic language programs) with LINQ Expression Trees. LINQ Expression Trees can be generated by the C# compiler from expressions that look a bit like list comprehensions. Unfortunately there is no built-in compiler support (yet...) for generating DLR Trees directly, but they are very similar:

Comments

Popular posts from this blog

Extending Abobe Flash Player and AIR with Python and Ruby

Should Python Projects Support IronPython and Jython?

Further Adventures of the Debugger