The best way to compare the different implementations of symbol table is to compare the time required to
* add a new name
* make an inquiry
* add a new name and make an inquiry
65) The best way to compare the different implementations of symbol table is to compare the time required to
Answer is:
all of these
Explanation:
Related Compiler Design MCQ with Answers
Answer is:
both it is simple to implement and it never gets into an infinite loop
Answer is:
all of these
Explanation:
To recover from an error, the operator precedence parser may
* insert symbols onto the stack and onto the input
* delete symbols from the stack
* delete symbols from the input
Answer is:
Both replacing run-time computation by compile time computation & replacing a costly operation by a relatively cheaper one
Answer is:
all of these
Explanation:
Running time of a program depends on
* the way the registers and addressing modes are used
* the order in which computations are performed
* the usage of machine idioms