subexpressions

Do not use an increment or decrement operator on the same object in more than two subexpressions of the same expression.

This optimization removes invariant subexpressions from the body of a loop.

When all parenthetical subexpressions have been evaluated, the rest of the expression is evaluated.

The first of these "non-reference" child subexpressions just says "match something that looks like http or that looks like ftp or . . . " .

The buffer numbers in which the sub matches are stored begin at 1 and continue up to a maximum of 99 subexpressions.

Simplify expressions by assigning common subexpressions to temporary variables.

For global common subexpression optimization, the compiler searches entire functions for common subexpressions.

For local common subexpression optimization, the compiler examines short sections of code for common subexpressions.

Sets of parentheses match "subexpressions" that can potentially make up part of the replacement pattern.

Provides information on grouping constructs that cause a regular expression to capture groups of subexpressions.

The following table lists subexpressions that modify a regular expression.

Subexpressions may be captured for later use.

It can be composed of multiple subexpressions that use the different relational operators supported in Python.

And the subexpressions can be combined using the and, or, and not logical operators.

This optimization allows the compiler to store frequently used variables and subexpressions in registers;

And the ability of regular expressions to capture subexpressions in order to move version numbers directly from the