in Compiler Design recategorized by
1,588 views
2 votes
2 votes

Shift-Reduce parsers perform the following : 

  1. 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. 
  2. 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. 
  3. 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. 
  4. Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree. 
in Compiler Design recategorized by
1.6k views

1 Answer

0 votes
0 votes

Ans: B

  • Shift step advances in the input stream by one symbol. That shifted symbol becomes a new single-node parse tree.
  • Reduce step applies a completed grammar rule to some of the recent parse trees, joining them together as one tree with a new root symbol.

ref:https://en.wikipedia.org/wiki/LR_parser

Answer:

Related questions