Category:Compiler construction
![]() | Computing portal |
Here is a list of articles in the category Compiler construction of the Computing portal that unifies foundations of mathematics and computations using computers.
![]() |
Wikimedia Commons has media related to Compiler construction. |
Subcategories
This category has the following 3 subcategories, out of 3 total.
C
I
P
Pages in category "Compiler construction"
The following 72 pages are in this category, out of 72 total.
A
- Abstract syntax (computing)
- Affix grammar (computing)
- Aliasing (computing) (computing)
- Array access analysis (computing)
- Aspect weaver (software)
- Attribute grammar (computing)
B
- Backus–Naur form (computing)
- Basic block (computing)
- Extended basic block (computing)
- Binary recompiler (computing)
- Bootstrapping (compilers) (computing)
C
- Call graph (computing)
- Code generation (compiler) (computing)
- Compile time (computing)
- Compile time function execution (computing)
- Compiler (computing)
- Compiler correctness (computing)
- Compiler Description Language (computing)
- Compiler-compiler (computing)
- Compilers: Principles, Techniques, and Tools
- Context-free grammar (computing)
- Control flow graph (computing)
- Control table (computing)
- Control-flow graph (computing)
D
- Data structure alignment (computing)
- Dead code (computing)
- Dominator (graph theory) (computing)
- Dynamic compilation (computing)
- Dynamic recompilation (computing)
E
- ECLR-attributed grammar (computing)
- Extended Backus–Naur form (computing)
F
- First-class function (computing)
- Funarg problem (computing)
G
- GNU cflow (software)
I
- Intermediate representation (computing)
- Intrinsic function (computing)
J
- Just-in-time compilation (computing)
L
- L-attributed grammar (computing)
- Lambda lifting (computing)
- Lexical analysis (computing)
- Link time (computing)
- Literal pool (computing)
- LR-attributed grammar (computing)
M
- Man or boy test (computing)
- Manifest expression (computing)
- Memory model (programming) (computing)
- Memory ordering (computing)
- Metacompilation (computing)
N
- Name mangling (computing)
- Name resolution (programming languages) (computing)
- Normalized loop (computing)
O
- Object file (computing)
- Optimizing compiler (computing)
- Overhead code (computing)
P
- Parsing (computing)
- Principles of Compiler Design (computing)
S
- S-attributed grammar (computing)
- Semantic analysis (compilers) (computing)
- Semantic dictionary encoding (computing)
- Sethi–Ullman algorithm (computing)
- Standard Portable Intermediate Representation (software)
- Static build (computing)
- String grammar (computing)
- Syntax-directed translation (computing)
T
- Three-address code (computing)
- Tombstone diagram (computing)
- Trace scheduling (computing)
- Trace tree (computing)
- Tracing just-in-time compilation (computing)
- Translation unit (programming) (computing)
- Translational Backus–Naur form (computing)
U
- Unparser (computing)