rewrite rule


Also found in: Wikipedia.

rewrite rule

n
(Linguistics) generative grammar another name for phrase-structure rule
Collins English Dictionary – Complete and Unabridged, 12th Edition 2014 © HarperCollins Publishers 1991, 1994, 1998, 2000, 2003, 2006, 2007, 2009, 2011, 2014
Mentioned in ?
References in periodicals archive ?
A rewrite rule S is an expression of [alpha] [right arrow] [beta], where [alpha] and [beta] are in [SIGMA]*.
Rewriting logic extends this equational theory by adding the notion of rewrite rule, which represents transitions between states.
This rewrite rule says that for any incoming request from a user that looks like the part on the left, take the part in parentheses (which means "matching any number of characters") and send it to the internal path on the right, the one with the CGI script.
Example (7a): Applied ~[?*] <- $[ [ %+Applied ]{4,} ]; -bofelelela -el-el-el- tie securely by winding around Example (7b): Causative ~[?*] <- $[ [ %+Causative ]{4,} ]; -bontshisisa -is-is-is- grasp/comprehend fully The filtering rule in example (7a) is a rewrite rule that takes any combination of four or more applied extensions and converts these into the empty language.
Informally, narrowing unifies a term with the left-hand side of a rewrite rule and fires the rule on the 90 term.
A graph rewrite rule r = (L, R) consists of a left-hand side [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] and a right-hand side R [element of] [SG.sup.+].
Graphical rewrite rule analogies: Avoiding the inherit or copy & paste reuse dilemma.
In deduction modulo, the axiom of inclusion can be seen as a computation rule and therefore replaced by the rewrite rule a [subset or equal to] b [right arrow] [for all]x (x [member of] a [right arrow] x [member of] b).
Second, after the application of a rewrite rule, the subterms in the reduct that are innermost with respect to the pattern at the right-hand side of the rewrite rule are known to be irreducible, which avoids repeated inspection of such structures.
A rewrite rule is called left-linear if it does not contain multiple occurrences of the same variable in its left-hand side.
Figure 10 shows a sample C program along with its translation according to NewYacc rewrite rule. In general, only the subset of productions in the grammar that are concerned with entire statements need have rule translations associated with them.
Just rewrite rules #EngvNZL #ICCWC2019 #icccwcfinal" another tweeted.