CSC/ECE 517 Spring 2013/ch1b 1i lh

• Write-up of This Topic.
• Expertiza Wiki Entry on Meta-programming in Statically Typed Languages 1
• Expertiza Wiki Entry on Meta-programming in Statically Typed Languages 2
• Expertiza Wiki Entry on What is Meta-programming

"I rather write a x86 program in binary using a butterfly than writing this article" - Hao Liu

This page is a discuss about meta-programming and its implementation and uses in dynamically typed languages.

Meta-programming in Dynamically Typed Languages

Introduction to Meta-Programming

In essence meta-programs are computer programs that can write or manipulate other programs or themselves as their data. Meta-programming is the general term for techniques use to write such program. The language in which the meta-program is written is called the metalanguage. The language of the programs that are manipulated is called the object language.<ref>Wikipedia Entry on Metaprogramming</ref>

This simplistic definition of meta-program and meta-programming tend to give reader a very intimidating first impression and render a image of a sentient self modifying program that ultimately take over the world. In reality meta-program and meta-programming techniques can very in complexity from the extreme of sentient self modifying program to simple and everyday thing such as a pre-processor macro. In most cases meta-programming are use to improve the quality of life of the programmer by improving the readability and re-usability of the code and by providing a higher level of abstraction.

In this article we will be focusing more on the implementation and use of reflection to facilitate meta-programming in dynamically typed languages.

Reflection is the ability of a computer program to examine and modify the structure and behavior of an object at runtime.<ref>Wikipedia Entry on Reflection</ref>

Example of Meta-Programming

This section describe some of diffident types of meta-programming techniques and example of their usage.

Generative Programming

Generative programming is a style of computer programming that uses automated source code creation through generic frames, classes, prototypes, templates, aspects, and code generators to improve programmer productivity.<ref>Wikipedia Entry on Automatic Programming</ref>

In its simplest form any programming language, even the shell script, can be use for this type of meta-programming, so long as they have the ability to reading and modifying the source code of another program or it's own source code as a text file.

For example:

#!/usr/bin/env bash
echo -e "#include <stdio.h>" >> program.c
echo -e "int main() {"       >> program.c
for ((I=1; I<=5; I++)) do
    echo -e "  printf(\042 meta \042);" >> program.c
done
echo -e "return 0}" >> program.c
g++ program.c
a.out

This simple bash script generates a program that prints out

meta meta meta meta meta

by generating a c source code as a text file, than compile to source code into a executable binary file using a compiler.

Template Meta-Programming

Template meta-programming is a meta-programming technique in which templates are used by a compiler to generate temporary source code, which is merged by the compiler with the rest of the source code and then compiled. The output of these templates include compile-time constants, data structures, and complete functions. The use of templates can be thought of as compile-time execution.<ref>Wikipedia Entry on Template Metaprogramming</ref>

A example usage of template programming is to pre-generate tables of data at compile time for use at runtime. For example, if you are writing a game that require lots of calculation of sine of 8 bit integers, instead of calculating sine at run time when they are needed, template programming can be use to build a static data tables as pre-calculated value at compile-time to eliminate the need of recalculating sine each time.<ref>art of metaprogramming, Part 1: Introduction to metaprogramming</ref>

Macros

A macro is a rule or pattern that specifies how a certain input sequence (often a sequence of characters) should be mapped to a replacement input sequence (also often a sequence of characters) according to a defined procedure. The mapping process that instantiates (transforms) a macro use into a specific sequence is known as macro expansion. Macros are used to make a sequence of computing instructions available to the programmer as a single program statement, making the programming task less tedious and less error-prone. <ref>Wikipedia Entry on Macro</ref>

Example of macro in C programming language

#include <stdio.h>
#define debug_print(...) \
   if (DEBUG) fprintf(stderr, __VA_ARGS__)
int main() {
    debug_print("debug\n");
}

at compile time the compiler will replace the macro

debug_print("debug\n"); 

with

if(DEBUG) printf(stderr,"debug\n");

Introduction to Dynamically Typed Programming Languages

