Compilers Wikipedia One-pass versus multi-pass ... - Saylor.org

Compilers Wikipedia One-pass versus multi-pass compilers Classifying compilers by number of passes has its background in the hardware resource limitations of computers. Compiling involves performing lots of work and early computers did not have enough memory to contain one program that did all of this work. So compilers were split up into smaller programs which each made a pass over the source (or some representation of it) performing some of the required analysis and translations. The ability to compile in a single pass has classically been seen as a benefit because it simplifies the job of writing a compiler and one-pass compilers generally perform compilations faster than multi-pass compilers. Thus, partly driven by the resource limitations of early systems, many early languages were specifically designed so that they could be compiled in a single pass (e.g., Pascal). In some cases the design of a language feature may require a compiler to perform more than one pass over the source. For instance, consider a declaration appearing on line 20 of the source which affects the translation of a statement appearing on line 10. In this case, the first pass needs to gather information about declarations appearing after statements that they affect, with the actual translation happening during a subsequent pass. The disadvantage of compiling in a single pass is that it is not possible to perform many of the sophisticated optimizations needed to generate high quality code. It can be difficult to count exactly how many passes an optimizing compiler makes. For instance, different phases of optimization may analyse one expression many times but only analyse another expression once. Splitting a compiler up into small programs is a technique used by researchers interested in producing provably correct compilers. Proving the correctness of a set of small programs often requires less effort than proving the correctness of a larger, single, equivalent program. 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 DOALLstatements).

Source URL: http://en.wikipedia.org/wiki/Compilers Saylor URL: http://www.saylor.org/courses/cs304/

Attributed to: Wikipedia

Saylor.org Page 1 of 2




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).

Bytecode compilers for Java, Python, and many more are also a subtype of this. Just-in-time compiler, 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.

Source URL: http://en.wikipedia.org/wiki/Compilers Saylor URL: http://www.saylor.org/courses/cs304/

Attributed to: Wikipedia

Saylor.org Page 2 of 2