This preview shows page 1. Sign up to view the full content.
Unformatted text preview: <integer> รท <digit>  <digit> <integer> <digit> รท 0  1  2  . ..  9 <optional exponent> รท <exponent>  8 <exponent> รท <E> <sign> <integer> <D> รท d  D  . <E> รท e  E Matt jokingly offered the following as well, which is the underlying bit pattern guaranteed by the Java documentation. <IEEEdouble> รท <bit><bit><bit><bit> . .. <bit> [there are 64 <bit>s here] <bit> รท 01 If I were writing the grammar of an IEEE double, Matt, I would instead tell you what that bit pattern represented in order from left to right, by using meaningful names as follows. <IEEE double> รท <sign> <exponent> <mantissa> <sign> รท <bit> <exponent> รท <bit> <bit> . .. <bit> [there are 11 <bit>s here] <mantissa> รท <bit> <bit> <bit> . .. <bit> [there are 52 <bit>s here] <bit> รท 0  1 14. The following Mealy machine by Doyle or by Das solves problem #14. Notice the convention of labeling the states meaningfully....
View
Full
Document
This homework help was uploaded on 04/19/2008 for the course COMP 314 taught by Professor Chase during the Spring '08 term at Dickinson.
 Spring '08
 CHASE
 Computer Science

Click to edit the document details