US 2026/0104869 A1 · LOOP POINTERS FOR RECURSIVE TO ITERATIVE TRANSFORMATION

Abstract

A Loop Pointer (LP) construct is disclosed for identifying terms in a recursive expression operated with an iterator. A Loop Pointer Variable (LPV) is assigned the current value of the recursive expression comprising one or more previous values or prior terms of the LPV. The prior terms or values are identified in source code by a loop pointer construct modifying a reference to the loop pointer variable. A compiler transforms the recursive expression into an equivalent iterative computation and generates instructions to compute the current value at runtime. An access to the iterator construct output can request the terminal value of the loop pointer variable or a sequence of one or more of a series of updated loop pointer variables.

Claims16

Dependent claims

A method of compiling source code comprising:

encountering in the source code an iterator construct comprising a recursive expression operative to compute a current value of a variable based on one or more preceding values of the variable, wherein each of the one or more preceding values are identified in the recursive expression by a reference to the variable, each reference modified by a pointer construct identifying the respective preceding value;
and
generating instructions configured to compile to executable instructions to compute the current value at runtime by transforming the recursive expression into an equivalent iterative computation.

A method of compiling source code comprising:

encountering in the source code an iterator construct comprising a statement defining computation of a current value of a variable, the statement including one or more references to the variable modified by a pointer construct, each pointer construct identifying one of the previous values of the variable for use in computation of the current value of the variable;
generating instructions to access each of the one or more identified variable values for use in computation of the current value of the variable at runtime;
encountering in the source code an access to the output of the iterator construct signifying a sequence of one or more previous variable values are to be returned;
generating instructions to allocate storage locations sufficient to maintain the sequence of one or more previous values;
generating instructions to, responsive to an update of the current value of the variable in the iterator construct at runtime, store the current value in the allocated storage locations;
and
generating instructions configured to return the sequence of values stored in the allocated storage locations at runtime subsequent to completion of iterator instructions compiled from the iterator construct.

4 more elements

Dependencies are inferred from the claim text.

Facts

Application

19/367,237Filed 23 Oct 2025

Priority

IN 2024410815566 Oct 2024

Published

16 Apr 2026

Term ends

Not estimatedThe source records don’t support an estimate.

Classification5 codes

G06F 8/434
Dependency analysis; Data or control flow analysis: pointers; Aliasing
G06F 8/443
Encoding: optimisation
G06F 8/441
Encoding: register allocation; Assignment of physical memory space to logical memory space
G06F 8/452
Code distribution: loops

Loop pointers for recursive to iterative transformation

Life of this patent

Loop pointers for recursive to iterative transformation

Life of this patent

Abstract

Claims16