Register

Peter Linz Edition 4 Exercise 6.3 Question 2 (Page No. 173)

175 views
0 votes
0 votes
Use the CYK algorithm to find a parsing of the string $aab$, using the grammar with productions

                  $S\rightarrow AB,$

                  $A\rightarrow BB|a,$

                  $B\rightarrow AB|b.$
User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
0 answers
1
Naveen Kumar 3 asked Apr 19, 2019
152 views
Peter Linz Edition 4 Exercise 6.3 Question 4 (Page No. 173)
Use the CYK method to determine if the string $w = aaabbbbab$ is in the language generated by the grammar $S → aSb|b$.
Use the CYK method to determine if the string $w = aaabbbbab$ is in the language generated by the grammar $S → aSb|b$.
User Avatar
0 votes
0 votes
0 answers
2
Naveen Kumar 3 asked Apr 19, 2019
139 views
Peter Linz Edition 4 Exercise 6.3 Question 3 (Page No. 173)
Use the approach employed in Exercise 2 to show how the CYK membership algorithm can be made into a parsing method.
Use the approach employed in Exercise 2 to show how the CYK membership algorithm can be made into a parsing method.
User Avatar
0 votes
0 votes
0 answers
3
Naveen Kumar 3 asked Apr 19, 2019
175 views
Peter Linz Edition 4 Exercise 6.2 Question 3 (Page No. 169)
Transform the grammar $S\rightarrow aSaA|A, A\rightarrow abA|b$ into Chomsky normal form.
Transform the grammar $S\rightarrow aSaA|A, A\rightarrow abA|b$ into Chomsky normal form.
User Avatar
Link Copied!