How to resolve the algorithm Generator/Exponential step by step in the PL/I programming language

Published on 12 May 2024 09:40 PM
#Pl/i

How to resolve the algorithm Generator/Exponential step by step in the PL/I programming language

Table of Contents

Problem Statement

A generator is an executable entity (like a function or procedure) that contains code that yields a sequence of values, one at a time, so that each time you call the generator, the next value in the sequence is provided. Generators are often built on top of coroutines or objects so that the internal state of the object is handled “naturally”. Generators are often used in situations where a sequence is potentially infinite, and where it is possible to construct the next value of the sequence with only minimal state.

Note that this task requires the use of generators in the calculation of the result.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Generator/Exponential step by step in the PL/I programming language

Source code in the pl/i programming language

Generate: procedure options (main);   /* 27 October 2013 */
        declare j fixed binary;
        declare r fixed binary;

        /* Ignore the first 20 values */
        do j = 1 to 20;
           /* put edit (filter() ) (f(6)); */
           r = filter ();
        end;
        put skip;
        do j = 1 to 10;
           put edit (filter() ) (f(6));
        end;

/* filters out cubes from the result of the square generator. */
filter: procedure returns (fixed binary);
   declare n fixed binary static initial (-0);
   declare (i, j, m) fixed binary;

   do while ('1'b);
      m = squares();
      r = 0;
      do j = 1 to m;
         if m = cubes() then go to ignore;
      end;
      return (m);
ignore:
   end;
end filter;

squares: procedure returns (fixed binary);
        declare i fixed binary static initial (-0);

        i = i + 1;
        return (i**2);
end squares;

cubes: procedure returns (fixed binary);

        r = r + 1;
        return (r**3);
end cubes;

end Generate;

You may also check:How to resolve the algorithm Search a list step by step in the Lasso programming language
You may also check:How to resolve the algorithm Currying step by step in the LFE programming language
You may also check:How to resolve the algorithm Zeckendorf number representation step by step in the Forth programming language
You may also check:How to resolve the algorithm Constrained random points on a circle step by step in the CoffeeScript programming language
You may also check:How to resolve the algorithm Roman numerals/Encode step by step in the EasyLang programming language