When ß is empty (A -> ß.,a), the reduction by A-> a is done by ____ – McqOptions

MCQOPTIONS

1.	When ß is empty (A -> ß.,a), the reduction by A-> a is done by _________
A.	If next symbol is a terminal
B.	Only If the next input symbol is a
C.	Only If the next input symbol is A
D.	Only if the next input symbol is a
Answer» E.

Discussion

No Comment Found

Related MCQs

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?
When ß is empty (A -> ß.,a), the reduction by A-> a is done by _________
When ß (in the LR(1) item A -> ß.a,a) is not empty, the look-head _________
When there is a reduce/reduce conflict?
If a state does not know whether it will make a shift operation or reduction for a terminal is called _________
Which of the following is incorrect for the actions of A LR-Parser I) shift s ii) reduce A->ß iii) Accept iv) reject?
Which of these is true about LR parsing?
An LR-parser can detect a syntactic error as soon as __________
What is the similarity between LR, LALR and SLR?
Which of these is also known as look-head LR parser?