Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
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: = + | + | ( ) |a|b|c b. This grammar: := | ::= wilma | betty | ::= fred | barney | 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.)

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: = + | + | ( ) |a|b|c b. This grammar: := | ::= wilma | betty | ::= fred | barney | 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.)

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
100%

ONLY SOLVE EXERCISE 4 in full PLEASE and thanks

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>) 10 d. This grammar: <s> :: = <round> <square> | <outer> <round>:= (<round> ) | 0 <square> ::= [ <square> 1 | [] <outer> : <outer> ] | <inner> ] <inner> ::=) <inner> [ ) [ Exercise 4 For each of the grammars in Exercise 3 except the last, give an unam- biguous grammar for the same language. (The last grammar in that exercise is a classic example of an inherently ambiguous grammar-it cannot be fixed!)
Transcribed Image Text: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>) 10 d. This grammar: <s> :: = <round> <square> | <outer> <round>:= (<round> ) | 0 <square> ::= [ <square> 1 | [] <outer> : <outer> ] | <inner> ] <inner> ::=) <inner> [ ) [ Exercise 4 For each of the grammars in Exercise 3 except the last, give an unam- biguous grammar for the same language. (The last grammar in that exercise is a classic example of an inherently ambiguous grammar-it cannot be fixed!)
Expert Solution
Step 1

Answer:

We have explain exercise 4 because it consists of question exercise3 a, b , c  and d part but we have explain in first three from the part in the brief explanation.

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS