===================================================================
RCS file: /home/cvs/OpenXM/doc/OpenXM-specs/cmo-basic1.tex,v
retrieving revision 1.4
retrieving revision 1.9
diff -u -p -r1.4 -r1.9
--- OpenXM/doc/OpenXM-specs/cmo-basic1.tex	2000/01/24 02:48:24	1.4
+++ OpenXM/doc/OpenXM-specs/cmo-basic1.tex	2000/09/12 23:09:18	1.9
@@ -1,4 +1,4 @@
-%% $OpenXM: OpenXM/doc/OpenXM-specs/cmo-basic1.tex,v 1.3 2000/01/23 05:28:33 noro Exp $
+%% $OpenXM: OpenXM/doc/OpenXM-specs/cmo-basic1.tex,v 1.8 2000/02/28 14:10:27 takayama Exp $
 //&jp \section{ 数, 多項式 の  CMO 表現 }
 //&eg \section{ CMOexpressions for numbers and polynomials }
 \label{sec:basic1}
@@ -27,15 +27,33 @@
 以下, グループ CMObject/Basic, CMObject/Tree 
 および CMObject/DistributedPolynomial
 に属する CMObject の形式を説明する.
-\noroa{ tagged list を導入すべきか?  cf. SSkan/plugin/cmo.txt }
 
+\noindent
+{\tt OpenXM/src/ox\_toolkit} にある {\tt bconv} をもちいると
+CMO expression を binary format に変換できるので,
+これを参考にするといい.
 */
 /*&eg
 In the sequel, we will explain on the groups
 CMObject/Basic, CMObject/Tree 
 and CMObject/DistributedPolynomial.
+
+\noindent
+The program {\tt bconv} at {\tt OpenXM/src/ox\_toolkit}
+translates 
+CMO expressions into binary formats.
+It is convinient to understand the binary formats explained in
+this section.
 */
 
