Consider the following grammar:

$$\eqalign{ & S \to FR \cr & R \to *S\,|\,\varepsilon \cr & F \to id \cr} $$

In the predictive parser table, M, of the grammar the entries $$M\left[ {S,id} \right]$$ and $$M\left[ {R,\$ } \right]$$ respectively.

In the correct grammar of the previous question, what is the length of the derivation (number of steps starring from S) to generate the string $${a^l}{b^m}$$ with $$l \ne m$$?

Which one of the following grammars generates the following language?

$$L = \left( {{a^i}{b^j}|i \ne j} \right)$$

Consider the grammar

$$S \to \left( S \right)\,|\,a$$

Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n₁, n₂ and n₃ respectively.

The following relationship holds good