-
Consider the following two statements :
P : Every regular grammar is LL (1).
Q : Every regular set has a LR (1) grammar.
Which of the following is true?
-
- Both P and Q are true
- P is true and Q is false
- P is false and Q is true
- Both P and Q are false
- Both P and Q are true
Correct Option: C
A regular grammar can also be ambiguous also. For example, consider the following grammar,
S → aA/a
A → aA/ ε
In above grammar, string 'a' has two leftmost derivations.
(1) S → aA (2) S → a
S → a (using A → e)
And LL(1) parses only unambiguous grammar, so statement P is False.
Statement Q is true is for every regular set, we can have a regular grammar which is unambiguous so it can be parse by LR parser.
So option C is correct Answer.
