> How about these rules: > > For the two strings to match, their contents must be identical except that > the > following special sequences may appear in pattern: > > * Matches any sequence of characters in string, including a null > string. > > ? Matches any single character in string. > > [chars] Matches any character in the set given by chars. If a sequence > of > the form x-y appears in chars, then any character between x and y, > inclusive, will match. > > \x Matches the single character x. This provides a way of avoiding > the special interpretation of the characters *?[]\ in pattern. > > Seems pretty good to me, and easily implementable whatever the tools/languages used.
- Chris -
_______________________________________________ Mapcss mailing list [email protected] http://lists.openstreetmap.org/listinfo/mapcss
