From Wikipedia, the free encyclopedia
Jump to: navigation, search
This article is about the computer programming technique. For the management technique, see Charles Simonyi.

Metaprogramming is a programming technique in which computer programs have the ability to treat programs as their data. It means that a program can be designed to read, generate, analyse or transform other programs, and even modify itself while running.[1][2] In some cases, this allows programmers to minimize the number of lines of code to express a solution, and thus reducing the development time,.[3] It also allows programs greater flexibility to efficiently handle new situations without recompilation.

Metaprogramming can be used to move computations from run-time to compile-time, to generate code using compile time computations, and to enable self-modifying code. The language in which the metaprogram is written is called the metalanguage. The language of the programs that are manipulated is called the object language. The ability of a programming language to be its own metalanguage is called reflection or reflexivity. [4] Reflection is a valuable language feature to facilitate metaprogramming.


Metaprogramming enables developers to write programs and develop code that falls under the generic programming paradigm. Having the programming language itself as a first-class data type (as in Lisp, Prolog, SNOBOL, or Rebol) is also very useful; this is known as homoiconicity. Generic programming invokes a metaprogramming facility within a language by allowing one to write code without the concern of specifying data types since they can be supplied as parameters when used.

Metaprogramming usually works in one of three ways.[5]

  1. The first approach is to expose the internals of the run-time engine to the programming code through application programming interfaces (APIs) like that for the .NET IL emitter.
  2. The second approach is dynamic execution of expressions that contain programming commands, often composed from strings, but can also be from other methods using arguments or context, like Javascript.[6] Thus, "programs can write programs." Although both approaches can be used in the same language, most languages tend to lean toward one or the other.
  3. The third approach is to step outside the language entirely. General purpose program transformation systems such as compilers, which accept language descriptions and carry out arbitrary transformations on those languages, are direct implementations of general metaprogramming. This allows metaprogramming to be applied to virtually any target language without regard to whether that target language has any metaprogramming abilities of its own. One can see this at work with scheme programming language and how it allows to tackle some limitations faced in the C language by using constructs that were part of the Scheme language itself to extend C. Art of Metaprogramming


A simple example of a metaprogram is this POSIX Shell script, which is an example of generative programming:

# metaprogram
echo '#!/bin/sh' >program
for I in $(seq 992)
        echo "echo $I" >> program
chmod +x program

This script (or program) generates a new 993-line program that prints out the numbers 1–992. This is only an illustration of how to use code to write more code; it is not the most efficient way to print out a list of numbers. Nonetheless, a programmer can write and execute this metaprogram in less than a minute, and will have generated exactly 1000 lines of code in that amount of time.

A quine is a special kind of metaprogram that produces its own source code as its output. Quines are generally of recreational or theoretical interest only.

Not all metaprogramming involves generative programming. If programs are modifiable at runtime or if incremental compilation is available (such as in C#, Forth, Frink, Groovy, JavaScript, Lisp, Lua, Perl, PHP, Python, REBOL, Ruby, Smalltalk, and Tcl), then techniques can be used to perform metaprogramming without actually generating source code.

Lisp is probably the quintessential language with metaprogramming facilities, both because of its historical precedence and because of the simplicity and power of its metaprogramming. In Lisp metaprogramming, the unquote operator (typically a comma) introduces code that is evaluated at program definition time rather than at run time; see Self-evaluating forms and quoting in Lisp. The metaprogramming language is thus identical to the host programming language, and existing Lisp routines can be directly reused for metaprogramming, if desired.

This approach has been implemented in other languages by incorporating an interpreter in the program, which works directly with the program’s data. There are implementations of this kind for some common high-level languages, such as RemObjectsPascal Script for Object Pascal.

One style of metaprogramming is to employ domain-specific languages (DSLs). A fairly common example of using DSLs involves generative metaprogramming: lex and yacc, two tools used to generate lexical analyzers and parsers, let the user describe the language using regular expressions and context-free grammars, and embed the complex algorithms required to efficiently parse the language.

Support and Challenges of metaprogramming[edit]

One of the benefits of metaprogramming is that it increases the productivity of developers once they get past the convention over configuration phase in the learning phase. Some argue that there is a sharp learning curve to make complete use of the metaprogramming features and to take of advantage of it.[7] Since metaprogramming gives more flexibility and configurability at runtime, misuse or wrong use of the metaprogramming can result in unwarranted and unexpected errors that can be extremely difficult to debug to an average developer. It can introduce risks in the system and make it more vulnerable if not used with care. Some of the common problems which can occur due to wrong use of metaprogramming are inability of the compiler to identify missing configuration parameters, invalid or incorrect data can result in unknown exception or different results [8] Due to this, some critics believe that only high-skilled developers should work on developing features to support metaprogramming in a language or platform and an average developer must learn how to use these features as part of convention.

Uses - metaprogramming in programming languages[edit]

Macro systems[edit]

Macro assemblers[edit]

The IBM/360 and derivatives had powerful macro assembler facilities that were often used to generate complete assembly language programs[citation needed] or sections of programs (for different operating systems for instance). Macros provided with CICS transaction processing system had assembler macros that generated COBOL statements as a pre-processing step.

Other assemblers, such as MASM, also support macros.


Metaclasses are provided by the following programming languages:

Template metaprogramming[edit]

Staged metaprogramming[edit]

With dependent types[edit]

  • Usage of dependent types allows proving that generated code is never invalid.[9] However, this approach is bleeding-edge and is rarely found outside of research programming languages.


See also[edit]


  1. ^ Harald Sondergaard. "Course on Program Analysis and Transformation". Retrieved 18 September 2014. 
  2. ^ Czarnecki, Krzysztof; Eisenecker, Ulrich W. (2000). Generative Programming. ISBN 0-201-30977-7. 
  3. ^ Walker, Max. "The Art of Metaprogrmming in Java". New Circle. Retrieved 28 January 2014. 
  4. ^ Krauss, Aaron. "Programming Concepts: Type Introspection and Reflection". The Societa. Retrieved 14 September 2014. 
  5. ^ Joshi, Prateek. "What Is Metaprogramming? – Part 2/2". Perpetual Enigma. Retrieved 14 August 2014. 
  6. ^ for example, instance_eval in Ruby takes a string or an anonymous function. "Rdoc for Class: BasicObject (Ruby 1.9.3) - instance_eval". Retrieved 30 December 2011. 
  7. ^ Bicking, Ian. "The challenge of metaprogramming". Retrieved 21 September 2016. 
  8. ^ Terry, Matt. "Beware of Metaprogramming". Medium Corportation. Retrieved 21 August 2014. 
  9. ^ Chlipala, Adam (June 2010). "Ur: statically-typed metaprogramming with type-level record computation" (PDF). ACM SIGPLAN Notices. PLDI '10. 45 (6): 122–133. doi:10.1145/1809028.1806612. Retrieved 29 August 2012. 

External links[edit]