M

Mr. Dubey • 100.69K Points
Coach

Q. Shift-Reduce parsers perform the following:

  • (A) Shift step that advances in the input stream by K(K > 1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
  • (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
  • (C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree
  • (D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.
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. Which logic is the fastest of all the logic families?

Q. The following command is used for inserting records

Q. Which of the following is the worst type of module coupling?

Q. Which file system has journaling capability?

Q. Which operator is overloaded by lg ()?

Q. Which of the following is coprime number?

Q. The structure or format of data is called

Q. Mapping of network file system protocol to local file system is done by ____________

Q. In interface electronic circuitary conection is done to the human nervous system.

Q. How many times C.com is printed? int main() { int a = 0; while(a++ < 5-++a) printf("C.com"); return 0; }

Question analytics