Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
To demonstrate that the CYK (Cocke-Younger-Kasami) method can construct the string "ababa" using the context-free grammar (CFG) S -> aSa | bSb ||a|b Make a 2D array (or matrix) of size (n xn), where n is equal to the length of the input string "ababa". The non-terminals that may immediately generate a matching substring of the input string "ababa" should be placed in the diagonal of the matrix. In this instance, just the terminal itself (a or b) is capable of producing an or b. The next step is to fill the matrix so that each point (i, j) contains all non-terminals that can result in the substring from i to j in the input string. We can determine which non-terminals can yield the substring by using the grammar's rules. Check to see if S can be located at location (1,5) once the matrix has been filled.

To demonstrate that the CYK (Cocke-Younger-Kasami) method can construct the string "ababa" using the context-free grammar (CFG) S -> aSa | bSb ||a|b Make a 2D array (or matrix) of size (n xn), where n is equal to the length of the input string "ababa". The non-terminals that may immediately generate a matching substring of the input string "ababa" should be placed in the diagonal of the matrix. In this instance, just the terminal itself (a or b) is capable of producing an or b. The next step is to fill the matrix so that each point (i, j) contains all non-terminals that can result in the substring from i to j in the input string. We can determine which non-terminals can yield the substring by using the grammar's rules. Check to see if S can be located at location (1,5) once the matrix has been filled.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
To demonstrate that the CYK (Cocke-Younger-Kasami) method can construct the string "ababa" using the context-free grammar (CFG) S -> aSa | bSb ||a|b Make a 2D array (or matrix) of size (n xn), where n is equal to the length of the input string "ababa". The non-terminals that may immediately generate a matching substring of the input string "ababa" should be placed in the diagonal of the matrix. In this instance, just the terminal itself (a or b) is capable of producing an or b. The next step is to fill the matrix so that each point (i, j) contains all non-terminals that can result in the substring from i to j in the input string. We can determine which non-terminals can yield the substring by using the grammar's rules. Check to see if S can be located at location (1,5) once the matrix has been filled.
Transcribed Image Text:To demonstrate that the CYK (Cocke-Younger-Kasami) method can construct the string "ababa" using the context-free grammar (CFG) S -> aSa | bSb ||a|b Make a 2D array (or matrix) of size (n xn), where n is equal to the length of the input string "ababa". The non-terminals that may immediately generate a matching substring of the input string "ababa" should be placed in the diagonal of the matrix. In this instance, just the terminal itself (a or b) is capable of producing an or b. The next step is to fill the matrix so that each point (i, j) contains all non-terminals that can result in the substring from i to j in the input string. We can determine which non-terminals can yield the substring by using the grammar's rules. Check to see if S can be located at location (1,5) once the matrix has been filled.
Expert Solution
steps

Step by step

Solved in 3 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS