Metraipolis › archive › dc_2bfb76d5ae5f
Production (computer science) — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Production_(computer_science)
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T00:07:48.932Z
- SHA-256 of the archived text
b04a28cacd34df18010e24703c937b8d9c96edae4e2a2c7f66eacbcbc0e81f53- Stable URL of this page
https://metraipolis.com/documento/dc_2bfb76d5ae5f
How to cite
Production (computer science) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Production_(computer_science) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_2bfb76d5ae5f (Metraipolis archive dc_2bfb76d5ae5f, sha256 b04a28cacd34df18010e24703c937b8d9c96edae4e2a2c7f66eacbcbc0e81f53)
BibTeX
@misc{dc2bfb76d5ae5f,
title = {Production (computer science) — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Production_(computer_science)},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_2bfb76d5ae5f; sha256 b04a28cacd34df18010e24703c937b8d9c96edae4e2a2c7f66eacbcbc0e81f53},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Production_(computer_science). Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In computer science, a production or production rule is a rewrite rule that replaces some symbols with other symbols. A finite set of productions P {\displaystyle P} is the main component in the specification of a formal grammar (specifically a generative grammar). In such grammars, a set of productions is a special case of relation on the set of strings V ∗ {\displaystyle V^{*}} (where ∗ {\displaystyle {}^{*}} is the Kleene star operator) over a finite set of symbols V {\displaystyle V} called a vocabulary that defines which non-empty strings can be substituted with others. The set of productions is thus a special kind subset P ⊂ V ∗ × V ∗ {\displaystyle P\subset V^{*}\times V^{*}} and productions are then written in the form u → v {\displaystyle u\to v} to mean that ( u , v ) ∈ P {\displaystyle (u,v)\in P} (not to be confused with → {\displaystyle \to } being used as function notation, since there may be multiple rules for the same u {\displaystyle u} ). Given two subsets A , B ⊂ V ∗ {\displaystyle A,B\subset V^{*}} , productions can be restricted to satisfy P ⊂ A × B {\displaystyle P\subset A\times B} , in which case productions are said to be of the form A → B {\displaystyle A\to B} . Different choices and constructions of A , B {\displaystyle A,B} lead to different types of grammars. In general, any production of the form u → ϵ , {\displaystyle u\to \epsilon ,} where ϵ {\displaystyle \epsilon } is the empty string (sometimes also denoted λ {\displaystyle \lambda } ), is called an erasing rule, while productions that would produce strings out of nowhere, namely of the form ϵ → v , {\displaystyle \epsilon \to v,} are never allowed. In order to allow the production rules to create meaningful sentences, the vocabulary is partitioned into (disjoint) sets Σ {\displaystyle \Sigma } and N {\displaystyle N} providing two different roles: Σ {\displaystyle \Sigma } denotes the terminal symbols known as an alphabet containing the symbols allowed in a sentence; N {\displaystyle N} denotes nonterminal symbols, containing a distinguished start symbol S ∈ N {\displaystyle S\in N} , that are needed together with the production rules to define how to build the sentences. In the most general case of an unrestricted grammar, a production u → v {\displaystyle u\to v} , is allowed to map arbitrary strings u {\displaystyle u} and v {\displaystyle v} in V {\displaystyle V} (terminals and nonterminals), as long as u {\displaystyle u} is not empty. So unrestricted grammars have productions of the form V ∗ ∖ { ϵ } → V ∗ {\displaystyle V^{*}\setminus \{\epsilon \}\to V^{*}} or if we want to disallow changing finished sentences V ∗ N V ∗ = ( V ∗ ∖ Σ ∗ ) → V ∗ {\displaystyle V^{*}NV^{*}=(V^{*}\setminus \Sigma ^{*})\to V^{*}} , where V ∗ N V ∗ {\displaystyle V^{*}NV^{*}} indicates concatenation and forces a non-terminal symbol to always be present on the left-hand side of the productions, and ∖ {\displaystyle \setminus } denotes set minus or set difference. If we do not a
Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; categoria «Natural language processing»).
Fonte: Wikipedia in inglese, voce «Production (computer science)» — https://en.wikipedia.org/wiki/Production_(computer_science)
Wikidata Q2111781: «in computer science, a rewrite rule specifying a substitution that can be recursively performed to generate new sequences» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2111781
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Production_(computer_science)?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1369265373, consultata il 2026-10-05T23:28:27.631Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: ac0d19fd3da1245514e725cc3dda6cc01e449220a13f95e2de6c3231c155abee