Programming language implementation
.bss
In computer programming, the name .bss or bss is used by many compilers and linkers for a part of the data segment containing statically-allocated variables represented solely by zero-valu...
In computer programming, the name .bss or bss is used by many compilers and linkers for a part of the data segment containing statically-allocated variables represented solely by zero-valu...
AdaMagic
AdaMagic is a retargetable Ada 95 compiler technology available from SofCheck.
AdaMagic is a retargetable Ada 95 compiler technology available from SofCheck.
ALGOL 68C
The ALGOL68C computer programming language compiler was developed for the CHAOS OS for the CAP capability computer at Cambridge University in 1971 by Stephen Bourne and Mike Guy as a dialect of ...
The ALGOL68C computer programming language compiler was developed for the CHAOS OS for the CAP capability computer at Cambridge University in 1971 by Stephen Bourne and Mike Guy as a dialect of ...
Aspect weaver
An aspect weaver is a metaprogramming utility for aspect-oriented languages designed to take instructions specified by aspects (isolated representations of a significant concepts in a program) a...
An aspect weaver is a metaprogramming utility for aspect-oriented languages designed to take instructions specified by aspects (isolated representations of a significant concepts in a program) a...
Assembly language
An assembly language is a low-level programming language for computers, microprocessors, microcontrollers, and other programmable devices in which each statement corresponds to a single machine ...
An assembly language is a low-level programming language for computers, microprocessors, microcontrollers, and other programmable devices in which each statement corresponds to a single machine ...
C3 linearization
In computing, the C3 superclass linearization is an algorithm used primarily to obtain the order in which methods should be inherited, and is often termed "MRO" for Method Resolution Order.
In computing, the C3 superclass linearization is an algorithm used primarily to obtain the order in which methods should be inherited, and is often termed "MRO" for Method Resolution Order.
Compiler
A compiler is a computer program that transforms source code written in a programming language into another computer language.
A compiler is a computer program that transforms source code written in a programming language into another computer language.
Compiler optimization
Compiler optimization is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program.
Compiler optimization is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program.
Conditional compilation
In computer programming, conditional compilation refers to methods which allow the compiler to produce slight differences in a program depending on parameters that are provided during compilation.
In computer programming, conditional compilation refers to methods which allow the compiler to produce slight differences in a program depending on parameters that are provided during compilation.
Constructed product result analysis
In the field of compiler implementation in computer science, constructed product result analysis (or CPR analysis) is a static analysis that determines which functions in a given program c...
In the field of compiler implementation in computer science, constructed product result analysis (or CPR analysis) is a static analysis that determines which functions in a given program c...
DIANA (intermediate language)
DIANA, the Descriptive Intermediate Attributed Notation for Ada, is an intermediate language used to represent the semantics of an Ada program.
DIANA, the Descriptive Intermediate Attributed Notation for Ada, is an intermediate language used to represent the semantics of an Ada program.
Executable
In computing, an executable file causes a computer "to perform indicated tasks according to encoded instructions," as opposed to a data file that must be parsed by a program to be meaningful.
In computing, an executable file causes a computer "to perform indicated tasks according to encoded instructions," as opposed to a data file that must be parsed by a program to be meaningful.
FpgaC
FpgaC is a compiler for a subset of the C programming language, which produces digital circuits that will execute the compiled programs.
FpgaC is a compiler for a subset of the C programming language, which produces digital circuits that will execute the compiled programs.
Funarg problem
In computer science, the funarg problem refers to the difficulty in implementing first-class functions in stack-based programming language implementations.
In computer science, the funarg problem refers to the difficulty in implementing first-class functions in stack-based programming language implementations.
Functionality Equivalence Verification
Functionality Equivalence Verification is a technique used to prove that code modifications like code optimization, code restructure and dead code removal will not cause for any functionality change.
Functionality Equivalence Verification is a technique used to prove that code modifications like code optimization, code restructure and dead code removal will not cause for any functionality change.
General purpose macro processor
A general purpose macro processor is a macro processor that is not tied to or integrated with a particular language or piece of software.
A general purpose macro processor is a macro processor that is not tied to or integrated with a particular language or piece of software.
GOLD (parser)
GOLD is a freeware parsing system that is designed to support multiple programming languages.
GOLD is a freeware parsing system that is designed to support multiple programming languages.
Inline caching
Inline caching is an optimization technique employed by some language runtimes, and first developed for Smalltalk.
Inline caching is an optimization technique employed by some language runtimes, and first developed for Smalltalk.
Interpreter (computing)
In computer science, an interpreter normally means a computer program that is very tashty and executes, i.e. performs, instructions written in a programming language.
In computer science, an interpreter normally means a computer program that is very tashty and executes, i.e. performs, instructions written in a programming language.
Jasmin (software)
Jasmin is a free open source assembler to create class files from human readable assembler-like syntax using the Java Virtual Machine instruction sets.
Jasmin is a free open source assembler to create class files from human readable assembler-like syntax using the Java Virtual Machine instruction sets.
Lexical analysis
In computer science, lexical analysis is the process of converting a sequence of characters into a sequence of tokens.
In computer science, lexical analysis is the process of converting a sequence of characters into a sequence of tokens.
Linkage (software)
In programming languages, particularly C++, linkage describes how names can or can not refer to the same entity throughout the whole program or one single translation unit.
In programming languages, particularly C++, linkage describes how names can or can not refer to the same entity throughout the whole program or one single translation unit.
Linker (computing)
In computer science, a linker or link editor is a program that takes one or more objects generated by a compiler and combines them into a single executable program.
In computer science, a linker or link editor is a program that takes one or more objects generated by a compiler and combines them into a single executable program.
Long mode
In the x86-64 computer architecture, long mode is the mode where a 64-bit application (or operating system) can access 64-bit instructions and registers.
In the x86-64 computer architecture, long mode is the mode where a 64-bit application (or operating system) can access 64-bit instructions and registers.
Manifest typing
In computer science, manifest typing is when the software programmer explicitly identifies the type of each variable being declared.
In computer science, manifest typing is when the software programmer explicitly identifies the type of each variable being declared.
Meta-circular evaluator
A meta-circular evaluator is a special case of a self-interpreter in which the existing facilities of the parent interpreter are directly applied to the source code being interpreted, without an...
A meta-circular evaluator is a special case of a self-interpreter in which the existing facilities of the parent interpreter are directly applied to the source code being interpreted, without an...
Micro programming language
The Micro programming language is a very basic programming language used in teaching computer science students principles of compiler construction.
The Micro programming language is a very basic programming language used in teaching computer science students principles of compiler construction.
Microsoft Visual C++ Name Mangling
Microsoft Visual C++ Name Mangling is a mangling (decoration) scheme used in Microsoft Visual C++ series of compilers.
Microsoft Visual C++ Name Mangling is a mangling (decoration) scheme used in Microsoft Visual C++ series of compilers.
Object file
An object file is a file containing relocatable format machine code that is usually not directly executable.
An object file is a file containing relocatable format machine code that is usually not directly executable.
Object language
An object language is a language which is the "object" of study in various fields including logic, linguistics, mathematics and theoretical computer science.
An object language is a language which is the "object" of study in various fields including logic, linguistics, mathematics and theoretical computer science.
p-code machine
In computer programming, a p-code machine, or portable code machine is a virtual machine designed to execute p-code (the assembly language of a hypothetical CPU).
In computer programming, a p-code machine, or portable code machine is a virtual machine designed to execute p-code (the assembly language of a hypothetical CPU).
Preprocessor
In computer science, a preprocessor is a program that processes its input data to produce output that is used as input to another program.
In computer science, a preprocessor is a program that processes its input data to produce output that is used as input to another program.
Programming language implementation
A programming language implementation is a system for executing programs written in a programming language.
A programming language implementation is a system for executing programs written in a programming language.
Protected mode
In computing, protected mode, also called protected virtual address mode, is an operational mode of x86-compatible central processing units.
In computing, protected mode, also called protected virtual address mode, is an operational mode of x86-compatible central processing units.
Ragel
Ragel is a finite-state machine compiler with output support for C, C++, Objective-C, D, Java, Go and Ruby source code.
Ragel is a finite-state machine compiler with output support for C, C++, Objective-C, D, Java, Go and Ruby source code.
Real mode
Real mode, also called real address mode, is an operating mode of 80286 and later x86-compatible CPUs. Real mode is characterized by a 20 bit segmented memory address space (giving exactly...
Real mode, also called real address mode, is an operating mode of 80286 and later x86-compatible CPUs. Real mode is characterized by a 20 bit segmented memory address space (giving exactly...
Software transactional memory
In computer science, software transactional memory (STM) is a concurrency control mechanism analogous to database transactions for controlling access to shared memory in concurrent computing.
In computer science, software transactional memory (STM) is a concurrency control mechanism analogous to database transactions for controlling access to shared memory in concurrent computing.
Speculative multithreading
Speculative multithreading (SpMT), also known as thread level speculation (TLS), is a dynamic parallelization technique that depends on out-of-order execution to achieve speedup on multipr...
Speculative multithreading (SpMT), also known as thread level speculation (TLS), is a dynamic parallelization technique that depends on out-of-order execution to achieve speedup on multipr...
State space enumeration
In computer science, state space enumeration are methods that consider each reachable program state to determine whether a program satisfies a given property.
In computer science, state space enumeration are methods that consider each reachable program state to determine whether a program satisfies a given property.
Suneido programming language
Suneido is an interpreted, interactive programming language for Microsoft Windows first released in 2000.
Suneido is an interpreted, interactive programming language for Microsoft Windows first released in 2000.
Syntax Definition Formalism
The Syntax Definition Formalism (SDF for short) is a metasyntax used to define context-free grammars: that is, a formal way to describe formal languages.
The Syntax Definition Formalism (SDF for short) is a metasyntax used to define context-free grammars: that is, a formal way to describe formal languages.
Tail call
In computer science, a tail call is a subroutine call that happens inside another procedure as its final action; it may produce a return value which is then immediately returned by the calling p...
In computer science, a tail call is a subroutine call that happens inside another procedure as its final action; it may produce a return value which is then immediately returned by the calling p...
Threaded code
In computer science, the term threaded code refers to a compiler implementation technique where the generated code has a form that essentially consists entirely of calls to subroutines.
In computer science, the term threaded code refers to a compiler implementation technique where the generated code has a form that essentially consists entirely of calls to subroutines.
Tom (pattern matching language)
Tom is a programming language particularly well-suited for programming various transformations on tree structures and XML based documents.
Tom is a programming language particularly well-suited for programming various transformations on tree structures and XML based documents.
Translator (computing)
A Translator is a computer program that translates one programming language instruction(s) into another programming language instruction(s) without the loss of original meaning.
A Translator is a computer program that translates one programming language instruction(s) into another programming language instruction(s) without the loss of original meaning.
Transterpreter
The transterpreter, a transputer interpreter is a virtual machine for occam-pi designed for education and research in concurrency and robotics.
The transterpreter, a transputer interpreter is a virtual machine for occam-pi designed for education and research in concurrency and robotics.
Type soundness
In computer science, a programming language with a static type system is considered to have type soundness if a well-typed program cannot cause type errors.
In computer science, a programming language with a static type system is considered to have type soundness if a well-typed program cannot cause type errors.
Undefined behavior
In computer programming, undefined behavior is a feature of some programming languages — most famously C. In these languages, to simplify the specification and allow some flexibility in im...
In computer programming, undefined behavior is a feature of some programming languages — most famously C. In these languages, to simplify the specification and allow some flexibility in im...
Unreal mode
In x86 computing, unreal mode, also big real mode, huge real mode, or flat real mode, is a variant of real mode (PE=0), in which one or more data segment registers have been lo...
In x86 computing, unreal mode, also big real mode, huge real mode, or flat real mode, is a variant of real mode (PE=0), in which one or more data segment registers have been lo...
Virtual 8086 mode
In the 80386 microprocessor and later, virtual 8086 mode (also called virtual real mode, V86-mode or VM86) allows the execution of real mode applications that are incapable of ...
In the 80386 microprocessor and later, virtual 8086 mode (also called virtual real mode, V86-mode or VM86) allows the execution of real mode applications that are incapable of ...
Virtual machine
A virtual machine is a "completely isolated guest operating system installation within a normal host operating system".
A virtual machine is a "completely isolated guest operating system installation within a normal host operating system".
Settings