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

Question 21 : System program such a s compiler are designed so that they are
1. Re-enterable
2. Non reusable
3. Serially usable
4. None of the mentioned
View Answer   Discuss with Members

Question 24 : The construction of the canonical collection of the sets of LR (1) items are similar to the construction of the canonical collection of the sets of LR (0) items. Which is an exception?
1. Closure and goto operations work a little bit different
2. Closure and goto operations work similarly
3. Closure and additive operations work a little bit different
4. Closure and associatively operations work a little bit different
View Answer   Discuss with Members

Question 25 : When ß ( in the LR(1) item A -> ß.a,a ) is not empty, the look-head
1. Will be affecting.
2. Does not have any affect.
3. Shift will take place.
4. Reduction will take place.
View Answer   Discuss with Members

Question 27 : If a state does not know whether it will make a shift operation or reduction for a terminal is called
1. Shift/reduce conflict
2. Reduce /shift conflict
3. Shift conflict
4. Reduce conflict
View Answer   Discuss with Members

Question 28 : Which of the following is incorrect for the actions of A LR-Parser I) shift s ii) reduce A->ß iii) Accept iv) reject?
1. Only I)
2. I) and ii)
3. I), ii) and iii)
4. I), ii) , iii) and iv)
View Answer   Discuss with Members


View 21 - 30 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