rewrite [rewriting] rule
Смотреть что такое "rewrite [rewriting] rule" в других словарях:
Rewriting — In mathematics, computer science and logic, rewriting covers a wide range of potentially non deterministic methods of replacing subterms of a formula with other terms. What is considered are rewrite systems (also rewriting systems, or term… … Wikipedia
Rewrite — may refer to one of the following: *Rewrite (programming), the act or result of writing new source code to replace an existing program *Rewrite man, a journalist who works in the office, taking information reported by others and crafting it into… … Wikipedia
Rewrite engine — In Wikipedia and other MediaWiki sites, see MediaWiki Manual:Short URL. A rewrite engine is software that modifies a web URL s appearance (URL rewriting). Rewritten URLs (sometimes known as short, fancy URLs, or search engine friendly SEF) are… … Wikipedia
Rewrite rule — In mathematics, linguistics and computer science, a rewrite rule ( phrase structure rule or production ) in generative grammar is a rule of the form A → X where A is a syntactic category label, such as noun phrase or sentence, and X is a sequence … Wikipedia
Graph rewriting — In graph theory, graph rewriting is a system of rewriting for graphs, i.e. a set of graph rewrite rules of the form p: L ightarrow R, with L being called pattern graph (or left hand side) and R being called replacement graph (or right hand side… … Wikipedia
Abstract rewriting machine — The Abstract Rewriting Machine (ARM) is a virtual machine which implements term rewriting for minimal term rewriting systems. Minimal term rewriting systems are left linear term rewriting systems in which each rule takes on one of six forms:… … Wikipedia
Abstract Rewriting Machine — The Abstract Rewriting Machine (ARM) is a virtual machinewhich implements term rewriting for minimal term rewriting systems. Minimal term rewriting systems are left linear termrewriting systems in which each rule takes on one of six… … Wikipedia
Normal form (abstract rewriting) — In abstract rewriting, a normal form is an element of the system which cannot be rewritten any further. Stated formally, for some reduction relation ⋅ → ⋅ over X a term t in X is a normal form if there does not exist a term t′ in X such … Wikipedia
Normal form (term rewriting) — In considering rewriting systems, a normal form is an element of the system which cannot be rewritten any further. Consider the basic term rewriting system with reduction rule ρ : g ( x , y ) → x . The term g ( g (4, 2), g (3, 1)) has the… … Wikipedia
Normalization property (abstract rewriting) — In mathematical logic and theoretical computer science, a rewrite system has the strong normalization property (in short: the normalization property) if every term is strongly normalizing; that is, if every sequence of rewrites eventually… … Wikipedia
Controlled grammar — Controlled grammars[1] are a class of grammars that extend, usually, the context free grammars with additional controls on the derivations of a sentence in the language. A number of different kinds of controlled grammars exist, the four main… … Wikipedia
