one to one not onto

one to one and onto

not one to one and not onto

not one to one and onto

the symbols used have well-defined meaning

they are unnecessary, in reality

only form of the string of symbols is significant

Both (a) and (b)

0 (n3)

0 (n332)

0 (n32n)

0 (n22n)

The task of lexical analyzer is to translate the input source language text into tokens and determine the groups of tokens are inter-related.

Two basic approaches to translation are generation and interpretation.

A load-and-go compiler is capable o translating the source language text on a host machine A that can be later run on any target machine B.

None of these

String of 0 ′s whose length is a perfect square

Set of all palindromes made up of 0 ′s and 1 ′s

Strings of 0 ′s, whose length is a prime number

All of these