In general programming languages can be split into two categories base on their type system, statically typed and dynamically typed. A programming language is said to be statically typed if type checking is performed during compile-time. In comparison, a programming language is said to be dynamically typed deferring type checking until run-time as opposes to compile-time. <ref>Wikipedia Entry on Type System</ref>

In dynamically typed languages, the variables and parameters do not have a designated type and may take different type of values at different times. In all the operations, the operands must be type checked at run-time just before performing the operation. Dynamically typed languages don’t need to make a distinction between classes created at compile time and classes provided. It is possible to define classes at run time and in fact, classes are always defined at run time. These eliminate many developer constraints by avoiding the need of book keeping, declarations etc. Due to this flexibility these languages make an ideal candidate for prototyping and are widely used in agile development environments. However, dynamic languages are known to have performance issues. Static languages have code optimization features at compile time, but dynamic languages allow run-time code optimizations only. <ref>CPSC 543 Dynamically and Statically typed Languages June 10, 2009 By Muhammad Bandeali</ref> In dynamically typed languages, the interpreter deduces type and type conversions, this makes development time faster, but it also can provoke run-time failures. These run-time failures are caught early on during compile time for statically typed languages.

Examples of Dynamically Typed Programming Languages

Perl

Perl is a high-level, general-purpose, interpreted, dynamic programming language originally developed as a general-purpose Unix scripting language to make report processing easier. Perl borrows features from other programming languages including C, shell scripting (sh), AWK, and sed. The language provides powerful text processing facilities without the arbitrary data-length limits of many contemporary Unix tools, facilitating easy manipulation of text files. Perl is used for CGI scripting, graphics programming, system administration, network programming, finance, bioinformatics, and other applications.<ref>Wikipedia Entry on Perl</ref>

Python

Python is a general-purpose, high-level programming language whose design philosophy emphasizes code readability. It supports multiple programming paradigms, including object-oriented, imperative and functional programming styles. It features a fully dynamic type system and automatic memory management, similar to that of Scheme, Ruby, Perl and Tcl. Like other dynamic languages, Python is often used as a scripting language, but is also used in a wide range of non-scripting contexts. Using third-party tools, Python code can be packaged into standalone executable programs.<ref>Wikipedia Entry on Python</ref>

Ruby

Ruby is a dynamic, reflective, general-purpose object-oriented programming language that combines syntax inspired by Perl with Smalltalk-like features. It was also influenced by Eiffel and Lisp. Ruby supports multiple programming paradigms, including functional, object oriented, imperative and reflective. It also has a dynamic type system and automatic memory management; it is therefore similar in varying respects to Smalltalk, Python, Perl, Lisp, Dylan, Pike, and CLU.<ref>Wikipedia Entry on Ruby</ref>

Meta-Programming in Dynamically Typed Languages

Ruby <ref>Metaprogramming in Ruby: It’s All About the Self</ref>

In ruby you can write methods using meta-programming to insert code into the program. A widely use example of such meta-programming method is the attr_accessor method in the class named Module.

In this example attr_accessor method is use to insert the accessor codes to the class

class MyClass   
  attr_accessor :info
end

Is the same as

class MyClass
 def variable=(value)
   @variable = value
 end

 def variable
   @variable
 end
end

The method method_missing() is another example of metaprograming in Ruby. In ruby if the interpreter can’t find the method anywhere up the object’s chain of inheritance, it will go back to the object and call the method named method_missing(). The interpreter looks for method_missing() in the object’s methods and up the object’s chain of inheritance until it reaches the Object class where method_missing() is defined.

class MyClass
  def method_missing(name, *args)
    puts "#{name} was called with arguments: #{args.join(', ')}"
  end
end

m = MyClass.new
m.undefined_method("one", "two") # => undefined_method was called with arguments: one, two
m.another_undefined_method("three", "four") # => another_undefined_method was called with arguments: three, four

The class MyClass does not have a method named undefined_method() or another_underfined_method() but the method_missing() method created responds to these methods.

Implementation of Meta-Programming in Dynamically Typed Languages

-self

-metaclass A metaclass is a class whose instances are classes. Just as an ordinary class defines the behavior of certain objects, a metaclass defines the behavior of certain classes and their instances.

In ruby each object metaclass, a class that can have methods, but is only attached to the object itself.

-eval