Techniques that turn source code into something a machine can run. The group includes the compiler itself, the stages that read text into tokens and analyse its grammar, the inference of types without written annotations, the assignment of variables to a limited number of processor registers, and just-in-time compilation, which translates code while a program is already running instead of before it starts.
Browse By
Compiler and Language Implementation Techniques
Filter Results13 entries
Sources
Free On-line Dictionary of Computing: Garbage Collection
Free On-line Dictionary of ComputingHas Member: Garbage Collection, Dictionary entryQuote, Has Member: Garbage Collection, Dictionary entry
The process by which dynamically allocated storage is reclaimed during the execution of a program
Data-flow analysis (Wikipedia)
Has Member: Data-flow analysis, Lead sectionQuote, Has Member: Data-flow analysis, Lead section
Data-flow analysis is a technique for gathering information about the possible set of values calculated at various points in a computer program.
Loop-invariant code motion (Wikipedia)
Has Member: Loop-invariant code motion, Lead sentenceQuote, Has Member: Loop-invariant code motion, Lead sentence
Loop-invariant code motion (also called hoisting or scalar promotion) is a compiler optimization that performs this movement automatically.
Short-circuit evaluation (Wikipedia)
Has Member: Short-circuit evaluation, Lead sectionQuote, Has Member: Short-circuit evaluation, Lead section
the semantics of some Boolean operators in some programming languages in which the second argument is executed or evaluated only if the first argument does not suffice to determine the value of the expression
Inline expansion (Wikipedia)
Has Member: Inline expansion, Lead sectionQuote, Has Member: Inline expansion, Lead section
is a manual or compiler optimization that replaces a function call site with the body of the called function
Constant folding (Wikipedia)
Has Member: Constant folding, Lead sectionQuote, Has Member: Constant folding, Lead section
evaluate expressions whose values are known at compile time and replaces them with the computed result
Software pipelining (Wikipedia)
Has Member: Software pipelining, Lead sectionQuote, Has Member: Software pipelining, Lead section
software pipelining is a technique used to optimize loops, in a manner that parallels hardware pipelining.
Wikipedia: Compiler
Wikimedia FoundationHas Member: Compiler, LeadQuote, Has Member: Compiler, Lead
In computing, a compiler is software that translates computer code written in one programming language (the source language) into another language (the target language).
Lexical analysis - Wikipedia
Has Member: Lexical Analysis, LeadQuote, Has Member: Lexical Analysis, Lead
Lexical tokenization is conversion of a text into (semantically or syntactically) meaningful lexical tokens belonging to categories defined by a "lexer" program.
Parsing - Wikipedia
Has Member: Parsing, LeadQuote, Has Member: Parsing, Lead
Parsing, syntax analysis, or syntactic analysis is a process of analyzing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal grammar by breaking it into parts.
Just-in-time compilation - Wikipedia
Has Member: Just-In-Time Compilation, LeadQuote, Has Member: Just-In-Time Compilation, Lead
Just-in-time (JIT) compilation (also dynamic translation or run-time compilations) is compilation of computer code during execution of a program at run time rather than before execution.
Register allocation - Wikipedia
Has Member: Register Allocation, LeadQuote, Has Member: Register Allocation, Lead
In compiler optimization, register allocation is the process of assigning local automatic variables and expression results to a limited number of processor registers.
Type inference - Wikipedia
Has Member: Type Inference, LeadQuote, Has Member: Type Inference, Lead
In type theory, type inference (sometimes called type reconstruction) is the automatic detection of the type of an expression.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.