On 2019/12/18 11:46, Greg Wooledge wrote:
To put it another way: you can write code that determines whether
an input character $c matches a glob or regex like [Z-a]. (Maybe.)
But, you CANNOT write code to generate all of the characters from Z to a
This generates characters from decimal 8300 - 8400 (because that range
includes raised and lowered digits which have the number and value
properties equivalent to 0-9.
----
No? 8300, 8400 arbitrary code points that contain raised and lowered numbers
that have the number property (as does 0..9):
perl -we' use strict; use v5.16;
my $c;
for ($c=8300;$c<8400;++$c) {
my $o=chr $c;
printf "%s", $o if $o=~/\pN/; #match unicode property "is_num"
};printf "\n"'
⁰⁴⁵⁶⁷⁸⁹₀₁₂₃₄₅₆₇₈₉
Q.E.D.
Is that sufficient proof?
