Consider the grammar $S \rightarrow bSe$ $S \rightarrow PQR$ $P \rightarrow bPc$ $P \rightarrow \varepsilon$ $Q \rightarrow cQd$ $Q \rightarrow \varepsilon$ $R \rightarrow dRe$ $R \rightarrow \varepsilon$ where $S, P, Q, R$ are non-terminal symbols with $S$ being the start symbol ... $i, j, k, m$? Find the smallest string that has two parse trees.

answered
Jul 24
in Compiler Design
Jithendra319
1.7k views