maximal munch

Noun

 * 1)  A method of parsing or lexing where the longest possible section of the input is matched on each iteration.
 * a maximal-munch parser