Compiler

A compiler is a computer program that translates a series of statements written in one computer language (called the source code) into a resulting output in another computer language (often called the object or target language).

Most compilers translate a source code text file, written in a high level language to object code or machine language, e.g. into an executable .EXE or .COM file that may run on a computer or a virtual machine. However, translation from a low level language to a high level one is also possible; this is normally known as a Decompiler if it is reconstructing a high level language program which (could have) generated the low level language program. Compilers also exist which translate from one high level language to another, or sometimes to an intermediate language that still needs further processing; these are sometimes known as Cascaders.

Typical compilers output so-called object codes that basically contain machine code augmented by information about the name and location of entry points and external calls (to functions not contained in the object). A set of object files, which need not have all come from a single compiler provided that the compilers used share a common output format, may then be linked together to create the final executable which can be run directly by a user.

Several experimental compilers were developed in the 1950s, but the FORTRAN team led by John Backus at IBM is generally credited as having introduced the first complete compiler, in 1957. COBOL was an early language to be compiled on multiple architectures, in 1960. [http://www.interesting-people.org/archives/interesting-people/199706/msg00011.html]

The idea of compilation quickly caught on, and most of the principles of compiler design were developed during the 1960s.

A compiler is itself a computer program written in some implementation language . Early compilers were written in assembly language. The first self-hosting compiler — capable of compiling its own source code in a high-level language — was created for Lisp programming language by Hart and Levin at Massachusetts Institute of Technology in 1962 [http://www.ai.mit.edu/research/publications/browse/0000browse.shtml]. The use of high-level languages for writing compilers gained added impetus in the early 1970s when Pascal and C compilers were written in their own languages. Building a self-hosting compiler is a Bootstrapping problem -- the first such compiler for a language must be compiled either by a compiler written in a different language, or (as in Hart and Levin s Lisp compiler) compiled by running the compiler in an interpreter.

= Types of compilers =

== Native versus cross compiler ==

Most compilers are classified as either native or cross-compilers.

A compiler may produce binary output intended to run on the same type of computer and operating system ( platform ) as the compiler itself runs on. This is sometimes called a native-code compiler. Alternatively, it might produce binary output designed to run on a different platform. This is known as a cross compiler. Cross compilers are very useful when bringing up a new hardware platform for the first time (see bootstrapping). Cross compilers are necessary when developing software for microcontroller systems that have barely enough storage for the final machine code, much less a compiler. Compilers which are capable of producing both native and foreign binary output may be called either a cross-compiler or a native compiler depending on a specific use, although it would be more correct to classify them as a cross-compilers.

Interpreters are never classified as native or cross-compilers, because they don t output a binary representation of their input code.

Virtual machine compilers are typically not classified as either native or cross-compilers. However, if need be, they can be classified as one or the other, especially in the less usual cases where a compiler is running inside the same VM (making it a native compiler), or where a compiler is capable of producing an output for several different platforms, including a VM (making it a cross-compiler).

== One-pass versus multi-pass compilers ==

All compilers are either one-pass or multi-pass.

One-pass compilers, like early compilers for the Pascal programming language.

The compilation is done in one pass over the program source, hence the compilation is done very fast.

Multi-pass compilers, like 2-pass compilers or 3-pass compilers

The compilation is done step by step. Each steps uses the result of the previous step and creates another intermediate result. This can improve final performance at the cost of compilation speed.

While the typical multi-pass compiler outputs machine code from its final pass, there are several other types:

A source to source compiler is a type of compiler that takes a high level language as its input and outputs a high level language. For example, an automatic parallelizing compiler will frequently take in a high level language program as an input and then transform the code and annotate it with parallel code annotations (e.g. OpenMP) or language constructs (e.g. Fortran s DOALL statements).

Stage compiler that compiles to assembly language of a theoretical machine, like some Prolog implementations

This Prolog machine is also known as the Warren Abstract Machine (or WAM). Byte-code compilers for Java, Python (and many more) are also a subtype of this.

Just-in-time compilation, used by Smalltalk and Java systems, and also by Microsoft .Net s Common Intermediate Language (CIL)

Applications are delivered in bytecode, which is compiled to native machine code just prior to execution.

= Compiled versus interpreted languages =

Many people divide higher-level programming languages into compiled languages and interpreted languages. However, there is rarely anything about a language that requires it to be compiled or interpreted. Compilers and interpreters are implementations of languages, not languages themselves. The categorization usually reflects the most popular or widespread implementations of a language -- for instance, BASIC is thought of as an interpreted language, and C a compiled one, despite the existence of BASIC compilers and C interpreters.

There are exceptions; some language specifications assume the use of a compiler (as with C), or spell out that implementations must include a compilation facility (as with Common Lisp). Some languages have features that are very easy to implement in an interpreter, but make writing a compiler much harder; for example, some BASIC dialects and many scripting languages are capable of constructing arbitrary source code at runtime with regular string operations, and then executing that code by passing it to a special evaluation function.

= Compiler design =

In the past, compilers were divided into many passesCompiler#Notes to save space. A pass in this context is a run of the compiler through the source code of the program to be compiled, resulting in the building up of the internal data of the compiler (such as the evolving symbol table and other assisting data). When each pass is finished, the compiler can free the internal data space needed during that pass. This multipass method of compiling was useful in the early days of computing due to the small main memories of host computers relative to the source code and data.

Many modern compilers share a common two stage design. The front end translates the source language into an intermediate representation. The second stage is the back end, which works with the internal representation to produce code in the output language. The front end and back end may operate as separate passes, or the front end may call the back end as a Subroutine, passing it the intermediate representation.

This approach mitigates complexity separating the concerns of the front end, which typically revolve around language semantics, error checking, and the like, from the concerns of the back end, which concentrates on producing output that is both efficient and correct. It also has the advantage of allowing the use of a single back end for multiple source languages, and similarly allows the use of different back ends for different targets.

Often, optimizers and error checkers can be shared by both front ends and back ends if they are designed to operate on the intermediate language that a front-end passes to a back end. This can let many compilers (combinations of front and back ends) reuse the large amounts of work that often go into code analyzers and optimizers.

Certain languages, due to the design of the language and certain rules placed on the declaration of variables and other objects used, and the predeclaration of executable procedures prior to reference or use, are capable of being compiled in a single pass. The Pascal programming language is well known for this capability, and in fact many Pascal compilers are themselves written in the Pascal language because of the rigid specification of the language and the capability to use a single pass to compile Pascal language programs.

= Compiler front end =

The compiler front end consists of multiple phases itself, each informed by formal language theory:

# Lexical analysis - breaking the source code text into small pieces ( tokens or terminals ), each representing a single atomic unit of the language, for instance a keyword, identifier or symbol. The token language is typically a regular language, so a finite state automaton constructed from a regular expression can be used to recognize it. This phase is also called lexing or scanning. # Syntax analysis - Identifying syntactic structures of source code. It only focuses on the structure. In other words, it identifies the order of tokens and understands hierarchical structures in code. This phase is also called parsing. # Semantic analysis is to recognize the meaning of program code and start to prepare for output. In that phase, type checking is done and most of compiler errors show up. # Intermediate representation - an equivalent to the original program is transformed to an intermediate representation. This can be a datastructure (typically a Tree data structure or Graph (data structure)) or an Intermediate language.

= Compiler back end =

While there are applications where only the compiler front end is necessary, such as static language verification tools, a real compiler hands the intermediate representation generated by the front end to the back end, which produces a functional equivalent program in the output language. This is done in multiple steps: # Compiler analysis - This is the process to gather program information from the intermediate representation of the input source files. Typical analysis are variable define-use and use-define chain, data dependence analysis, alias analysis etc. Accurate analysis is the base for any compiler optimizations. The call graph and control flow graph are usually also built during the analysis phase. # Compiler optimization - the intermediate language representation is transformed into functionally equivalent but faster (or smaller) forms. Popular optimizations are inline expansion, dead code elimination, constant propagation, loop transformation, register allocation or even auto parallelization. # Code generation - the transformed intermediate language is translated into the output language, usually the native machine language of the system. This involves resource and storage decisions, such as deciding which variables to fit into registers and memory and the selection and scheduling of appropriate machine instructions along with their associated addressing modes (see also Sethi-Ullman algorithm).

= Notes =

# A pass has also been known as a parse in some textbooks. The idea is that the source code is parsed by gradual, iterative refinement to produce the completely translated object code at the end of the process. There is, however, some dispute over the general use of parse for all those phases (passes), since some of them, e.g. object code generation, are arguably not regarded to be parsing as such.

= References =

(ISBN 0201100886) is considered to be the standard authority on compiler basics, and makes a good primer for the techniques mentioned above. (It is often called the Dragon Book because of the picture on its cover showing a Knight of Programming fighting the Dragon of Compiler Design.) [http://www.aw.com/catalog/academic/product/0,4096,0201100886,00.html External link to publisher s catalog entry]

is an unusually helpful book, being one of the few that adequately explains the recursive generation of machine instructions from a parse-tree. Having learnt his subject in the early days of mainframes and minicomputers, the author has many useful insights that more recent books often fail to convey.

=See also=

List of important publications in computer science#Compilers for programming languages

*Assemblers *compiler construction *Interpreters: **interpreter (computer software) **abstract interpretation *Linkers *parsing: **Top-down parsing **Bottom-up parsing **Semantic analysis ***attribute grammar *Semantics encoding *error avalanche *recompilation *Decompiler *Just-in-time compiler *Loop nest optimization *Meta-Compilation *preprocessor *parallel compilers

=External links=

*[http://codepedia.com/compile What is compile ] from the developer s encyclopedia

*[http://www.kegel.com/crosstool/ Building and Testing gcc/glibc cross toolchains] *[http://citeseer.ist.psu.edu/csq=compiler Citations from CiteSeer] *[http://compilers.iecc.com/ The comp.compilers newsgroup and RSS feed] *[http://compilers.iecc.com/crenshaw/ Let s Build a Compiler by Jack Crenshaw (1988 to 1995)] a non-technical introduction to compiler construction *[http://www.gtoal.com/software/CompilersOneOhOne Simple compiler source] from the [http://groups.yahoo.com/group/compilers101/ Compilers 101] group. One page, easy to follow. *[http://www.tutorial-reports.com/computer-science/parallel-compiler/ Parallel Compilers]