at:tutorial:metaprogramming
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
at:tutorial:metaprogramming [2007/04/19 16:29] – stimberm | at:tutorial:metaprogramming [2007/08/08 12:30] – stimberm | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | < | ||
- | |||
===== Metaprogramming ===== | ===== Metaprogramming ===== | ||
==== AT Zero - AmbientTalk without syntactic sugar ==== | ==== AT Zero - AmbientTalk without syntactic sugar ==== | ||
+ | |||
+ | In AmbientTalk, | ||
+ | < | ||
+ | > | ||
+ | >>6 | ||
+ | >if: 1 == 2 then: { 13 } else: { 42 } | ||
+ | >>42 | ||
+ | >1 + 2 * 3 | ||
+ | >>7 | ||
+ | </ | ||
+ | However, these constructs are all **syntactic sugar** that enable a more natural syntax for performing these operations. Behind the scenes, they all perform message sends. The following code shows the equivalents of the previous code, but with the actual message sends: | ||
+ | < | ||
+ | >[5, 6, 7].at(2) | ||
+ | >>6 | ||
+ | >(1 == 2).ifTrue: { 13 } ifFalse: { 42 } | ||
+ | >>42 | ||
+ | > | ||
+ | >>7 | ||
+ | </ | ||
+ | |||
+ | In the first example above the message //at// is sent to the table **[5, | ||
==== Quasiquoting and splicing ==== | ==== Quasiquoting and splicing ==== | ||
+ | Quasiquoting and splicing are an advanced and powerful metaprogramming techniques that control the evaluation process and allow one to manipulate the evaluation process of the abstract syntax tree. | ||
- | In AmbientTalk, | + | === Quoting === |
- | Quoting | + | Any valid AmbientTalk expression can be quoted. This prevents the expression from being evaluated. Instead, it is returned literally. |
+ | |||
+ | Quoting | ||
+ | |||
+ | * '' | ||
+ | * '' | ||
+ | * '' | ||
+ | * '' | ||
+ | |||
+ | == Literal values == | ||
+ | |||
+ | Quoting | ||
< | < | ||
>`3 == 3 | >`3 == 3 | ||
Line 19: | Line 50: | ||
</ | </ | ||
- | Quoting an identifer | + | An identifer |
< | < | ||
>foo | >foo | ||
Line 25: | Line 56: | ||
>`foo | >`foo | ||
>>foo | >>foo | ||
+ | > | ||
+ | >>" | ||
</ | </ | ||
+ | |||
+ | Note that in '' | ||
+ | |||
+ | == Expressions == | ||
+ | |||
+ | To quote a complete expression, it has to be wrapped in parantheses: | ||
< | < | ||
- | >def o := object: { def m() { 5 } } | + | >`(foo.text) |
- | >>< | + | >>foo.text |
- | >o.m() | + | >`(foo(1, 2, 3)) |
- | >>5 | + | >>foo(1, 2, 3) |
+ | >`(1+2) | ||
+ | >>1.+(2) | ||
> | > | ||
>> | >> | ||
+ | </ | ||
+ | |||
+ | == Statements == | ||
+ | |||
+ | Statements (definitions, | ||
+ | |||
+ | < | ||
+ | >`{ def a := 4 } | ||
+ | >>def a := 4 | ||
+ | >`{ def tab[5] { m() }; tab[3] := n() } | ||
+ | >>def tab[5] { m()}; tab[3] := n() | ||
+ | </ | ||
+ | |||
+ | < | ||
+ | Quoting a literal closure can be done in two ways: as an expression: < | ||
+ | To quote a literal closure with the latter form, the vertical bars may not be ommited, even if the closure takes no arguments. < | ||
+ | </ | ||
+ | |||
+ | == Tables == | ||
+ | |||
+ | Literal tables can already be defined as follows: | ||
+ | < | ||
+ | >def tab := [ 1+2, 3+4, 5+6 ] | ||
+ | >>[3, 7, 11] | ||
+ | </ | ||
+ | With this construct, all the elements of the literal table are evaluated. By quoting a literal table, all the elements are quoted instead of evaluated: | ||
+ | < | ||
+ | >def anotherTab := `[ 1+2, 3+4, 5+6 ] | ||
+ | >> | ||
+ | </ | ||
+ | |||
+ | === Unquoting === | ||
+ | |||
+ | Inside a quotation, an expression can be unquoted as well. An unquotation escapes from the quotation and causes the unquoted expression to be evaluated. The return value is then used as the quotation of the unquotation. | ||
+ | Unquoting an expression is done with the ''#'' | ||
+ | |||
+ | < | ||
+ | >def msg() { `foo } | ||
+ | >>< | ||
+ | >def arg(n) { n+5 } | ||
+ | >>< | ||
+ | > | ||
+ | >> | ||
+ | </ | ||
+ | |||
+ | === Splicing === | ||
+ | |||
+ | Splicing can already be used without quoting: | ||
+ | < | ||
+ | >def upTo(n) { def idx := 0; def tab[n] { idx := idx + 1 } } | ||
+ | >>< | ||
+ | >[ 7, 8, 9, @upTo(4) ] | ||
+ | >>[7, 8, 9, 1, 2, 3, 4] | ||
+ | >[ 7, 8, 9, upTo(4) ] | ||
+ | >>[7, 8, 9, [1, 2, 3, 4]] | ||
+ | </ | ||
+ | In the example above the elements of the table returned by invoking **upTo(4)** are added in place to the table in which the expression was spliced. | ||
+ | |||
+ | Splicing can also be used in combination with quoting and unquoting. AmbientTalk provides the // | ||
+ | < | ||
+ | > | ||
+ | >> | ||
+ | >`[ @upTo(3), # | ||
+ | >> | ||
</ | </ | ||
==== First-class abstract grammar ==== | ==== First-class abstract grammar ==== | ||
+ | |||
+ | Quoting an AmbientTalk expression results in an the parse tree of that expression. Like any value in AmbientTalk, | ||
+ | |||
+ | < | ||
+ | >`(f(1, 2, 3)).function | ||
+ | >>f | ||
+ | >`(f(1, 2, 3)).arguments | ||
+ | >>[1, 2, 3] | ||
+ | </ | ||
+ | |||
+ | Any abstract grammar element can serve as a prototype for a new one: | ||
+ | < | ||
+ | >def application := `(f(1, 2, 3)) | ||
+ | >> | ||
+ | > | ||
+ | >> | ||
+ | </ | ||
+ | |||
+ | The following example uses meta-programming and reflection to generate a proxy for an object that provides a given interface. The interface' | ||
+ | |||
+ | < | ||
+ | TODO: Update code | ||
+ | </ | ||
+ | |||
+ | < | ||
+ | def isMethodDefinition: | ||
+ | |||
+ | def policyOf: object with: interface { | ||
+ | |||
+ | def policyDefinition := interface.method.bodyExpression.statements; | ||
+ | |||
+ | policyDefinition.each: | ||
+ | if: (isMethodDefinition: | ||
+ | def methodBody := statement.bodyExpression.statements; | ||
+ | if: ((methodBody.length == 1).and: { methodBody[1] == `nil }) then: { | ||
+ | def bodyExpression := `{ #(object) ^ # | ||
+ | statement.bodyExpression := bodyExpression; | ||
+ | } | ||
+ | } | ||
+ | }; | ||
+ | |||
+ | object: interface; | ||
+ | |||
+ | }; | ||
+ | </ | ||
+ | |||
+ | ==== Read / Eval / Print ==== | ||
+ | |||
+ | AmbientTalk reifies the read, eval and print operations. This means that you can read any string and get the responding syntax tree for it, evaluate any syntax tree and get a value for it, and print any value and get a string representation of the value. | ||
+ | |||
+ | < | ||
+ | >read: " | ||
+ | >> | ||
+ | >eval: `(1+2) in: self | ||
+ | >>3 | ||
+ | >print: self | ||
+ | >>"< | ||
+ | </ | ||
+ | |||
+ | Eval is a keyworded message that takes another parameter, namely the object in whose scope the expression must be evaluated. | ||
+ | |||
+ | < | ||
+ | >def o := object: { def x := 4 } | ||
+ | >>< | ||
+ | >eval: `x in: o | ||
+ | >>4 | ||
+ | </ |
at/tutorial/metaprogramming.txt · Last modified: 2009/11/21 07:44 by tvcutsem