strongly-type languages

weakly typed languages

loosely typed languages

none of these

contains all constants in the program.

is a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure.

consist of a full or partial list of the token is as they appear in the program created by lexical analysis and used for syntax analysis and interpretation.

is a permanent table which lists all keywords and special symbols of the language in symbolic form

many functions have to be implemented twice

functions are combined and it is not necessary to create intermediate files as output from the macro-processor and input to the assembler.

more flexibility is available to the programmer in that he may use all the features of the assembler in conjunction with macros.

all of these

Lexical analysis

Code generation

Both Lexical analysis and Code generation

None of these

re-enterable

non-reusable

serially usable

None of these