M

Mr. Dubey • 100.69K Points
Coach

Q. Consider the following grammar:
S → FR
R → S | ε
F → id
In the predictive parser table, M, of the grammar the entries M[S, id] and M[R, $]
respectively.

  • (A) {S → FR} and {R → ε }
  • (B) {S → FR} and { }
  • (C) {S → FR} and {R → *S}
  • (D) {F → id} and {R → ε}
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. In reinforcement learning if feedback is negative one it is defined as .

Q. Which of the following is not a state of a defect in defect life cycle:

Q. Messages sent by a process

Q. Which of the following is a legal expression in SQL?

Q. Staleness deviations relate to the a replica was updated.

Q. Accessing Wi-Fi dishonestly is a cyber-crime.

Q. Key to represent relationship between tables is called

Q. Change-oriented identification

Q. The method of connecting a driving device to a loading device is known as

Q. Which of the following commands is used to update access and modification times of a file?

Question analytics