7.4.36 | 6.4.36 |
do not change the input format except to allow "share" to agree with its noun |
2.5 |
7.4.35 | 6.4.35 |
|
2 |
6.9.50 |
7.8.61 |
he's considering the cursor to be in front of a character rather than
at a character don't forget to let them quit, too! |
3 |
Option: add two more commands to load and save the text from/to a
file |
2 |
8.7.54 8.7.55 |
P-8.60 P-8.61 |
choose one or the other |
2 |
Option: do both and write a short — 1-2 pages — paper
detailing their differences |
2 |
8.7.43 8.7.44 |
8.7.49 8.7.50 |
choose one or the other |
3 |
Option: do both and write a short — 1-2 pages — paper
detailing their differences |
2 |
8.7.58 |
8.7.64 |
minimal operations to include are +, -, *, /, % (call fmod if using double values in C++), and parentheses to alter
precedence; but not the "For an additional challenge..." (see the
projects..!)
to test your tree, you can design them by hand in the code this time;
parsing is a bit harder and worth more
here're some links to help you
get started |
4 |
Option: write a token stream level parser
this would take a stream of tokens like operators and numbers and
parentheses and turn it into a tree |
1 |
Option: write a lexer for expressions
this would take an expression typed by the user and turn it into either
a tree directly or a token stream for the above option to parse;
here're some links to help you
get started |
1.5 |
Option: use an iterator class for your
expression tree |
1 |
9.7.49 | 9.7.50 |
|
2 |
9.7.54 | 9.7.55 |
|
2 |
9.7.47 | 9.7.48 |
do not change the input format except to allow "share" to agree with its noun |
2.5 |
9.7.55 | 9.7.56 |
|
3 |
10.8.61 | 10.6.73 |
implementation time! |
3 |
10.8.59 |
10.6.71 |
C++ students: you'll need to implement a skip list, too |
4 |
Option: do the follow-up problem: 10.8.60/10.6.72 |
5 |
more coming 'soon'? |