The principle of ____ takes the longest possible string of nonblank characters into a single token.
A) greatest aggregate
B) maximized grouping
C) longest substring
D) multipass parsing

Question

Quizplus · Accepted Answer

The principle described in the question is known as "longest substring." It involves taking the longest possible sequence of non-blank characters as a single token. This is a common technique used in lexical analysis or scanning stages of the compiler. Option A is an invalid term. Option B describes a general concept of combining elements into groups but does not relate to tokenization. Option D describes a method of parsing algorithms to classify and validate input data, but it is not related to the process of tokenization.

The Principle of ____ Takes the Longest Possible String of Nonblank