Which one of the following is true at any valid state in shift-reduce – McqOptions

MCQOPTIONS

1.	Which one of the following is true at any valid state in shift-reduce parsing?
A.	At the bottom we find the prefixes
B.	None of the mentioned
C.	Stack contains only viable prefixes
D.	Stack consists of viable prefixes
Answer» D. Stack consists of viable prefixes

Discussion

No Comment Found

Related MCQs

Consider the following two sets of LR (1) items of an LR (1) grammar.
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production to parse a string with n tokens?
Consider the following grammar G. Which one is true?S1: All strings generated by G can be parsed with help of LL (1).S2: All strings generated by G can be parsed with help of LR (1).
Which of the following pairs is the most powerful?
In the context of abstract-syntax-tree and control-flow-graph. Which one of the following is true?
Which one of the following is true at any valid state in shift-reduce parsing?
What is the grammar for the below equations?