A Grammar for a Simple Assignment Statements GIVEN: → = → A | B | C → + | * | () | QUESTIONS: Write the statement A = (A + B) * C using the grammar above. → = → A = → A = * → A = C * → A = C * () → A = C * ( + ) → A = C * (A + ) → A = C * (A + ) → A = C * (A + B) //not sure if this is ok (same here) Write the statement A = A + (B * C) using the grammar above. -> = -> A = -> A = + -> A = A + -> A = A + () -> A = A + ( * ) -> A = A + (B * ) -> A = A + (B * ) -> A = A + (B * C) Is the given grammar ambiguous? If YES → modified version that will make it unambiguous. If NO → identify at least 3 reasons why the grammar is NOT ambiguous.
A Grammar for a Simple Assignment Statements GIVEN: → = → A | B | C → + | * | () | QUESTIONS: Write the statement A = (A + B) * C using the grammar above. → = → A = → A = * → A = C * → A = C * () → A = C * ( + ) → A = C * (A + ) → A = C * (A + ) → A = C * (A + B) //not sure if this is ok (same here) Write the statement A = A + (B * C) using the grammar above. -> = -> A = -> A = + -> A = A + -> A = A + () -> A = A + ( * ) -> A = A + (B * ) -> A = A + (B * ) -> A = A + (B * C) Is the given grammar ambiguous? If YES → modified version that will make it unambiguous. If NO → identify at least 3 reasons why the grammar is NOT ambiguous.
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
Related questions
Question
A Grammar for a Simple Assignment Statements
GIVEN:
<assign> → <id> = <expr>
<id> → A | B | C
<expr> → <id > + <expr>
| <id > * <expr>
| (<expr>)
| <id>
QUESTIONS:
- Write the statement A = (A + B) * C using the grammar above.
<assign> → <id> = <expr>
→ A = <expr>
→ A = <id > * <expr>
→ A = C * <expr>
→ A = C * (<expr>)
→ A = C * (<id> + <expr>)
→ A = C * (A + <expr>)
→ A = C * (A + <id>)
→ A = C * (A + B) //not sure if this is ok (same here)
- Write the statement A = A + (B * C) using the grammar above.
<assign> -> <id> = <expr>
-> A = <expr>
-> A = <id> + <expr>
-> A = A + <expr>
-> A = A + (<expr>)
-> A = A + (<id> * <expr>)
-> A = A + (B * <expr>)
-> A = A + (B * <id>)
-> A = A + (B * C)
- Is the given grammar ambiguous?
- If YES → modified version that will make it unambiguous.
- If NO → identify at least 3 reasons why the grammar is NOT ambiguous.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education