(2) Fill the proper words in the blanks: it can be accepted by a DFA. A language is context-free (i) A language is regular if and only if it can be accepted by (ii) Let G = (V, T, S, P) be a context-free grammar. Given any string w, w belongs to L(G) there exists a derivation tree of G whose yield is w. (iii) Suppose that G=(V, T, S, P) is a context-free grammar. If G doesn't have any rules of the form A →1 and A → B, where A and B are the valuables in V, then the exhaustive search parsing method can be made into an algorithm which can determine if w belongs to L(G) or not in no more than rounds.

(2) Fill the proper words in the blanks: it can be accepted by a DFA. A language is context-free (i) A language is regular if and only if it can be accepted by (ii) Let G = (V, T, S, P) be a context-free grammar. Given any string w, w belongs to L(G) there exists a derivation tree of G whose yield is w. (iii) Suppose that G=(V, T, S, P) is a context-free grammar. If G doesn't have any rules of the form A →1 and A → B, where A and B are the valuables in V, then the exhaustive search parsing method can be made into an algorithm which can determine if w belongs to L(G) or not in no more than rounds.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A grammar G is ambiguous if it produces several (more than 1) derivation trees for the same string in L(G). Consider the following grammar: + ; * ; ( ); 1. 2. 3. 4. → a; 5. → b; 6. → c; Show that G is ambiguous.
7. Let G, H be context-free grammars. Is it true that the language L(G)—L(H) is context-free? Justify your answer. Symbol - denotes the symmetric difference. For sets A, B, A-B = A \ B U B \ A.
(5) Consider the grammar G=(V,T,E,P) with V={E,I}, T={a, b, c, +,-, *, (. )}, and productions R → R+R|R -R | R* | (R) I = a|b|c. ) Show that G is ambiguous by giving two different derivation trees for string b+c-a (ii) Change the above grammar into the one without ambiguity.
1 1.12 3 4. 5. . ... Theorem: Let G= (V,T,P.S) be a rghtlimear grammar. Then there exists a language L(G) which is accepted by a FA. i. , the language generated from the regular grammar is regular language. 1/1 lilil
We say that a context-free grammar G is self-referential if for some non-terminal symbol X we have X→ aX3, where a, ße. Show that a CFG that is not self-referential is regular.
Question 3 a) Consider the grammar E → E + E | E ∗ E | (E) | id. I. Change ambiguous grammar to non-ambiguous? II. Give a context-free grammar for generating the set of palindromes over the alphabet a,b. III. Give a context-free grammar for generating all strings over a,b such that | a |= 2∗ | b
Computer Science
Problem 3: Consider the grammar S → aSlaSbS|e. This grammar is ambiguous. (a) Show in particular that the string aab has two parse trees. (b) Generate an unambiguous grammar for the language generated by the given grammar.
Let LL be the set of (codes for) context-free grammars GG such that L(G)L(G) contains at least one palindrome. Show that LL is undecidable. Hint: Reduce PCP to LL by constructing, from each instance of PCP a grammar whose language contains a palindrome if and only if the PCP instance has a solution