please answer this asap, thanks you read both picturess give an unambiguous grammar for the same language. Exercise 3 Show that each of the following grammars is ambiguous. (To showthat a grammar is ambiguous, you must demonstrate that it can generate two parsetrees for the same string.)a. The grammar G4, repeated here:G4: :: = + | * | ( )| a | b | cb. This grammar: : : = | ::= wilma | betty | ::= fred | barney | c. The following grammar for strings of balanced parentheses. (A language ofany number of different kinds of balanced parentheses is called a Dyck lan-guage. This type of language plays an interesting role in the theory of formallanguages.) :: = | ( ) | ()

Answered: Exercise 3 Show that each of the…

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

Related questions

Concept explainers

Question

100%

please answer this asap, thanks you read both picturess

give an unambiguous grammar for the same language.

Exercise 3 Show that each of the following grammars is ambiguous. (To show
that a grammar is ambiguous, you must demonstrate that it can generate two parse
trees for the same string.)
a. The grammar G4, repeated here:
G4: <exp> :: =
<exp> + <exp>
| <exp>
* <exp>
| ( <exp> )
| a | b | c
b. This grammar:
<person> : : = <woman> | <man>
<woman> ::= wilma | betty | <empty>
<man> ::= fred | barney | <empty>
c. The following grammar for strings of balanced parentheses. (A language of
any number of different kinds of balanced parentheses is called a Dyck lan-
guage. This type of language plays an interesting role in the theory of formal
languages.)
<S> :: = <S> <S> | ( <s> ) | ()

Expert Solution

Step 1

Given Grammar:

(a) $< \exp > : : = < \exp > + < \exp > | < \exp > * < \exp > | (< \exp >) | a | b | c .$

(b) $\begin{array}{rcl} < & person > : : = < woman > | < man > \\ < & woman > : : = wilma | betty | < empty > \\ < & man > : : = fred | barney | < empty > \end{array}$

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions