Installation Manual

Bodno Manual104
© 2018 Bodno
Characte
r
Meaning
#
ASCII digit or plus/minus sign permitted but not required.
H
Hexadecimal character required. A-F, a-f, 0-9.
h
Hexadecimal character permitted but not required.
B
Binary character required. 0-1.
b
Binary character permitted but not required.
>
All following alphabetic characters are uppercased.
<
All following alphabetic characters are lowercased.
!
Switch off case conversion.
\
Use \ to escape the special characters listed above to use them as
separators.
Examples:
Mask
Notes
000.000.000.000;_
IP address; blanks are _.
HH:HH:HH:HH:HH:HH;_
MAC address
0000-00-00
ISO Date; blanks are space
>AAAAA-AAAAA-AAAAA-
AAAA-AAAAA;#
License number; blanks are - and all (alphabetic)
characters are converted to uppercase.
Validation Rules - Validation Rules are built up from expressions,
quantifiers, and assertions. The simplest expression is a character, e.g. x or 5.
An expression can also be a set of characters enclosed in square brackets.
[ABCD] will match an A or a B or a C or a D. We can write this same
expression as [A-D], and an expression to match any capital letter in the English
alphabet is written as [A-Z].
A quantifier specifies the number of occurrences of an expression that must be
matched. x{1,1} means match one and only one x. x{1,5} means match a
sequence of x characters that contains at least one x but no more than five.
Note that in general Validation Rules cannot be used to check for balanced
brackets or tags. For example, a Validation Rule can be written to match an
opening HTML <b> and its closing </b>, if the <b> tags are not nested, but if
the <b> tags are nested, that same Validation Rule will match an opening <b>
tag with the wrong closing </b>. For the fragment <b>bold <b>bolder</b></b>,
the first <b> would be matched with the first </b>, which is not correct.
However, it is possible to write a Validation Rule that will match nested brackets
or tags correctly, but only if the number of nesting levels is fixed and known. If
the number of nesting levels is not fixed and known, it is impossible to write a
Validation Rule that will not fail.
Suppose we want a Validation Rule to match integers in the range 0 to 99. At
least one digit is required, so we start with the expression [0-9]{1,1}, which
matches a single digit exactly once. This Validation Rule matches integers in the
range 0 to 9. To match integers up to 99, increase the maximum number of