Answered: S --> L . R L.pos = 0; R.pos = -1;…

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

Question

Productions Semantic Rules
S --> L . R L.pos = 0; R.pos = -1; S.val = L.val + R.val
S --> L L.pos = 0; S.val = L.val;
L --> L1 B L1.pos = L.pos + 1; B.pos = L.pos; L.val = L1.val + B.val;
L --> B B.pos = L.pos; L.val = B.val;
R --> R1 B R1.pos = R.pos - 1; B.pos = R.pos; L.val = L1.val + B.val;
R --> B B.pos = R.pos; L.val = B.val;
B --> 0 B.val = 0;
B --> 1 B.val = 1*2B.pos;

Create an annotated parse tree for the following input strings:

b) 010.1111

Expert Solution

Step 1

S --> L . R L.pos = 0; R.pos = -1; S.val = L.val + R.val
S --> L L.pos = 0; S.val = L.val;
L --> L1 B L1.pos = L.pos + 1; B.pos = L.pos; L.val = L1.val + B.val;
L --> B B.pos = L.pos; L.val = B.val;
R --> R1 B R1.pos = R.pos - 1; B.pos = R.pos; L.val = L1.val + B.val;
R --> B B.pos = R.pos; L.val = B.val;
B --> 0 B.val = 0;
B --> 1 B.val = 1*2B.pos;

Step by step

Solved in 2 steps with 1 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