159 views

Which of the following statements regarding $LR(0)$ parser is FALSE?

1. A $LR(0)$ configurating set cannot have multiple reduce items
2. A $LR(0)$ configurating set cannot have  both shift as well as reduce items
3. If a reduce item is present in a $LR(0)$ configurating set it cannot have any other item
4. A $LR(0)$ parser can parse any regular grammar

edited | 159 views
0
Sir, cannot we have a reduce move and a GOTO action in same canonical item ?
+1
Not for LR(0) parser
0
I just realized how dumb that question was. Sorry sir
0
If there is a reduce move we place it only in the action part right???

So what happens when we have a reduce item and Goto item in the same state??
0
When we reduce using a production say $A \to Bcd$, we pop 3 items from stack - since production used for REDUCE has 3 symbols, and move to a state given by GOTO(S, A) where S is the stack top after the pop moves.

+1 vote
No grammar with empty production can be LR(0). But empty rules are allowed in regular grammar as the only condition for a grammar to be regular is to be either left linear or right linear.
by Veteran (418k points)
0

@Arjun sir, isn't B false?

0
Yes. Just corrected the option
+1
Sir, can we say that since a given regular grammar can be ambiguous and LR(0) parsers can't parse any ambiguous grammar, so option (d) is false ?
+1
Can you give an ambiguous regular grammar?
+4

Ambiguous Regular:

S→A | B
A→a
B→a

+2

1
2