a) a * b- 1 + c c) (a-b)/c & (d*e/a-3) e) a>b xor c or d<= 17 12) using the grammar of problem 11, draw parse trees for the expressions in question 9 (a and c only) referencing 11) write a BNF grammar for the precedence and associativity rules for problem 9. assume only operands are a,b,c,d and e; BNF: ADD RULES TO COMPLETE THE GRAMMAR S SS | not S | S*S | S/S | O|T|I|N O--> alb|cd|e T--> S+SI ...etc etc etc... N--> -S I--> 0...9 | II specifically: a*e+c S--> S*S --> O*S --> O*T --> O*S+S --> 0*0+0 --> a*e+c

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
icon
Related questions
Question
Expressions in question 9 are a,c,e at the very top. Here are the precedence and associativity rules for question 9. Goal is to find the answer to number 12!
9. Assume the following rules of associativity and precedence for expressions:
Highest
Precedence
Associativity
Lowest
Left to right
*, /, not
+, -, &, mod
- (unary)
=, /=, <, < =, >=, >
and
or, xor
Transcribed Image Text:9. Assume the following rules of associativity and precedence for expressions: Highest Precedence Associativity Lowest Left to right *, /, not +, -, &, mod - (unary) =, /=, <, < =, >=, > and or, xor
a) a * b- 1 + c
c) (a-b)/c & (d*e/a-3)
e) a>b xor c or d<= 17
12) using the grammar of problem 11, draw parse trees for the expressions in question 9 (a and c only)
referencing 11) write a BNF grammar for the precedence and associativity rules for problem 9. assume only operands are a,b,c,d and e;
BNF: ADD RULES TO COMPLETE THE GRAMMAR
S --> SS | not S | S*S | S/S | O|T|I|N
O--> alb|cd|e
T--> S+S|...etc etc etc...
N--> -S
1--> 0...9 | 11
specifically: a*e+c
S--> S*S --> O*S --> O*T --> O*S+S --> 0*0+0 --> a*e+c
Transcribed Image Text:a) a * b- 1 + c c) (a-b)/c & (d*e/a-3) e) a>b xor c or d<= 17 12) using the grammar of problem 11, draw parse trees for the expressions in question 9 (a and c only) referencing 11) write a BNF grammar for the precedence and associativity rules for problem 9. assume only operands are a,b,c,d and e; BNF: ADD RULES TO COMPLETE THE GRAMMAR S --> SS | not S | S*S | S/S | O|T|I|N O--> alb|cd|e T--> S+S|...etc etc etc... N--> -S 1--> 0...9 | 11 specifically: a*e+c S--> S*S --> O*S --> O*T --> O*S+S --> 0*0+0 --> a*e+c
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Sorting
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
  • SEE MORE QUESTIONS
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