# Recursive Rewriting of Expressions

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Often a large expression has many subexpressions in common. Recursive rewriting consists of replacing each common part of an expression with a symbol instead of writing out the part explicitly. This shows the overall structure at different levels.

[more]
Contributed by: Enrique Zeleny (August 2015)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

This example use a root of a fourth-degree polynomial. A possible application is to shorten large arithmetic expressions to speed up their numerical evaluation. Based on an idea in [1].

Reference

[1] M. Trott, *The Mathematica GuideBook for Programming*, New York: Springer-Verlag, 2004.

## Permanent Citation

"Recursive Rewriting of Expressions"

http://demonstrations.wolfram.com/RecursiveRewritingOfExpressions/

Wolfram Demonstrations Project

Published: August 3 2015