Partial-redundancy elimination
id:
partial-redundancy-elimination-289-8178842
title:
Partial-redundancy elimination
text:
In compiler theory, partial redundancy elimination (PRE) is a compiler optimization that eliminates expressions that are redundant on some but not necessarily all paths through a program. PRE is a form of common subexpression elimination. An expression is called partially redundant if the value computed by the expression is already available on some but not all paths through a program to that expression. An expression is fully redundant if the value computed by the expression is available on all
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Partial-redundancy_elimination
date created:
date modified:
2022-08-25T22:44:17Z
main entity:
{"identifier":"Q7140383","url":"https://www.wikidata.org/entity/Q7140383"}
image:
fields total:
13
integrity:
13