Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
6. Using the following grammar, show a parse tree and rightmost derivation for A= (B+ (A+ (CA)))

6. Using the following grammar, show a parse tree and rightmost derivation for A= (B+ (A+ (CA)))

Database System Concepts
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
icon
Related questions
Question
### Grammar and Parse Tree in Context of Simple Assignment Statements #### Problem Statement: Using the following grammar, show a parse tree and rightmost derivation for \[ A = ( B + ( A + ( C * A ) ) ) \] #### A Grammar for Simple Assignment Statements ``` <assign> → <id> = <expr> <id> → A | B | C <expr> → <id> + <expr> | <id> * <expr> | ( <expr> ) | <id> ``` --- ### Explanation #### Rightmost Derivation 1. Start with: \[ \langle \text{assign} \rangle \] 2. Replaced by: \[ \langle \text{id} \rangle = \langle \text{expr} \rangle \] 3. Substitute \[ \langle \text{id} \rangle \] with A: \[ A = \langle \text{expr} \rangle \] 4. Derive \[ \langle \text{expr} \rangle \] as a plus operation: \[ A = \langle \text{id} \rangle + \langle \text{expr} \rangle \] 5. Substitute \[ \langle \text{id} \rangle \] with B: \[ A = B + \langle \text{expr} \rangle \] 6. Derive the next expression with parentheses: \[ A = B + ( \langle \text{expr} \rangle ) \] 7. Inside parentheses, apply plus operation to \[ \langle \text{expr} \rangle \]: \[ A = B + ( \langle \text{id} \rangle + \langle \text{expr} \rangle ) \] 8. Substitute \[ \langle \text{id} \rangle \] inside parentheses with A: \[ A = B + ( A + \langle \text{expr} \rangle ) \] 9. Derive the next expression with parentheses and multiplication: \[ A = B + ( A + ( \langle \text{expr} \rangle \langle \text{expr} \rangle \) ) \] 10.
Transcribed Image Text:### Grammar and Parse Tree in Context of Simple Assignment Statements #### Problem Statement: Using the following grammar, show a parse tree and rightmost derivation for \[ A = ( B + ( A + ( C * A ) ) ) \] #### A Grammar for Simple Assignment Statements ``` <assign> → <id> = <expr> <id> → A | B | C <expr> → <id> + <expr> | <id> * <expr> | ( <expr> ) | <id> ``` --- ### Explanation #### Rightmost Derivation 1. Start with: \[ \langle \text{assign} \rangle \] 2. Replaced by: \[ \langle \text{id} \rangle = \langle \text{expr} \rangle \] 3. Substitute \[ \langle \text{id} \rangle \] with A: \[ A = \langle \text{expr} \rangle \] 4. Derive \[ \langle \text{expr} \rangle \] as a plus operation: \[ A = \langle \text{id} \rangle + \langle \text{expr} \rangle \] 5. Substitute \[ \langle \text{id} \rangle \] with B: \[ A = B + \langle \text{expr} \rangle \] 6. Derive the next expression with parentheses: \[ A = B + ( \langle \text{expr} \rangle ) \] 7. Inside parentheses, apply plus operation to \[ \langle \text{expr} \rangle \]: \[ A = B + ( \langle \text{id} \rangle + \langle \text{expr} \rangle ) \] 8. Substitute \[ \langle \text{id} \rangle \] inside parentheses with A: \[ A = B + ( A + \langle \text{expr} \rangle ) \] 9. Derive the next expression with parentheses and multiplication: \[ A = B + ( A + ( \langle \text{expr} \rangle \langle \text{expr} \rangle \) ) \] 10.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Bare Bones Programming Language
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS