Example 5.12 To rewrite the grammar in Example 5.11 we introduce new variables, taking V as {E, T, F, 1 }, and replacing the productions with E - T, T - F, F - I, E - E+T, T - T* F, F - (E), I – a (b|c. A derivation tree of the sentence a + b * c is shown in Figure 5.6. No other derivation tree is possible for this string: The grammar is unambiguous. It is also equivalent to the grammar in Example 5.11 It is not too hard to justify these claims in this specific instance, but, in general, the questions of whether a given context-free grammar is ambiguous or whether two given context-free grammars are equivalent are very difficult to answer. In fact, we will later show that there are no general algorithms by which these questions can always be resolved.

Example 5.12 To rewrite the grammar in Example 5.11 we introduce new variables, taking V as {E, T, F, 1 }, and replacing the productions with E - T, T - F, F - I, E - E+T, T - T* F, F - (E), I – a (b|c. A derivation tree of the sentence a + b * c is shown in Figure 5.6. No other derivation tree is possible for this string: The grammar is unambiguous. It is also equivalent to the grammar in Example 5.11 It is not too hard to justify these claims in this specific instance, but, in general, the questions of whether a given context-free grammar is ambiguous or whether two given context-free grammars are equivalent are very difficult to answer. In fact, we will later show that there are no general algorithms by which these questions can always be resolved.

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

4. Explain ambiguity. Do left factoring with the following grammar- Salablabclabcd
*Theory of Computation* Question: Give a formal description of the grammar PY. You may assume that the given rules are in a set called RULES Use the last picture to write a formal description
Consider the following grammar : S a|b|(T) T T,S | S a) Whatisthetypeofthisgrammar?b) Givethefourelementsofthisgrammar{T,N,S,P} c) Draw the parse tree for : (a,b) and (b,(a,a))
3. Let L = {abcm | n,m E N}. Create a context-free grammar for L starting with non-terminal S. 4. b.A: push(E) b,X; push(B) a.A: push(A) a,X; push(A) Consider the given PDA with bottom stack symbol X. It corresponds to a regular language. Create a regular expression for the language accepted by this PDA. A.B: nop A, E; nop c.B:nop q1
Q2. a) Consider the following grammar for expressions: →→ = -A|B|C - . Derivation Method . ) Show a leftmost derivation and a parse tree for the the statement: A (B+C) *A Parse Tree
Computer Science Let L = { w e {a,b,c}*: w has a substring 'aa' and a substring 'ab'} a. Find a NFA for L o. Give a regular expression for L. c. Find a right linear grammar for L.
PROBLEM 8 Erom the following grammar eliminate useless symbols. S → A11B| 11A S → AB|11 -> -> A →0 B → BB
(a) Exhibit a derivation of the string aaaa using the following phrase structured grammar: S → YZY Z → BZC| E ВС Сав Ва — ав аС — Са BY → Y ҮС — Y Y → E (b) Find a match for the following instance of the Post Correspondence Problem (PCP): {=} {三目圖} b a bb
Both
01: For the following grammar: E- E ab F |T T→ T ba|F F → a|b|[E] Parse the sentence "abaaba "by using predictive parsing method.
Exercise 2: The following shows a simple context free grammar (CFG) : Exercise 3: Consider the following grammar : Which of the following sentences are recognized by this grammar: 5+9+5, 2+8*(4*9)*4*(7+6), 3+7-2 S T E →>> T→> F→ ab (T) T,S | S E+T T T*F F nb (E) a) What is the type of this grammar ? b) Give the four elements of this grammar {T,N,S,P} c) Draw the parse tree for: (a,b) and (b,(a,a))
1. Draw neat labeled diagrams Eliminate the left recursion of the following grammar. S->(x)/x L->L,S/S