Precedence Highest *, /, not +, -, &, mod - (unary) =, /=, <, <=, >=, > and Lowest or, xor Left to right Associativity Show the order of evaluation of the following expressions by parenthe- sizing all subexpressions and placing a superscript on the right parenthe- sis to indicate order. For example, for the expression a +b* с + d

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...
icon
Related questions
Question
100%

Can you please just solve the 12th question?

9. Assume the following rules of associativity and precedence for
expressions:
Precedence
Highest
*, /, not
+, -, &, mod
- (unary)
=,/=, <, <=, >=, >
and
Lowest
or, xor
Associativity
Left to right
Show the order of evaluation of the following expressions by parenthe-
sizing all subexpressions and placing a superscript on the right parenthe-
sis to indicate order. For example, for the expression
a
+ b * c + d
the order of evaluation would be represented as
((а +
(b * c)')²
+ d) 3
а. а * b
1 + C
b. a
(b -
1) / с mod d
с. (а
b) / с &
(d
e / а - 3)
d. -a or с
d and e
е. а
> b хоr с or d <- 17
f. -а + b
10. Show the order of evaluation of the expressions of Problem 9, assuming
that there are no precedence rules and all operators associate right to left.
11. Write a BNF description of the precedence and associativity rules
defined for the expressions in Problem 9. Assume the only operands are
the names a,b,c,d, and e.
12. Using the grammar of Problem 11, draw parse trees for the expressions
of Problem 9.
Transcribed Image Text:9. Assume the following rules of associativity and precedence for expressions: Precedence Highest *, /, not +, -, &, mod - (unary) =,/=, <, <=, >=, > and Lowest or, xor Associativity Left to right Show the order of evaluation of the following expressions by parenthe- sizing all subexpressions and placing a superscript on the right parenthe- sis to indicate order. For example, for the expression a + b * c + d the order of evaluation would be represented as ((а + (b * c)')² + d) 3 а. а * b 1 + C b. a (b - 1) / с mod d с. (а b) / с & (d e / а - 3) d. -a or с d and e е. а > b хоr с or d <- 17 f. -а + b 10. Show the order of evaluation of the expressions of Problem 9, assuming that there are no precedence rules and all operators associate right to left. 11. Write a BNF description of the precedence and associativity rules defined for the expressions in Problem 9. Assume the only operands are the names a,b,c,d, and e. 12. Using the grammar of Problem 11, draw parse trees for the expressions of Problem 9.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

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