+/*&C
+\noindent Example:
+\begin{verbatim}
+bash$ ./bconv
+> (CMO_ZZ,123123);
+00 00 00 14 00 00 00 01 00 01 e0 f3 
+\end{verbatim}
+*/
 /*&jp
 
 \bigbreak
@@ -46,9 +64,11 @@ ZZ, QQ, Zero, Rational, Indeterminate,$\in$ CMObject/B
 \mbox{Zero} &:& ({\tt CMO\_ZERO}) \\ 
 & & \mbox{ --- ユニバーサルな ゼロを表す. } \\
 \mbox{ZZ}         &:& ({\tt CMO\_ZZ},{\sl int32}\, {\rm f}, {\sl byte}\, \mbox{a[1]}, \ldots
-{\sl byte}\, \mbox{a[m]} ) \\
+{\sl byte}\, \mbox{a[$|$f$|$]} ) \\
 &:& \mbox{ --- bignum をあらわす. a[i] についてはあとで説明}\\
-\mbox{QQ}        &:& ({\tt CMO\_QQ}, {\sl ZZ}\, {\rm a}, {\sl ZZ}\, {\rm b}) \\
+\mbox{QQ}        &:& ({\tt CMO\_QQ}, 
+                      {\sl int32}\, {\rm m}, {\sl byte}\, \mbox{a[1]}, \ldots, {\sl byte}\, \mbox{a[$|$m$|$]},
+                      {\sl int32}\, {\rm n}, {\sl byte}\, \mbox{b[1]}, \ldots, {\sl byte}\, \mbox{b[$|$n$|$]})\\
 & & \mbox{ --- 有理数 $a/b$ を表す. } \\
 \mbox{Rational}        &:& ({\tt CMO\_RATIONAL}, {\sl CMObject}\, {\rm a}, {\sl CMObject}\, {\rm b}) \\
 & & \mbox{ ---  $a/b$ を表す. } \\
@@ -66,9 +86,11 @@ ZZ, QQ, Zero, Rational, Indeterminate,$\in$ CMObject/B
 \mbox{Zero} &:& ({\tt CMO\_ZERO}) \\ 
 & & \mbox{ --- Universal zero } \\
 \mbox{ZZ}         &:& ({\tt CMO\_ZZ},{\sl int32}\, {\rm f}, {\sl byte}\, \mbox{a[1]}, \ldots
-{\sl byte}\, \mbox{a[m]} ) \\
+{\sl byte}\, \mbox{a[$|$m$|$]} ) \\
 &:& \mbox{ --- bignum. The meaning of a[i] will be explained later.}\\
-\mbox{QQ}        &:& ({\tt CMO\_QQ}, {\sl ZZ}\, {\rm a}, {\sl ZZ}\, {\rm b}) \\
+\mbox{QQ}        &:& ({\tt CMO\_QQ}, 
+                      {\sl int32}\, {\rm m}, {\sl byte}\, \mbox{a[1]}, \ldots, {\sl byte}\, \mbox{a[$|$m$|$]},
+                      {\sl int32}\, {\rm n}, {\sl byte}\, \mbox{b[1]}, \ldots, {\sl byte}\, \mbox{b[$|$n$|$]})\\
 & & \mbox{ --- Rational number $a/b$. } \\
 \mbox{Rational}        &:& ({\tt CMO\_RATIONAL}, {\sl CMObject}\, {\rm a}, {\sl CMObject}\, {\rm b}) \\
 & & \mbox{ ---  Rational expression $a/b$. } \\
@@ -167,7 +189,7 @@ stack machine commands for delayed evaluation.
 However it makes the implementation of stack machines complicated.
 It is desirable that CMObject is independent of OX stack machine.
 Therefore we introduce an OpenMath like tree representation for CMO 
-tree object.
+Tree object.
 This method allows us to implement tree structure easily 
 on individual OpenXM systems.
 Note that CMO Tree corresponds to Symbol and Application in OpenMath.
@@ -194,9 +216,9 @@ It is the same as the Lambda expression in Lisp.
     (CMO_LIST,[size=]1, 
         (CMO_TREE, (CMO_STRING, "plus"), (CMO_STRING, "basic"),
             (CMO_LIST,[size=]2, (CMO_INDETERMINATE,"x"),
-//&jp                                (CMO_TREE,(CMO_STRING, "e"),  自然対数の底
-//&eg                                (CMO_TREE,(CMO_STRING, "e"),  Napier's number
-                                          (CMO_STRING, "basic"))
+//&jp                  (CMO_TREE,(CMO_STRING, "e"),  自然対数の底
+//&eg                  (CMO_TREE,(CMO_STRING, "e"),  the base of natural logarithms
+                            (CMO_STRING, "basic"))
         ))
     )
 )
@@ -206,7 +228,7 @@ It is the same as the Lambda expression in Lisp.
 Example:
 \begin{verbatim}
 sm1> [(plus) (Basic) [(123).. (345)..]] [(class) (tree)] dc ::
-Class.tree [    $plus$ , $Basic$ , [    123 , 345 ]  ] 
+Class.tree [    $plus$ , $basic$ , [    123 , 345 ]  ] 
 \end{verbatim}
 
 
@@ -677,7 +699,7 @@ $\in$ CMObject/MachineDouble \\
 
 \bigbreak
 //&jp 次に IEEE 準拠の float および Big float を定義しよう.
-//&eg We define IEEE conformant float and big float.
+//&eg We define float and big float conforming to the IEEE standard.
 \begin{verbatim}
 #define CMO_BIGFLOAT   50
 #define CMO_IEEE_DOUBLE_FLOAT 51
@@ -688,8 +710,8 @@ IEEE 準拠の float については, IEEE 754 double precisio
 format (64 bit) の定義を見よ.
 */
 /*&eg
-See IEEE 754 double precision floating-point (64 bit) for the details of IEEE
-conformant float.
+See IEEE 754 double precision floating-point (64 bit) for the details of 
+float conforming to the IEEE standard.
 */
 
 \noindent