(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

Given L ={ambn | m< n }. Derive (i) a context-free grammar that accepts L (ii) a PDA accepting L by empty store (iii) a PDA accepting L by final state.
Let G = (V, E, R, S) be a grammar with V= {S, H, Gm J}; = {h, g. j}; and the set of rules: H>h | hJG G> Gg | Sg | HgJ J→ jH | HHJ| Jj Convert this grammar to a PDA using the method we described.
1. Prove that the language L(G) is not regular where G is the following context-free grammar: G = ({S,A,B,C}, {a,b}, {S->bB|C, A>b|C, B->Sb, C->aAa }, S). Note: You must first determine L(G).
Complete the proof of Theorem 6.4. Theorem 6.4: Let G = (V, T, S, P) be any context-free grammar without λ-productions. Then there exists a context-free grammar bG = (bV , b T, S, b P) that does not have any unit-productions and that is equivalent to G. 1
1. Consider the following context-free grammar with start symbol S, nonterminals {S, A, B, C}, and terminals {0,1}: SAO A→B A → C1 B→ 1 B→ E C→ 0 (a) Compute all the sets FIRST and FOLLOW necessary to implement a recursive decent parser for this grammar. However, do not list any unnecessary such a set. (b) Investigate all the combinations of sets FIRST and FOLLOW that are involved in the im- plementation of a recursive descent parser for this grammar. Explain how these com- bination make the grammar suitable or unsuitable (as the case might be) for recursive descent parsing.
Q3. Suppose we have a language of pairs. Each pair consists of a context free grammar and a string w such that w can be generated by the context free grammar. Is this language decidable? Make a TM for it if it is.
1)Let G = (V, ∑, R, S) be a grammar with V = {S, H, Gm J}; ∑ = {h, g, j}; and the set of rules: S → H H → h | hJG G → Gg | Sg | HgJ J → jH | HHJ| Jj a)Convert this grammar to a PDA using the method we described. b)Convert G to Chomsky normal form.
1. Consider the regular grammar G given below: S → aS|aA[bB[A A → aA|bS B → bB|aS (a) Give a derivation for the strings aabbba and baaba (b) Give an infinite language L such that L is not a subset of L(G) (c) Give a regular expression that describes the language L(G).
Let ANTIPALINDROME be the language of all even-length strings over the alphabet {a,b} such that, for all i, the i-th letter from the start is different to the i-th letter from the end. Examples of strings in this language include: ε, ab, ba, aabb, abab, baba, bbaa, aaabbb, ... Give a Context-Free Grammar for the language ANTIPALINDROME.
Consider the grammar X --> XY | id Y --> id Check whether the given grammar is LL(1) or not. X and Y are Non Terminals, 'id' is a Terminal.
Consider a grammar for expressions is defined as follows:<assign> → <id> = <expr><id> → A | B | C | D<expr> → <id> + <expr>| <id> * <expr>| ( <expr> )| <id>Give a recursive descent algorithm for the BNF defined above.You may abstract away some details and are expected to make your answer using pseudo code.
Consider a grammar G that includes the four lookahead rules forA. Give the code for GetA (s, i) that is similar to that for GetExp (s, i). We can assumethat it can be parsed, so do not bother with error detection.