Bottom Up Parsing on Compiler related Questions and Answers - Page 4

Question 32 : Which of these is also known as look-head LR parser?
1. SLR
2. LR
3. LLR
4. None of the mentioned
View Answer   Discuss with Members

Question 33 : Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. Hence which one is true?
1. N1 is necessarily less than n2
2. N1 is necessarily equal to n2
3. N1 is necessarily greater than n2
4. None of the mentioned
View Answer   Discuss with Members

Question 35 : Which of the following symbols table implementation is based on the property of locality of reference?
1. Hash Table
2. Search tree
3. Self organizing list
4. Linear list
View Answer   Discuss with Members

Question 36 : _____________ is a graph representation of a derivation
1. The parse tree
2. Oct tree
3. Binary tree
4. None of the mentioned
View Answer   Discuss with Members

Question 38 : _________ or scanning is the process where the stream of characters making up the source program is read from left to right and grouped into tokens.
1. Lexical Analysis
2. Diversion
3. Modelling
4. None of the mentioned
View Answer   Discuss with Members

Question 39 : The graph that shows basic blocks and their successor relationship is called
1. DAG
2. Flow Chart
3. Control Graph
4. Hamilton graph
View Answer   Discuss with Members


View 31 - 40 of 67 Questions

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter