recategorized by
3,593 views

4 Answers

Best answer
21 votes
21 votes

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

1 votes
1 votes

Operator precedence parser comes under Bottom up parser

Correct Ans: Option A

Answer:

Related questions

15 votes
15 votes
2 answers
3
makhdoom ghaya asked Nov 8, 2016
4,944 views
Using longer identifiers in a program will necessarily lead to:Somewhat slower compilationA program that is easier to understandAn incorrect programNone of the above
16 votes
16 votes
2 answers
4
makhdoom ghaya asked Nov 8, 2016
6,323 views
In a compiler the module that checks every character of the source text is called:The code generator.The code optimiser.The lexical analyser.The syntax analyser.