in Compiler Design recategorized by
3,615 views
16 votes
16 votes

An operator precedence parser is a

  1. Bottom-up parser.
  2. Top-down parser.
  3. Back tracking parser.
  4. None of the above.
in Compiler Design recategorized by
3.6k views

4 Answers

21 votes
21 votes
Best answer

A. Bottom-up parser.

An operator-precedence parser is a simple shift-reduce parser that is capable of parsing a subset of $\text{LR(1)}$ grammars. More precisely, the operator-precedence parser can parse all $\text{LR(1)}$ grammars where two consecutive non-terminals and epsilon never appear in the right-hand side of any rule.

edited by
11 votes
11 votes

option A is correct

2 Comments

recursive descent parser comes under backtracking
3
3
Recursive descent without backtracking is also possible.
0
0
6 votes
6 votes
operator precedence is a bottom up parser based on shift reduce parsers...
1 vote
1 vote

Operator precedence parser comes under Bottom up parser

Correct Ans: Option A

Answer:

Related questions