MA-351 Homework 3
Due at 9:50 in class, Thursday October 10, 2002
Calculations necessary for these problems may be done either by
hand or with Maple.
Handwritten solutions may be submitted to me in person in class,
or you may email an ASCII text, Maple Worksheet (.mws),
html, or postscipt/pdf-formatted document to me
(kaltofen@math.ncsu.edu).
Note my office hours on my schedule.
- Consider the formula
-
Using the binary operators + (plus), - (minus),
* (times), / (divides),
and ^ (exponentiation), all of which have exactly 2 operands, draw the expression
tree corresponding to this expression.
-
Convert the expression tree into a fully parenthesized linear infix
expression string.
-
Write the postfix expression string equivalent to the expression tree.
-
DMM §3.3, Problem 8, page 107. Note: in order to
have a unique DFS tree, assume that the order of
the neighboring vertices of each vertex is alphabetical
NEW
and that you start at vertex labeled a.
-
Consider the formula
a/(b+c+d) - e*f/g
.
Please give the parse tree for this expression
according to the context free grammar for expressions given in class.