Discover published sets by community

A code optimization technique that examines and improves small parts of machine code or intermediate code.

The process of recognizing and evaluating constant expressions at compile time rather than computing them at runtime.

A technique used for gathering information about the possible set of values calculated at various points in a computer program.

An intermediate code representation that expresses operations in a structured four-part format.

A compilation approach where code is compiled during execution (runtime) rather than beforehand.

The automatic process of memory deallocation for objects that are no longer accessible by a program.

A technique that allows for some kinds of function calls to be replaced by a single jump instruction, reducing the overhead of recursion.

The process of substituting the values of known constants in expressions at compile time.

A property of an intermediate representation (IR), which requires each variable to be assigned exactly once and defined before use.

The smallest individual units in a program, created in the lexical analysis phase, such as keywords, identifiers, and operators.

A hierarchical structure that represents the syntax of the source code as derived from a grammar.

Data structure used by a compiler to keep track of information about language constructs like variables, functions, classes, etc.

A representation, used in program analysis, that depicts all paths that might be traversed through a program during its execution.

After semantic analysis, the compiler generates a low-level or intermediate representation of the source code.

The process of improving intermediate code so it runs faster and consumes fewer resources.

The process of converting intermediate code into target machine code.

An intermediate code form used by compilers where each instruction contains at most three operands.

The compiler phase that checks for semantic errors, ensures type compatibility, and collects type information.

A method used in compilers to manage jumps to forward locations or unresolved addresses in the code.

The process of increasing the execution speed and efficiency of loops in a program.

An optimization technique that involves replacing a function call with the body of the called function.

The phase where tokens are organized into a parse tree which represents the grammatical structure of program code.

A method of determining if a pointer or a reference to a resource can be accessed beyond the scope it was created in.

A straight-line code sequence with no branches in except to the entry and no branches out except at the exit.

An optimization that removes code which does not affect the program results (such as instructions following an unconditional jump).

The process of assigning a large number of target program variables onto a small number of CPU registers.

Converting a variable from one data type to another, for example, an integer to a float.

A tree representation of the abstract syntactic structure of source code written in a programming language.

The first phase of a compiler where the source code is converted into tokens.