Which of the following grammar rules violate the requirements of an operator grammar? P, Q, R are nonterminals, and r, s, t are terminals.
P $\rightarrow$ Q R
P $\rightarrow$ Q s R
P $\rightarrow \: ε$
P $\rightarrow$ Q t R r
answer is B.
Operator grammar cannot contain
no, PQ-->RsT will also not be in operator grammer, because
PQ is present in LHS means it has also been generated by some production like V ---> αPQβ which is also in grammer and voilating operator precedence condition..
Not able to understand ur above comment ..
is this right reasoning
PQ -> Rst ...is not CFG hence not Operator Grammar /?
Given $C$ program is not