Compiler theory Compiler theory In computing, a basic block is a straight-line piece of code without any jumps or jump targets in the middle; jump targets, if any, start a block, and jumps end a block. Basic blocks are usually the basic unit to which compiler optimizations are applied in compiler theory. Basic blocks form the vertices or nodes in a control flow graph. ...more on Wikipedia about "Basic block"
A control flow graph (CFG) is an abstract data structure used in compilers. It is an abstract representation of a procedure or program, maintained internally by a compiler. Each node in the graph represents a basic block, i.e. a straight-line piece of code without any jumps or jump targets; jump targets start a block, and jumps end a block. Directed edges are used to represent jumps in the control flow. There are, in most presentations, two specially designated blocks: the entry block, through which control enters into the flow graph, and the exit block, through which all control flow leaves. ...more on Wikipedia about "Control flow graph"
In compiler theory, an intrinsic function is a function available in a given language whose implementation is handled specially by the compiler. Typically, it substitutes a sequence of automatically-generated instructions for the original function call, similar to an inline function. Compilers that implement intrinsic functions generally enable them only when the user has requested optimization, falling back to a default implementation provided by the language runtime environment otherwise. ...more on Wikipedia about "Intrinsic function"
In computer science, and specifically in compiler and assembler design, a literal pool is a lookup table used to hold literals during assembly and execution. ...more on Wikipedia about "Literal pool"
In compiler theory, loop dependence analysis is the task of determining whether statements within a loop body form a dependence, almost always with respect to array access and modification. For a normalized loop: ...more on Wikipedia about "Loop dependence analysis"
The man or boy test was proposed by computer scientist Donald Knuth as a means of evaluating implementations of the ALGOL programming language. The aim of the test was to separate compilers that correctly implemented scoping and call by name (the "men") from those that did not (the "boys"). ...more on Wikipedia about "Man or boy test"
In computer science, object file or object code is an intermediate representation of code generated by a compiler after it processes a source code file. Object files contain compact, pre-parsed code, often called binaries, that can be linked with other object files to generate a final executable or code library. An object file is mostly machine code (code directly executed by a computer's CPU). ...more on Wikipedia about "Object file"
The relocation table is a list of pointers created by the linker and linked into the MSDOS .exe file. The relocation table tells the loader where these segments can be found in program image loaded into memory. ...more on Wikipedia about "Relocation table"
A static build is a compiled version of a program which has been statically linked against libraries. ...more on Wikipedia about "Static build"
In compiler theory, static single assignment form, more often abbreviated SSA form or just SSA, is an intermediate representation (IR) in which every variable is assigned exactly once. Existing variables in the original IR are split into versions, new variables typically indicated by the original name with a subscript, so that every definition gets its own version. In SSA form, use-def chains are explicit and each contains a single element. ...more on Wikipedia about "Static single assignment form"
In computer science, a symbol table is a data structure used by a language translator such as a compiler or interpreter, where each symbol in a program's source code is associated with information such as location, type and scope level. ...more on Wikipedia about "Symbol table"
Use-define chains are standard data structures that model the relationship between the definitions of variables, and their uses in a sequence of assignments. ...more on Wikipedia about "Use-define chain"
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Shortopedia article about "Compiler theory".
| MAIN PAGE | MAIN INDEX | CONTACT US |