Which of the following statements about regular expressions is true.
a. The set of braces containing two numbers, {n,m}, matches between n and m occurrences (inclusively) of the
pattern that it quantifies.
b. All of the regular expression quantifiers are greedy; they’ll match as many occurrences of the pattern as possible
until the pattern fails to make a match.
c. If a quantifier is followed by a question mark (?), the quantifier becomes lazy and will match as few occurrences
as possible as long as there is a successful match.
d. All of the above.
d. All of the above.
You might also like to view...
A(n) ________ is a computer that connects to or requests services from a server
A) Analytical Engine B) client C) Turing machine D) smart appliance
Understanding confidentiality and integrity models and defense in depth are covered in which of the following CBK domains?
A. Cryptography B. Telecommunications and network security C. Operations security D. Security architecture and design