Q. Which is the correct statement(s) for Non Recursive predictive parser?

S1: First(α) = {t | α => * t β for some string β } => *tβ
S2: Follow(X) = { a | S => * αXa β for some strings α and β }

View solution

Q. From the point of view of the programmer, what are the major advantages of using a high-level language rather than internal machine code or assembly language ?

View solution

Q. The scheme of which interpreter translates the source program is known as

View solution

Q. Portable program means

View solution

Q. Object modules generated by assembler that contains unresolved external references are resolved for two or more object module by a/an

View solution

Q. A special software that is used to create a job queue is called

View solution

Q. Which of the following permanent database that has an entry for each terminal symbol ?

View solution

Q. In which way(s) a macroprocessor for assembly language can be implemented ?

View solution

Q. Which of the following can be accessed by transfer vector approach of linking ?

View solution

Q. Block or Buffer caches are used to

View solution

Q. Object code is the output of ……………

View solution

Q. ‘Macro’ in an assembly level program is …………..

View solution

Q. Grammar of the programming is checked at …………… phase of compiler.

View solution

Q. Macro-processors are ………….

View solution

Q. The dynamic allocation of storage areas with VSAM files is accomplished by

View solution

Q. Which of the following command the file names in multiple columns?

View solution

Q. In an absolute loading scheme, which loader function is accomplished by a loader?

View solution

Q. Consider the following left associative operators in decreasing order of precedence:

– subtraction (highest precedence)
* multiplication
$ exponentiation (lowest precedence)

What is the result of the following expression?

3 – 2 * 4 $ | * 2**3

View solution

Q. Which of the following is the most general phase structured grammar?

View solution

Q. Which of the following is used for grouping of characters into tokens (in a computer)?

View solution