Register

Peter Linz Edition 4 Exercise 5.2 Question 17 (Page No. 145)

406 views
0 votes
0 votes
Use the exhaustive search parsing method to parse the string $abbbbbb$ with the grammar with productions

$S\rightarrow aAB,$

$A\rightarrow bBb,$

$B\rightarrow A|\lambda.$

In general, how many rounds will be needed to parse any string $w$ in this language?
User Avatar

1 Answer

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

Related questions

0 votes
0 votes
0 answers
2
Naveen Kumar 3 asked Apr 14, 2019
211 views
Peter Linz Edition 4 Exercise 5.2 Question 19 (Page No. 145)
Prove the following result. Let $G = (V, T, S, P )$ be a context-free grammar in which every $A ∈ V$ occurs on the left side of at most one production. Then $G$ is unambiguous.
Prove the following result. Let $G = (V, T, S, P )$ be a context-free grammar in which every $A ∈ V$ occurs on the left side of at most one production. Then $G$ is unam...
User Avatar
0 votes
0 votes
1 answer
3
Naveen Kumar 3 asked Apr 14, 2019
328 views
Peter Linz Edition 4 Exercise 5.2 Question 18 (Page No. 145)
Is the string $aabbababb$ in the language generated by the grammar $S → aSS|b$? Show that the grammar with productions $S\rightarrow aAb|\lambda,$ $A\rightarrow aAb|\lambda$ is unambiguous.
Is the string $aabbababb$ in the language generated by the grammar $S → aSS|b$?Show that the grammar with productions$S\rightarrow aAb|\lambda,$$A\rightarrow aAb|\lambd...
User Avatar
Link Copied!