Consider Grammar G with the following characteristic-
$A → ax$, where $A ∈ V$, $a ∈ T$, $x ∈ V^*$, and any pair $( A, a )$ occurs at most once in $P$. For example, $S → aA \mid aB...,$ is not a grammar of type $G$ because the pair $(S,a)$ occur in two productions. Which of the following is proportional to the effort required to parse a string w belonging to $L(G)$ ?
- $\mid w \mid^3$
- $\mid w \mid$
- $2^{\mid w \mid}$
- Not a function of $\mid w \mid$ alone.