Register

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 16

• retagged by
443 views
4 votes
4 votes
Consider the following context-free grammar, with start symbol $S$ and terminals $a, ; , \lt , \gt .$
$$
S \rightarrow  \;\lt L \mid a \qquad L \rightarrow a R \mid \;\lt L R \quad R \rightarrow\;\gt\; \mid \;; L
$$
How many different parse trees are there for the string $\lt \lt a \gt ;a\gt ?$
• retagged by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

676
views
1 answers
5 votes
GO Classes asked Jan 21
676 views
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 2
Consider the following grammar-$$\begin{aligned}& S \rightarrow b T \\& T \rightarrow A b \mid B a \\& A \rightarrow a S \mid C B \\& B \rightarrow b D \\& C \rightarrow ...
User Avatar
539
views
1 answers
2 votes
GO Classes asked Jan 21
539 views
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 33
Consider the following grammar:$$\begin{aligned}& S \rightarrow a S^{\prime} \\& S^{\prime} \rightarrow b S^{\prime} \mid \epsilon\end{aligned}$$Which of the following is...
User Avatar
514
views
1 answers
5 votes
GO Classes asked Jan 21
514 views
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 34
$$\begin{aligned}& S \rightarrow S1 \;T \\& S 1 \rightarrow a \mid(S S) \\& T \rightarrow \varepsilon \mid b \;T\end{aligned}$$In the $\text{LL(1)}$ parser table, $M$, of...
User Avatar
Link Copied!