You are given a context free grammar G and a string S. Find the minimum Levenshtein distance between S and any string W accepted by G. The first line of the input contains two space-separated integers Vand R denoting the number of non-terminals and the number of productions of G The following R lines describe productions. Each line starts with an integer Tdenoting the production type. If T=0, a space and three space-separated integers X, Yand Z denoting a production X→YZ If T=1, a space, an integer X, another space and a character cdenoting a production X→c If T=2, a space and a single integer X denoting a production X→ε The next line contains a single integer ST denoting the starting symbol of G. Last line contains the string S as explained in statement. Input: 5 7 0 0 1 2 0 0 3 4 2 0 1 1 a 1 3 b 0 4 0 3 0 2 0 1 0 ababb Output: 2
You are given a context free grammar G and a string S. Find the minimum Levenshtein distance between S and any string W accepted by G. The first line of the input contains two space-separated integers Vand R denoting the number of non-terminals and the number of productions of G The following R lines describe productions. Each line starts with an integer Tdenoting the production type. If T=0, a space and three space-separated integers X, Yand Z denoting a production X→YZ If T=1, a space, an integer X, another space and a character cdenoting a production X→c If T=2, a space and a single integer X denoting a production X→ε The next line contains a single integer ST denoting the starting symbol of G. Last line contains the string S as explained in statement. Input: 5 7 0 0 1 2 0 0 3 4 2 0 1 1 a 1 3 b 0 4 0 3 0 2 0 1 0 ababb Output: 2
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...
Related questions
Question
100%
You are given a context free grammar G and a string S. Find the minimum Levenshtein distance between S and any string W accepted by G.
- The first line of the input contains two space-separated integers Vand R denoting the number of non-terminals and the number of productions of G
- The following R lines describe productions.
- Each line starts with an integer Tdenoting the production type.
- If T=0, a space and three space-separated integers X, Yand Z denoting a production X→YZ
- If T=1, a space, an integer X, another space and a character cdenoting a production X→c
- If T=2, a space and a single integer X denoting a production X→ε
- The next line contains a single integer ST denoting the starting symbol of G.
- Last line contains the string S as explained in statement.
Input:
5 7
0 0 1 2
0 0 3 4
2 0
1 1 a
1 3 b
0 4 0 3
0 2 0 1
0
ababb
Output:
2
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY