Another attempt at describing …. Refs #1103

Author: JJ

doc/Language/operators.pod6

@@ -2195,28 +2195,25 @@ X<|...,operators>X<|...^,operators>X<|…,operators>X<|…^,operators>X<|lazy li
     multi sub infix:<...>(**@) is assoc<list>
     multi sub infix:<...^>(**@) is assoc<list>
 
-The X<sequence operator> is a generic operator to produce generic lists and sequences, including lazy lists if the sequence endpoint is C<Inf>.
+The X<sequence operator> will produce generic sequences on demand.
 
-The left hand side will include initial elements; it may include a generator too. The right hand side will have an endpoint, which can be C<Inf> or C<*> for lazy infinite lists, an expression which will end the sequence when C<True>, or other elements such as L<Junctions>.
+The left hand side will always include initial elements; it may include a generator too. The right hand side will have an endpoint, which can be C<Inf> or C<*> for "infinite" lists (whose elements are only produced on demand), an expression which will end the sequence when C<True>, or other elements such as L<Junctions>.
 
 The sequence operator invokes the generator with as many arguments as
 necessary. The arguments are taken from the initial elements and the already
-generated elements.
-
-The default generator is C<*.>L<succ> or C<*.>L<pred>, depending on how
-the end points compare:
+generated elements. The default generator is C<*.>L<succ> or C<*.>L<pred>, depending on how the end points compare:
 
     say 1 ... 4;        # OUTPUT: «(1 2 3 4)␤»
     say 4 ... 1;        # OUTPUT: «(4 3 2 1)␤»
     say 'a' ... 'e';    # OUTPUT: «(a b c d e)␤»
     say 'e' ... 'a';    # OUTPUT: «(e d c b a)␤»
 
-An endpoint of C<*>, C<Inf> or C<∞> (L<Whatever>) lazily generates an infinite sequence,
+An endpoint of C<*> (L<Whatever>), C<Inf> or C<∞>  generates on demand an infinite sequence,
 with a default generator of *.succ
 
     say (1 ... *)[^5];  # OUTPUT: «(1 2 3 4 5)␤»
 
-Custom generators have to be the last argument before the '...' operator.
+Custom generators need to be the last argument before the '...' operator.
 This one takes two arguments, and generates the Fibonacci numbers
 
     say (1, 1, -> $a, $b { $a + $b } ... *)[^8];    # OUTPUT: «(1 1 2 3 5 8 13 21)␤»