Legal reduction

This article or the following section is not adequately provided with supporting documents ( e.g. individual evidence ). Information without sufficient evidence could be removed soon. Please help Wikipedia by researching the information and including good evidence.

Legal reduction is a term from theoretical computer science and describes an inverted legal derivation .

With bottom-up parsing , no derivatives are calculated from the start symbol of the grammar to the input, but reductions from the input to the start symbol. In connection with LR (k) parsing , one therefore speaks of a reverse right derivation

${\displaystyle \alpha \beta w\Leftarrow _{r}\alpha Aw}$

also from a reduction in the law, which was reduced according to the rule . ${\displaystyle A\rightarrow \beta }$

• ${\displaystyle \alpha }$ represents the parse stack below the handle.
• ${\displaystyle \beta }$ is the handle.
• ${\displaystyle w}$ is the part of the entry that has not yet been processed.