Commit 77a87f18 authored by Gabor Greif's avatar Gabor Greif

fix some typos

parent e6759f06
......@@ -12,7 +12,7 @@ internet.)
Here is how it works.
A constuctor is encoded as a bit stream. To this end, we encode the
A constructor is encoded as a bit stream. To this end, we encode the
index of the constructor as a binary number of a fixed length taking
into account the maximum index for the type at hand. (Similarly, we
could view the list of constructors as a binary tree, and then encode
......
......@@ -136,7 +136,7 @@ type Lookup_table = [Entry]
| get_p1_nmsL rec_flag j [] = ([], j)
(******************************************************************************)
(* Return the lookup table for the constuctors of a pass1 datatype *)
(* Return the lookup table for the constructors of a pass1 datatype *)
(* declaration *)
(******************************************************************************)
......
......@@ -903,7 +903,7 @@ $n=0$, there is only one such radical--- a lone hydrogen atom. When
$n>0$, we construct all canonical 3-partitions $(i,j,k)$ of $n-1$; for
each such partition, we generate, recursively, all radicals {\cf ri}
of size $i$, all radicals {\cf rj} of size $j$ and all radicals {\cf
rk} of size $k$, and constuct the new radical \mbox{\cf (C ri rj rk)}.
rk} of size $k$, and construct the new radical \mbox{\cf (C ri rj rk)}.
Here is the function:
\beginid
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment