Let G = (V. E. P, S) be a context-free grammar in whichS only when n = 0. G is an LR(k) grammar (k ≥ 0) if(i) SaAw⇒ aßw, where a, ß € V*, we Σ*,RR(ii) Sα'A'w'α'B'w', where o', ß' = V*, w' e Σ*, andR(iii) the first aß + k symbols of aßw and a'B'w' coincide. Then α = α',A = A', B = B'.

Let G = (V. E, P, S) be a context-free grammar in which SS only when n = 0. G is an LR(k) grammar (k ≥ 0) if (i) SaAwaßw, where a, ße V. we Σ*, R R (ii) Sα'A'w' a'B'w', where o', B' e V*, w' e Σ*, and R R (iii) the first aß + k symbols of aßw and a'B'w' coincide. Then a = α', A = A', B = B'.

Let G = (V. E, P, S) be a context-free grammar in which SS only when n = 0. G is an LR(k) grammar (k ≥ 0) if (i) SaAwaßw, where a, ße V. we Σ, R R (ii) Sα'A'w' a'B'w', where o', B' e V, w' e Σ*, and R R (iii) the first aß + k symbols of aßw and a'B'w' coincide. Then a = α', A = A', B = B'.

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

24. Show that the grammars and are not equivalent. S → aSb|bSa|SS|a S aSb|bSala
4. Construct a Chomsky normal form grammar for L(G) for the following cfg G: G=({S,B}, {a,b,c,d}, {S→BdSaSaS|BSS|b, B->cSda|S|dcb}, S). Note: You must first remove all unit productions.
Given the following grammar in BNF: → < var > = → X | Y | Z → % | → ? | → ( ) | < var > a) Change the grammer rules so that ! and ~ unary operators can be produced. b) Change the grammer so that % has higher precedence than ?. Moreover % should be right associative.
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).
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
Let G be the following grammar: S → aABbCD A - ASd|ɛ B → SAC |hC |E C→ Sf|Cg D - ED |E The number of productions that will remain in G after elimination of all null productions
1. Which of the following regular expressions best describes L(G), where G is the left-linear grammar { S → Ab | Ba , A → a| Aa , B → b| Bb }? A. aa*b + bb*a B. ab* + ba* C. (a+b)(a* + b*) 2. Given an NFA M with n states and an arbitrary string x of length p, determining whether or not x is in L(M) can be done in A. O(n+p) В. О(2а + р) C. O(np) D. O(p") steps. 3. What is the simplest regular expression equivalent to (a*b*c* + c*b*a*)* ? A. (a + b+ c)* B. (abc + cba)* C. It is already in its simplest form. 4. What does the egrep pattern "b?[ab]{1,2}" translate into? A. (b + ɛ)(a + b+ aa + ab + ba + bb) B. (bal + bb1 + ba2 + bb2) C. (al + a2 + b1 + b2 + ba1 + ba2 + bb1 + bb2)
2. Are the following languages context-free or non-context-free? • If a language is context-free, give a context-free grammar that generates it. • If a language is not context-free, prove this using the pumping lemma. A = { a*b'c*d² |k > i > 0, l>0 } B = {a²i+1fk+1c3l (2k+1q* | i > 1, k > 1, l > 1 } (a) (b)
When is a context free grammar ambiguous? Show that the following grammar is ambiguous: S> AS | A A> Ab | aAb | ab. Construct an equivalent unambiguous grammar.
Can you please help me with this problem because I don't understand how to do this, can you please do it step by step and show something visual that shows why it is ambiguous or not and then can you explain in detail why it is ambiguous or not.
Question: Give a context-free grammar that generates L = {aibj| i, j ∈ N, i ≤ 3j}.
Chapter 11 Section 7 3(b) S-> abA | abcA A -> aA |A Use left-factoring to reduce k in this LL(k) grammar. Please indicate what is k in the resultant grammar and why.