diff --git a/basis/regexp/classes/classes.factor b/basis/regexp/classes/classes.factor index e114dea260..a1c4e3ca2a 100644 --- a/basis/regexp/classes/classes.factor +++ b/basis/regexp/classes/classes.factor @@ -230,7 +230,10 @@ TUPLE: class-partition integers not-integers simples not-simples and or other ; dup or-class flatten partition-classes dup not-integers>> length { { 0 [ nip make-or-class ] } - { 1 [ not-integers>> first [ class>> '[ _ swap class-member? ] any? ] keep or ] } + { 1 [ + not-integers>> first + [ class>> '[ _ swap class-member? ] any? ] keep or + ] } [ 3drop t ] } case ; @@ -251,6 +254,12 @@ M: or-class M: t drop f ; M: f drop t ; +: ( a b -- a-b ) + 2array ; + +: ( a b -- a~b ) + 2array [ ] [ ] bi ; + M: primitive-class class-member? class>> class-member? ; diff --git a/basis/regexp/parser/parser-tests.factor b/basis/regexp/parser/parser-tests.factor index d606015f61..5ea9753fba 100644 --- a/basis/regexp/parser/parser-tests.factor +++ b/basis/regexp/parser/parser-tests.factor @@ -11,7 +11,7 @@ IN: regexp.parser.tests "a|b" "a.b" "a|b|c" "abc|b" "a|bcd" "a|(b)" "(?-i:a)" "||" "(a)|b" "(a|b)" "((a)|(b))" "(?:a)" "(?i:a)" "|b" "b|" "[abc]" "[a-c]" "[^a-c]" "[^]]" "[]a]" "[[]" "[]-a]" "[a-]" "[-]" - "[--a]" "foo*" "(foo)*" "(a|b)|c" "(foo){2,3}" "(foo){2,}" + "foo*" "(foo)*" "(a|b)|c" "(foo){2,3}" "(foo){2,}" "(foo){2}" "{2,3}" "{," "{,}" "}" "foo}" "[^]-a]" "[^-]a]" "[a-]" "[^a-]" "[^a-]" "a{,2}" "(?#foobar)" "\\p{Space}" "\\t" "\\[" "[\\]]" "\\P{Space}" diff --git a/basis/regexp/parser/parser.factor b/basis/regexp/parser/parser.factor index e8de469a94..9fcadc4008 100644 --- a/basis/regexp/parser/parser.factor +++ b/basis/regexp/parser/parser.factor @@ -148,19 +148,29 @@ Character = EscapeSequence | "^" => [[ ^ ]] | . ?[ allowed-char? ]? -AnyRangeCharacter = EscapeSequence | . +AnyRangeCharacter = !("&&"|"||"|"--"|"~~") (EscapeSequence | .) RangeCharacter = !("]") AnyRangeCharacter -Range = RangeCharacter:a "-" RangeCharacter:b => [[ a b ]] +Range = RangeCharacter:a "-" !("-") RangeCharacter:b => [[ a b ]] | RangeCharacter -StartRange = AnyRangeCharacter:a "-" RangeCharacter:b => [[ a b ]] +StartRange = AnyRangeCharacter:a "-" !("-") RangeCharacter:b => [[ a b ]] | AnyRangeCharacter Ranges = StartRange:s Range*:r => [[ r s prefix ]] -CharClass = "^"?:n Ranges:e => [[ e n char-class ]] +BasicCharClass = "^"?:n Ranges:e => [[ e n char-class ]] + +CharClass = BasicCharClass:b "&&" CharClass:c + => [[ b c 2array ]] + | BasicCharClass:b "||" CharClass:c + => [[ b c 2array ]] + | BasicCharClass:b "~~" CharClass:c + => [[ b c ]] + | BasicCharClass:b "--" CharClass:c + => [[ b c ]] + | BasicCharClass Options = [idmsux]* diff --git a/basis/regexp/regexp-docs.factor b/basis/regexp/regexp-docs.factor index 6d9f03781d..3a914f4283 100644 --- a/basis/regexp/regexp-docs.factor +++ b/basis/regexp/regexp-docs.factor @@ -45,7 +45,7 @@ ARTICLE: { "regexp" "construction" } "Constructing regular expressions" ARTICLE: { "regexp" "syntax" } "Regular expression syntax" "Regexp syntax is largely compatible with Perl, Java and extended POSIX regexps, but not completely. Below, the syntax is documented." { $heading "Characters" } -"At its core, regular expressions consist of character literals. For example, " { $snippet "R/ f/" } " is a regular expression matching just the string 'f'. In addition, the normal escape codes are provided, like " { $snippet "\\t" } " for the tab character and " { $snippet "\\uxxxxxx" } "for an arbitrary Unicode code point, by its hex value. In addition, any character can be preceded by a backslash to escape it, unless this has special meaning. For example, to match a literal opening parenthesis, use " { $snippet "\\(" } "." +"At its core, regular expressions consist of character literals. For example, " { $snippet "R/ f/" } " is a regular expression matching just the string 'f'. In addition, the normal escape codes are provided, like " { $snippet "\\t" } " for the tab character and " { $snippet "\\uxxxxxx" } " for an arbitrary Unicode code point, by its hex value. In addition, any character can be preceded by a backslash to escape it, unless this has special meaning. For example, to match a literal opening parenthesis, use " { $snippet "\\(" } "." { $heading "Concatenation, alternation and grouping" } "Regular expressions can be built out of multiple characters by concatenation. For example, " { $snippet "R/ ab/" } " matches a followed by b. The " { $snippet "|" } " (alternation) operator can construct a regexp which matches one of two alternatives. Parentheses can be used for gropuing. So " { $snippet "R/ f(oo|ar)/" } " would match either 'foo' or 'far'." { $heading "Character classes" } @@ -72,10 +72,12 @@ ARTICLE: { "regexp" "syntax" } "Regular expression syntax" { { $snippet "\\p{blank}" } "Non-newline whitespace" } { { $snippet "\\p{cntrl}" } "Control character" } { { $snippet "\\p{space}" } "Whitespace" } - { { $snippet "\\p{xdigit}" } "Hexidecimal digit" } + { { $snippet "\\p{xdigit}" } "Hexadecimal digit" } { { $snippet "\\p{Nd}" } "Character in Unicode category Nd" } { { $snippet "\\p{Z}" } "Character in Unicode category beginning with Z" } { { $snippet "\\p{script=Cham}" } "Character in the Cham writing system" } } +{ $heading "Character class operations" } +"Character classes can be composed using four binary operations: " { $snippet "|| && ~~ --" } ". These do the operations union, intersection, symmetric difference and difference, respectively. For example, characters which are lower-case but not Latin script could be matched as " { $snippet "[\\p{lower}--\\p{script=latin}]" } ". These operations are right-associative, and " { $snippet "^" } " binds tighter than them. There is no syntax for grouping." { $heading "Boundaries" } "Special operators exist to match certain points in the string. These are called 'zero-width' because they do not consume any characters." { $table diff --git a/basis/regexp/regexp-tests.factor b/basis/regexp/regexp-tests.factor index 999caeaed6..2234386803 100644 --- a/basis/regexp/regexp-tests.factor +++ b/basis/regexp/regexp-tests.factor @@ -508,3 +508,29 @@ IN: regexp-tests [ t ] [ " " R/ \P{LL}/ matches? ] unit-test [ f ] [ "a" R/ \P{sCriPt = latin}/ matches? ] unit-test [ t ] [ " " R/ \P{SCRIPT = laTIn}/ matches? ] unit-test + +! Logical operators +[ t ] [ "a" R/ [\p{script=latin}\p{lower}]/ matches? ] unit-test +[ t ] [ "π" R/ [\p{script=latin}\p{lower}]/ matches? ] unit-test +[ t ] [ "A" R/ [\p{script=latin}\p{lower}]/ matches? ] unit-test +[ f ] [ "3" R/ [\p{script=latin}\p{lower}]/ matches? ] unit-test + +[ t ] [ "a" R/ [\p{script=latin}||\p{lower}]/ matches? ] unit-test +[ t ] [ "π" R/ [\p{script=latin}||\p{lower}]/ matches? ] unit-test +[ t ] [ "A" R/ [\p{script=latin}||\p{lower}]/ matches? ] unit-test +[ f ] [ "3" R/ [\p{script=latin}||\p{lower}]/ matches? ] unit-test + +[ t ] [ "a" R/ [\p{script=latin}&&\p{lower}]/ matches? ] unit-test +[ f ] [ "π" R/ [\p{script=latin}&&\p{lower}]/ matches? ] unit-test +[ f ] [ "A" R/ [\p{script=latin}&&\p{lower}]/ matches? ] unit-test +[ f ] [ "3" R/ [\p{script=latin}&&\p{lower}]/ matches? ] unit-test + +[ f ] [ "a" R/ [\p{script=latin}~~\p{lower}]/ matches? ] unit-test +[ t ] [ "π" R/ [\p{script=latin}~~\p{lower}]/ matches? ] unit-test +[ t ] [ "A" R/ [\p{script=latin}~~\p{lower}]/ matches? ] unit-test +[ f ] [ "3" R/ [\p{script=latin}~~\p{lower}]/ matches? ] unit-test + +[ f ] [ "a" R/ [\p{script=latin}--\p{lower}]/ matches? ] unit-test +[ f ] [ "π" R/ [\p{script=latin}--\p{lower}]/ matches? ] unit-test +[ t ] [ "A" R/ [\p{script=latin}--\p{lower}]/ matches? ] unit-test +[ f ] [ "3" R/ [\p{script=latin}--\p{lower}]/ matches? ] unit-test diff --git a/basis/simple-flat-file/simple-flat-file-docs.factor b/basis/simple-flat-file/simple-flat-file-docs.factor index 9ed5de7d2b..0223d94af9 100644 --- a/basis/simple-flat-file/simple-flat-file-docs.factor +++ b/basis/simple-flat-file/simple-flat-file-docs.factor @@ -1,8 +1,24 @@ -USING: help.syntax help.markup strings ; +! Copyright (C) 2009 Daniel Ehrenberg +! See http://factorcode.org/license.txt for BSD license. +USING: help.syntax help.markup strings biassocs arrays ; IN: simple-flat-file ABOUT: "simple-flat-file" ARTICLE: "simple-flat-file" "Parsing simple flat files" -"The " { $vocab-link "simple-flat-file" } " vocabulary provides words for loading and parsing simple flat files in a particular format which is common for encoding tasks." -{ $subsection flat-file>biassoc } ; +"The " { $vocab-link "simple-flat-file" } " vocabulary provides words for loading and parsing simple flat files in a particular format which is common for encoding and Unicode tasks." +{ $subsection flat-file>biassoc } +{ $subsection load-interval-file } +{ $subsection data } ; + +HELP: load-interval-file +{ $values { "filename" string } { "table" "an interval map" } } +{ $description "This loads a file that looks like Script.txt in the Unicode Character Database and converts it into an efficient interval map, where the keys are characters and the values are strings for the properties." } ; + +HELP: data +{ $values { "filename" string } { "data" array } } +{ $description "This loads a file that's delineated by semicolons and lines, returning an array of lines, where each line is an array split by the semicolons, with whitespace trimmed off." } ; + +HELP: flat-file>biassoc +{ $values { "filename" string } { "biassoc" biassoc } } +{ $description "This loads a flat file, in the form that many encoding resource files are in, with two columns of numeric data in hex, and returns a biassoc associating them." } ; diff --git a/basis/simple-flat-file/simple-flat-file.factor b/basis/simple-flat-file/simple-flat-file.factor index 6e53c97738..88a64b7746 100644 --- a/basis/simple-flat-file/simple-flat-file.factor +++ b/basis/simple-flat-file/simple-flat-file.factor @@ -1,7 +1,7 @@ ! Copyright (C) 2009 Daniel Ehrenberg ! See http://factorcode.org/license.txt for BSD license. USING: sequences splitting kernel math.parser io.files io.encodings.utf8 -biassocs ascii ; +biassocs ascii namespaces arrays make assocs interval-maps sets ; IN: simple-flat-file : drop-comments ( seq -- newseq ) @@ -30,3 +30,25 @@ IN: simple-flat-file : data ( filename -- data ) utf8 file-lines drop-comments [ split-; ] map ; + +SYMBOL: interned + +: range, ( value key -- ) + swap interned get + [ = ] with find nip 2array , ; + +: expand-ranges ( assoc -- interval-map ) + [ + [ + swap CHAR: . over member? [ + ".." split1 [ hex> ] bi@ 2array + ] [ hex> ] if range, + ] assoc-each + ] { } make ; + +: process-interval-file ( ranges -- table ) + dup values prune interned + [ expand-ranges ] with-variable ; + +: load-interval-file ( filename -- table ) + data process-interval-file ; diff --git a/basis/unicode/breaks/breaks.factor b/basis/unicode/breaks/breaks.factor index 91f6a45911..22d6cddfb9 100644 --- a/basis/unicode/breaks/breaks.factor +++ b/basis/unicode/breaks/breaks.factor @@ -4,8 +4,9 @@ USING: combinators.short-circuit unicode.categories kernel math combinators splitting sequences math.parser io.files io assocs arrays namespaces make math.ranges unicode.normalize unicode.normalize.private values io.encodings.ascii -unicode.syntax unicode.data compiler.units fry -alien.syntax sets accessors interval-maps memoize locals words ; +unicode.data compiler.units fry unicode.categories.syntax +alien.syntax sets accessors interval-maps memoize locals words +simple-flat-file ; IN: unicode.breaks > categories-map at ] map ] + [ [ [ ] like ] [ [ drop f ] ] if* ] bi* ; + +PRIVATE> + +SYNTAX: CATEGORY: parse-category define-category ; + +SYNTAX: CATEGORY-NOT: parse-category define-not-category ; diff --git a/basis/unicode/syntax/tags.txt b/basis/unicode/categories/syntax/tags.txt similarity index 100% rename from basis/unicode/syntax/tags.txt rename to basis/unicode/categories/syntax/tags.txt diff --git a/basis/unicode/collation/collation.factor b/basis/unicode/collation/collation.factor index 0c51ea4352..b6eddccae0 100755 --- a/basis/unicode/collation/collation.factor +++ b/basis/unicode/collation/collation.factor @@ -4,7 +4,7 @@ USING: combinators.short-circuit sequences io.files io.encodings.ascii kernel values splitting accessors math.parser ascii io assocs strings math namespaces make sorting combinators math.order arrays unicode.normalize unicode.data locals -unicode.syntax macros sequences.deep words unicode.breaks +macros sequences.deep words unicode.breaks quotations combinators.short-circuit simple-flat-file ; IN: unicode.collation diff --git a/basis/unicode/data/data-docs.factor b/basis/unicode/data/data-docs.factor index d1a458eb48..82706729bf 100644 --- a/basis/unicode/data/data-docs.factor +++ b/basis/unicode/data/data-docs.factor @@ -6,7 +6,7 @@ IN: unicode.data ABOUT: "unicode.data" ARTICLE: "unicode.data" "Unicode data tables" -"The " { $vocab-link "unicode.data" "unicode.data" } " vocabulary contains core Unicode data tables and code for parsing this from files." +"The " { $vocab-link "unicode.data" "unicode.data" } " vocabulary contains core Unicode data tables and code for parsing this from files. The following words access these data tables." { $subsection canonical-entry } { $subsection combine-chars } { $subsection combining-class } @@ -14,7 +14,11 @@ ARTICLE: "unicode.data" "Unicode data tables" { $subsection name>char } { $subsection char>name } { $subsection property? } -{ $subsection load-key-value } ; +{ $subsection category } +{ $subsection ch>upper } +{ $subsection ch>lower } +{ $subsection ch>title } +{ $subsection special-case } ; HELP: canonical-entry { $values { "char" "a code point" } { "seq" string } } @@ -48,6 +52,22 @@ HELP: property? { $values { "char" "a code point" } { "property" string } { "?" "a boolean" } } { $description "Tests whether the code point is listed under the given property in PropList.txt in the Unicode Character Database." } ; -HELP: load-key-value -{ $values { "filename" string } { "table" "an interval map" } } -{ $description "This loads a file that looks like Script.txt in the Unicode Character Database and converts it into an efficient interval map, where the keys are characters and the values are strings for the properties." } ; +HELP: category +{ $values { "char" "a code point" } { "category" string } } +{ $description "Returns the general category of a code point, in the form of a string. This will always be a string within the ASCII range of length two. If the code point is unassigned, then it returns " { $snippet "Cn" } "." } ; + +HELP: ch>upper +{ $values { "ch" "a code point" } { "upper" "a code point" } } +{ $description "Returns the simple upper-cased version of the code point, if it exists. This does not handle context-sensitive or locale-dependent properties of linguistically accurate case conversion, and does not correctly handle characters which become multiple characters on conversion to this case." } ; + +HELP: ch>lower +{ $values { "ch" "a code point" } { "lower" "a code point" } } +{ $description "Returns the simple lower-cased version of the code point, if it exists. This does not handle context-sensitive or locale-dependent properties of linguistically accurate case conversion, and does not correctly handle characters which become multiple characters on conversion to this case." } ; + +HELP: ch>title +{ $values { "ch" "a code point" } { "title" "a code point" } } +{ $description "Returns the simple title-cased version of the code point, if it exists. This does not handle context-sensitive or locale-dependent properties of linguistically accurate case conversion, and does not correctly handle characters which become multiple characters on conversion to this case." } ; + +HELP: special-case +{ $values { "ch" "a code point" } { "casing-tuple" { "a tuple, or " { $link f } } } } +{ $description "If a code point has special casing behavior, returns a tuple which represents that information." } ; diff --git a/basis/unicode/data/data.factor b/basis/unicode/data/data.factor index e94036a85e..779ae64d48 100644 --- a/basis/unicode/data/data.factor +++ b/basis/unicode/data/data.factor @@ -58,7 +58,7 @@ CONSTANT: num-chars HEX: 2FA1E PRIVATE> -: category# ( char -- category ) +: category# ( char -- n ) ! There are a few characters that should be Cn ! that this gives Cf or Mn ! Cf = 26; Mn = 5; Cn = 29 @@ -219,27 +219,3 @@ load-properties to: properties [ name>char [ "Invalid character" throw ] unless* ] name>char-hook set-global - -SYMBOL: interned - -: range, ( value key -- ) - swap interned get - [ = ] with find nip 2array , ; - -: expand-ranges ( assoc -- interval-map ) - [ - [ - swap CHAR: . over member? [ - ".." split1 [ hex> ] bi@ 2array - ] [ hex> ] if range, - ] assoc-each - ] { } make ; - -: process-key-value ( ranges -- table ) - dup values prune interned - [ expand-ranges ] with-variable ; - -PRIVATE> - -: load-key-value ( filename -- table ) - data process-key-value ; diff --git a/basis/unicode/normalize/normalize.factor b/basis/unicode/normalize/normalize.factor index 602d9555ea..aca96a5694 100644 --- a/basis/unicode/normalize/normalize.factor +++ b/basis/unicode/normalize/normalize.factor @@ -2,7 +2,7 @@ ! See http://factorcode.org/license.txt for BSD license. USING: ascii sequences namespaces make unicode.data kernel math arrays locals sorting.insertion accessors assocs math.order combinators -unicode.syntax strings sbufs hints combinators.short-circuit vectors ; +strings sbufs hints combinators.short-circuit vectors ; IN: unicode.normalize diff --git a/basis/unicode/syntax/syntax.factor b/basis/unicode/syntax/syntax.factor deleted file mode 100644 index dfae31d39c..0000000000 --- a/basis/unicode/syntax/syntax.factor +++ /dev/null @@ -1,38 +0,0 @@ -! Copyright (C) 2008 Daniel Ehrenberg. -! See http://factorcode.org/license.txt for BSD license. -USING: unicode.data kernel math sequences parser lexer -bit-arrays namespaces make sequences.private arrays quotations -assocs classes.predicate math.order strings.parser ; -IN: unicode.syntax - -category-array ( categories -- bitarray ) - categories [ swap member? ] with map >bit-array ; - -: as-string ( strings -- bit-array ) - concat unescape-string ; - -: [category] ( categories -- quot ) - [ - [ [ categories member? not ] filter as-string ] keep - [ categories member? ] filter >category-array - [ dup category# ] % , [ nth-unsafe [ drop t ] ] % - \ member? 2array >quotation , - \ if , - ] [ ] make ; - -: define-category ( word categories -- ) - [category] integer swap define-predicate-class ; - -PRIVATE> - -SYNTAX: CATEGORY: - CREATE ";" parse-tokens define-category ; - -: seq-minus ( seq1 seq2 -- diff ) - [ member? not ] curry filter ; - -SYNTAX: CATEGORY-NOT: - CREATE ";" parse-tokens - categories swap seq-minus define-category ; diff --git a/basis/unicode/unicode-docs.factor b/basis/unicode/unicode-docs.factor index 4ae326ac84..9450b49f0b 100644 --- a/basis/unicode/unicode-docs.factor +++ b/basis/unicode/unicode-docs.factor @@ -15,7 +15,7 @@ $nl { $vocab-subsection "Word and grapheme breaks" "unicode.breaks" } { $vocab-subsection "Unicode normalization" "unicode.normalize" } "The following are mostly for internal use:" -{ $vocab-subsection "Unicode syntax" "unicode.syntax" } +{ $vocab-subsection "Unicode category syntax" "unicode.categories.syntax" } { $vocab-subsection "Unicode data tables" "unicode.data" } { $see-also "ascii" "io.encodings" } ; diff --git a/basis/xml/char-classes/char-classes.factor b/basis/xml/char-classes/char-classes.factor index d510c8a881..153fca0bb7 100644 --- a/basis/xml/char-classes/char-classes.factor +++ b/basis/xml/char-classes/char-classes.factor @@ -1,19 +1,26 @@ ! Copyright (C) 2005, 2009 Daniel Ehrenberg ! See http://factorcode.org/license.txt for BSD license. -USING: kernel sequences unicode.syntax math math.order combinators -hints ; +USING: kernel sequences unicode.categories.syntax math math.order +combinators hints ; IN: xml.char-classes -CATEGORY: 1.0name-start* Ll Lu Lo Lt Nl \u000559\u0006E5\u0006E6_: ; -: 1.0name-start? ( char -- ? ) - dup 1.0name-start*? [ drop t ] - [ HEX: 2BB HEX: 2C1 between? ] if ; +CATEGORY: 1.0name-start + Ll Lu Lo Lt Nl | { + [ HEX: 2BB HEX: 2C1 between? ] + [ "\u000559\u0006E5\u0006E6_:" member? ] + } 1|| ; -CATEGORY: 1.0name-char Ll Lu Lo Lt Nl Mc Me Mn Lm Nd _-.\u000387: ; +CATEGORY: 1.0name-char + Ll Lu Lo Lt Nl Mc Me Mn Lm Nd | + "_-.\u000387:" member? ; -CATEGORY: 1.1name-start Ll Lu Lo Lm Ln Nl _: ; +CATEGORY: 1.1name-start + Ll Lu Lo Lm Ln Nl | + "_:" member? ; -CATEGORY: 1.1name-char Ll Lu Lo Lm Ln Nl Mc Mn Nd Pc Cf _-.\u0000b7: ; +CATEGORY: 1.1name-char + Ll Lu Lo Lm Ln Nl Mc Mn Nd Pc Cf | + "_-.\u0000b7:" member? ; : name-start? ( 1.0? char -- ? ) swap [ 1.0name-start? ] [ 1.1name-start? ] if ;