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?
A)Both P and Q are true
B)P is true and Q is false
C)P is false and Q is true
D)Both P and Q are false

Question

Quizplus · Accepted Answer

Every regular grammar is not necessarily LL(1) because LL(1) grammars cannot have left recursion, which some regular grammars might have. However, every regular set does have a LR(1) grammar, as LR grammars are more powerful and can describe all regular languages.

Consider the Following Two Statements