Compiler construction

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. The term parsing comes from Latin pars (orationis), meaning part (of speech).

metasyntax notation for context-free grammars, developed by John Backus and Peter Naur for the ALGOL 60 report (1963); foundational to formal language specification in computer science

computing process of parsing a sequence of characters into a sequence of tokens

formal grammar whose production rules can be applied to a nonterminal symbol regardless of its context

dynamically compiling bytecode to machine code during runtime

family of metasyntax notations, any of which can be used to express a context-free grammar

data structure or code used internally by a compiler or virtual machine to represent source code. An IR is designed to be conducive for further processing, such as optimization and translation

In computer science, a compiler-compiler or compiler generator is a programming tool that creates a parser, interpreter, or compiler from some form of formal description of a programming language and machine.

process by which a compiler's code generator converts some intermediate representation of source code into a form that can be readily executed by a machine

graphical representation of a computer program or algorithm

time during which source code is validated and converted to machine code by a compiler

way in which data is arranged and accessed in computer memory

process of writing a compiler (or assembler) in the source programming language that it intends to compile

representation of intermediate code used by compilers

programming language feature that allows manipulating functions like other values

file containing relocatable format machine code

computer science compiler technology textbook

formal way to define attributes for the productions of a formal grammar, associating these attributes with values

compiler that tries to minimize or maximize some attributes of an executable computer program

code sequence with no branches except at entry and exit

section in the source code of a program which is executed but whose result is never used in any other computation. The execution of dead code wastes computation time and memory

programming concept: multiple names for the same data location

programming languages concept

syntactic structure independent of any particular representation or encoding

intermediate language for parallel compute and graphics by Khronos Group

phase of a software build process in which compiled modules are combined into a single unit

function implemented by the compiler

technique of translating the machine code of one CPU or platform into the native machine code of another for emulation

one of the two main notation techniques for context-free grammars in computer science

Algorithm for minimising register usage

control-flow graph which represents calling relationships between subroutines in a computer program

Book by Alfred Aho and Jeffrey Ullman

compiler construction difficulty in supporting first-class functions that capture variables without dynamic memory allocation

technique used to optimize the execution of a program at runtime

order of accesses to computer memory by a CPU

data structure

ultimate input to a C or C++ compiler from which an object file is generated

compiler transforming or optimizing already-compiled code