retagged by
310 views

1 Answer

Best answer
2 votes
2 votes

A grammar that is generated to define the mathematical operators is called operator grammar with some restrictions on grammar. An operator precedence grammar is a context-free grammar that has the property that no production has either an empty right-hand side (null productions) or two adjacent non-terminals in its right-hand side.

This is the example of operator grammar: 

E->E+E/E*E/id

C is Correct.

selected by
Answer:

Related questions

3 votes
3 votes
1 answer
1
Bikram asked Nov 25, 2016
442 views
Consider the following grammar:$E \rightarrow E + T \mid T$$T \rightarrow T ^* F \mid F$$F \rightarrow (E) \mid id$What are the productions for E, T and F after convertin...
3 votes
3 votes
2 answers
3
2 votes
2 votes
2 answers
4
Bikram asked Nov 25, 2016
663 views
Consider the following grammar:$S \rightarrow L = P \mid P$$L \rightarrow ^*P \mid id$$P \rightarrow L$The above grammar is:AmbiguousSLR(1)LALR(1)None of the above