many matches 0 or more of pattern p. In BNF notation, repetition occurs often enough to merit its own abbreviation. When zero or more repetitions of a phrase p are admissible, we simply write p*. The many combinator corresponds directly to this operator, and is defined in much the same way.