From: Dhruv Chawla <[email protected]>
Signed-off-by: Dhruv Chawla <[email protected]>
gcc/algol68/ChangeLog:
* a68-imports-archive.cc (struct Archive_fl_header): Fix typos.
* a68-imports.cc (encoded_mode_free): Likewise.
* a68-low-chars.cc (a68_char_repr): Likewise.
* a68-low-clauses.cc (a68_lower_label): Likewise.
(a68_lower_labeled_unit): Likewise.
(a68_lower_completer): Likewise.
(a68_lower_initialiser_series): Likewise.
(a68_lower_case_clause): Likewise.
* a68-low-decls.cc (a68_lower_variable_declaration): Likewise.
(a68_lower_procedure_variable_declaration): Likewise.
* a68-low-ints.cc (a68_get_int_skip_tree): Likewise.
(a68_int_maxval): Likewise.
* a68-low-moids.cc (lower_struct_mode): Likewise.
* a68-low-multiples.cc (a68_multiple_single_bound_check): Likewise.
* a68-low-prelude.cc (a68_lower_divab3): Likewise.
(a68_lower_upb3): Likewise.
(a68_lower_lwb3): Likewise.
* a68-low-procs.cc (a68_get_proc_skip_tree): Likewise.
* a68-low-reals.cc (a68_real_maxval): Likewise.
(a68_real_minval): Likewise.
* a68-low-units.cc (a68_lower_identifier): Likewise.
* a68-low.cc (a68_low_assignation): Likewise.
* a68-moids-misc.cc (a68_is_firm): Likewise.
(a68_is_coercible_series): Likewise.
* a68-parser-bottom-up.cc (strange_separator): Likewise.
(a68_bottom_up_parser): Likewise.
* a68-parser-prelude.cc (stand_prelude): Likewise.
* a68-parser-scanner.cc (a68_lexical_analyser): Likewise.
* a68-parser-scope.cc (a68_scope_checker): Likewise.
* a68-parser-serial-dsa.cc (serial_dsa_check_serial_clause): Likewise.
* a68-parser-taxes.cc (test_firmly_related_ops_local): Likewise.
* a68-parser.cc: Likewise.
* a68-types.h (struct KEYWORD_T): Likewise.
(struct OPTIONS_T): Likewise.
(struct NODE_T): Likewise.
(struct MODE_CACHE_T): Likewise.
* ga68-coding-guidelines.texi: Likewise.
* ga68.texi: Likewise.
libga68/ChangeLog:
* ga68-error.c: Fix typos.
* ga68-unistr.c (_libga68_u32_cmp): Likewise.
(_libga68_u8_uctomb): Likewise.
(_libga68_u32_to_u8): Likewise.
---
gcc/algol68/a68-imports-archive.cc | 2 +-
gcc/algol68/a68-imports.cc | 4 ++--
gcc/algol68/a68-low-chars.cc | 2 +-
gcc/algol68/a68-low-clauses.cc | 10 +++++-----
gcc/algol68/a68-low-decls.cc | 4 ++--
gcc/algol68/a68-low-ints.cc | 4 ++--
gcc/algol68/a68-low-moids.cc | 2 +-
gcc/algol68/a68-low-multiples.cc | 4 ++--
gcc/algol68/a68-low-prelude.cc | 6 +++---
gcc/algol68/a68-low-procs.cc | 2 +-
gcc/algol68/a68-low-reals.cc | 4 ++--
gcc/algol68/a68-low-units.cc | 2 +-
gcc/algol68/a68-low.cc | 4 ++--
gcc/algol68/a68-moids-misc.cc | 4 ++--
gcc/algol68/a68-parser-bottom-up.cc | 6 +++---
gcc/algol68/a68-parser-prelude.cc | 4 ++--
gcc/algol68/a68-parser-scanner.cc | 2 +-
gcc/algol68/a68-parser-scope.cc | 2 +-
gcc/algol68/a68-parser-serial-dsa.cc | 2 +-
gcc/algol68/a68-parser-taxes.cc | 2 +-
gcc/algol68/a68-parser.cc | 2 +-
gcc/algol68/a68-types.h | 12 ++++++------
gcc/algol68/ga68-coding-guidelines.texi | 4 ++--
gcc/algol68/ga68.texi | 6 +++---
libga68/ga68-error.c | 2 +-
libga68/ga68-unistr.c | 8 ++++----
26 files changed, 53 insertions(+), 53 deletions(-)
diff --git a/gcc/algol68/a68-imports-archive.cc
b/gcc/algol68/a68-imports-archive.cc
index e6951a3f2ec..bd6b8a82b4d 100644
--- a/gcc/algol68/a68-imports-archive.cc
+++ b/gcc/algol68/a68-imports-archive.cc
@@ -74,7 +74,7 @@ struct Archive_fl_header
};
// The header of an entry in an archive. This is all readable text,
-// padded with spaces where necesary.
+// padded with spaces where necessary.
struct Archive_header
{
diff --git a/gcc/algol68/a68-imports.cc b/gcc/algol68/a68-imports.cc
index c9385d742db..8b77bbf0b76 100644
--- a/gcc/algol68/a68-imports.cc
+++ b/gcc/algol68/a68-imports.cc
@@ -79,7 +79,7 @@
} while (0)
/* Parse module map information in MAP and add entries to A68_MODULE_FILES
- accordingly. Existing entries in the map are overriden without warning.
+ accordingly. Existing entries in the map are overridden without warning.
If MAP is not a valid module map specification then this function returns
`false' and sets *ERRMSG to some explanatory message. Otherwise it returns
@@ -664,7 +664,7 @@ encoded_mode_free (struct encoded_mode *em)
break;
case GA68_MODE_STRUCT:
/* Note that the field names are installed in moids in
- encoded_mode_to_moid, so we shoud not free them. */
+ encoded_mode_to_moid, so we should not free them. */
free (em->data.sct.fields);
break;
case GA68_MODE_UNION:
diff --git a/gcc/algol68/a68-low-chars.cc b/gcc/algol68/a68-low-chars.cc
index 24449347555..dc01db0f7df 100644
--- a/gcc/algol68/a68-low-chars.cc
+++ b/gcc/algol68/a68-low-chars.cc
@@ -107,7 +107,7 @@ a68_char_repr (NODE_T *p, tree val)
fold_convert (a68_char_type, c));
}
-/* the ABS of a CHAR is an INT containing an unique value for each permissable
+/* the ABS of a CHAR is an INT containing an unique value for each permissible
char value. */
tree
diff --git a/gcc/algol68/a68-low-clauses.cc b/gcc/algol68/a68-low-clauses.cc
index bdd857b7e0b..9fca4b872bc 100644
--- a/gcc/algol68/a68-low-clauses.cc
+++ b/gcc/algol68/a68-low-clauses.cc
@@ -107,7 +107,7 @@ a68_lower_label (NODE_T *p, LOW_CTX_T ctx)
a68_add_decl (label_decl);
- /* Return the accummulated LABEL_EXPRs. */
+ /* Return the accumulated LABEL_EXPRs. */
tree label_expr = build1 (LABEL_EXPR, void_type_node, label_decl);
if (expr)
return fold_build2_loc (a68_get_node_location (p),
@@ -147,7 +147,7 @@ a68_lower_labeled_unit (NODE_T *p, LOW_CTX_T ctx)
that a completer can only appear inside a serial clause.
This function always returns NULL_TREE, so the traversing code shall always
- be careful to travese on these nodes explicitly and ignore the returned
+ be careful to traverse on these nodes explicitly and ignore the returned
value. */
tree
@@ -173,7 +173,7 @@ a68_lower_completer (NODE_T *p ATTRIBUTE_UNUSED, LOW_CTX_T
ctx ATTRIBUTE_UNUSED)
BLOCK.
This function always returns NULL_TREE, so the traversing code shall always
- be careful to travese on these nodes explicitly and ignore the returned
+ be careful to traverse on these nodes explicitly and ignore the returned
value. */
tree
@@ -205,7 +205,7 @@ a68_lower_initialiser_series (NODE_T *p, LOW_CTX_T ctx)
See the function body to see the lowering actions.
This function always returns NULL_TREE, so the traversing code shall always
- be careful to travese on these nodes explicitly and ignore the returned
+ be careful to traverse on these nodes explicitly and ignore the returned
value. */
tree
@@ -858,7 +858,7 @@ a68_lower_case_clause (NODE_T *p ATTRIBUTE_UNUSED,
clause.
This function always returns NULL_TREE, so the traversing code shall always
- be careful to travese on these nodes explicitly and ignore the returned
+ be careful to traverse on these nodes explicitly and ignore the returned
value. */
tree
diff --git a/gcc/algol68/a68-low-decls.cc b/gcc/algol68/a68-low-decls.cc
index 56edacf5092..532f5b65c3b 100644
--- a/gcc/algol68/a68-low-decls.cc
+++ b/gcc/algol68/a68-low-decls.cc
@@ -164,7 +164,7 @@ a68_lower_variable_declaration (NODE_T *p, LOW_CTX_T ctx)
{
/* The qualifier determines what kind of generator is used in the
variable declaration. This is already annotated in the tax entry
- for the definining identifier. */
+ for the defining identifier. */
declarer = NEXT (q);
defining_identifier = NEXT (NEXT (q));
}
@@ -576,7 +576,7 @@ a68_lower_procedure_variable_declaration (NODE_T *p,
LOW_CTX_T ctx)
else if (IS (q, QUALIFIER))
/* The qualifier determines what kind of generator is used in the
variable declaration. This is already annotated in the tax entry
- for the definining identifier. */
+ for the defining identifier. */
defining_identifier = NEXT (NEXT (q));
else
gcc_unreachable ();
diff --git a/gcc/algol68/a68-low-ints.cc b/gcc/algol68/a68-low-ints.cc
index 72953d24d6f..d80d35e8302 100644
--- a/gcc/algol68/a68-low-ints.cc
+++ b/gcc/algol68/a68-low-ints.cc
@@ -65,7 +65,7 @@ a68_get_int_skip_tree (MOID_T *m)
return build_int_cst (type, 0);
}
-/* Given an integral type, build the maximum value expressable in that
+/* Given an integral type, build the maximum value expressible in that
type. */
tree
@@ -74,7 +74,7 @@ a68_int_maxval (tree type)
return fold_convert (type, TYPE_MAX_VALUE (type));
}
-/* Given an integral type, build the minimum value expressable in that
+/* Given an integral type, build the minimum value expressible in that
type. */
tree
diff --git a/gcc/algol68/a68-low-moids.cc b/gcc/algol68/a68-low-moids.cc
index b5bf46c8cf8..5c1fda6d1c8 100644
--- a/gcc/algol68/a68-low-moids.cc
+++ b/gcc/algol68/a68-low-moids.cc
@@ -275,7 +275,7 @@ lower_struct_mode (MOID_T *m)
TYPE_FIELDS (struct_type) = NULL_TREE;
TYPE_CXX_ODR_P (struct_type) = 0;
CTYPE (m) = struct_type;
- TYPE_LANG_SPECIFIC (struct_type) = a68_build_lang_type (m); /* XXX this will
get overrided. */
+ TYPE_LANG_SPECIFIC (struct_type) = a68_build_lang_type (m); /* XXX this will
get overridden. */
/* Add field declarations. */
chain_struct_fields (PACK (m), struct_type);
diff --git a/gcc/algol68/a68-low-multiples.cc b/gcc/algol68/a68-low-multiples.cc
index bcaa4c28074..b72f8bbb89a 100644
--- a/gcc/algol68/a68-low-multiples.cc
+++ b/gcc/algol68/a68-low-multiples.cc
@@ -64,7 +64,7 @@
There is a triplet per dimension in the multiple. The number of dimensions
in a row mode is static and is determined at compile-time.
- The infomation stored for each triplet is:
+ The information stored for each triplet is:
lb% is the lower bound of the dimension.
ub% is the upper bound of the dimension.
@@ -882,7 +882,7 @@ a68_multiple_single_bound_check (NODE_T *p, tree dim,
/* Return a tree that checks whether the given DIM is a valid dimension/rank of
a boundable object with dimension BOUNDABLE_DIM. If the provided DIM is not
- a valid dimention then a call to the run-time function ARRAYDIM is
+ a valid dimension then a call to the run-time function ARRAYDIM is
performed.
BOUNDABLE_DIM and DIM must be of type sizetype. They are both one-based.
diff --git a/gcc/algol68/a68-low-prelude.cc b/gcc/algol68/a68-low-prelude.cc
index 7fdac27f3a2..804febf2c61 100644
--- a/gcc/algol68/a68-low-prelude.cc
+++ b/gcc/algol68/a68-low-prelude.cc
@@ -580,7 +580,7 @@ a68_lower_divab3 (NODE_T *p, LOW_CTX_T ctx)
/* UPB comes in two flavors.
The unary operator returns the upper bound of the first dimension of the
- operand multple.
+ operand multiple.
The binary operator returns the upper bound of the given dimension of the
operand multiple. The dimension is one-based. If the specified dimension
@@ -630,7 +630,7 @@ a68_lower_upb3 (NODE_T *p, LOW_CTX_T ctx)
/* LWB comes in two flavors.
The unary operator returns the lower bound of the first dimension of the
- operand multple.
+ operand multiple.
The binary operator returns the lower bound of the given dimension of the
operand multiple. The dimension is one-based. If the specified dimension
@@ -681,7 +681,7 @@ a68_lower_lwb3 (NODE_T *p, LOW_CTX_T ctx)
/* ELEMS comes in two flavors.
The unary operator returns the number of elements in the first dimension of
- the operand multple.
+ the operand multiple.
DIM must be a size.
diff --git a/gcc/algol68/a68-low-procs.cc b/gcc/algol68/a68-low-procs.cc
index cc43d52aa6b..a2bc4664b66 100644
--- a/gcc/algol68/a68-low-procs.cc
+++ b/gcc/algol68/a68-low-procs.cc
@@ -47,6 +47,6 @@
tree
a68_get_proc_skip_tree (MOID_T *m)
{
- /* A SKIP for a procecure mode lowers to a NULL pointer to a function. */
+ /* A SKIP for a procedure mode lowers to a NULL pointer to a function. */
return build_int_cst (CTYPE (m), 0);
}
diff --git a/gcc/algol68/a68-low-reals.cc b/gcc/algol68/a68-low-reals.cc
index 4f2d74c5ede..418fbc8b796 100644
--- a/gcc/algol68/a68-low-reals.cc
+++ b/gcc/algol68/a68-low-reals.cc
@@ -97,7 +97,7 @@ a68_real_maxval (tree type)
return build_real (type, max);
}
-/* Given a real type, build the minimum value expressable with that type. */
+/* Given a real type, build the minimum value expressible with that type. */
tree
a68_real_minval (tree type)
@@ -108,7 +108,7 @@ a68_real_minval (tree type)
}
/* Given a real type, build the smallest value which can be meaningfully added
- to or substracted from 1. */
+ to or subtracted from 1. */
tree
a68_real_smallval (tree type)
diff --git a/gcc/algol68/a68-low-units.cc b/gcc/algol68/a68-low-units.cc
index 3cbf131112b..a0e13c44fcb 100644
--- a/gcc/algol68/a68-low-units.cc
+++ b/gcc/algol68/a68-low-units.cc
@@ -148,7 +148,7 @@ a68_lower_identifier (NODE_T *p, LOW_CTX_T ctx)
}
/* If the identifier refers to a FUNCTION_DECL, this means the
- declaration was made by a procecure-identity-dclaration or a
+ declaration was made by a procedure-identity-dclaration or a
proc-identity-declaration of a formal hole. The applied identifier in
that case refers to the address of the corresponding function. */
if (TREE_CODE (id_decl) == FUNCTION_DECL)
diff --git a/gcc/algol68/a68-low.cc b/gcc/algol68/a68-low.cc
index 09cd5339b68..83c740cc774 100644
--- a/gcc/algol68/a68-low.cc
+++ b/gcc/algol68/a68-low.cc
@@ -1005,7 +1005,7 @@ a68_low_assignation (NODE_T *p,
{
/* Make a deep copy of the rhs. Note that we have to use the heap
because the scope of the lhs may be older than the scope of the rhs.
- XXX this can be ommitted if a68_multiple_copy_elems below supports
+ XXX this can be omitted if a68_multiple_copy_elems below supports
overlapping multiples. */
if (HAS_ROWS (mode_rhs))
rhs = a68_low_dup (rhs, true /* use_heap */);
@@ -1016,7 +1016,7 @@ a68_low_assignation (NODE_T *p,
{
/* Assigning to a flexible name updates descriptor with new bounds
and also sets the elements to the dup of the rhs. No boundscheck
- is peformed. XXX but bound checking in contained values may be
+ is performed. XXX but bound checking in contained values may be
necessary, ghost elements. */
if (POINTER_TYPE_P (TREE_TYPE (lhs))
&& TREE_TYPE (TREE_TYPE (lhs)) == TREE_TYPE (rhs))
diff --git a/gcc/algol68/a68-moids-misc.cc b/gcc/algol68/a68-moids-misc.cc
index 8a96f2ce83d..fc5fe2f7fb5 100644
--- a/gcc/algol68/a68-moids-misc.cc
+++ b/gcc/algol68/a68-moids-misc.cc
@@ -710,7 +710,7 @@ a68_is_firm (MOID_T *p, MOID_T *q)
NO_MOID if P cannot be widened to Q.
This means that if P is known to widen to Q (a68_is_widenable (P,Q) return
- true) this function can be invoked repeteadly and it will eventually return
+ true) this function can be invoked repeatedly and it will eventually return
Q. */
MOID_T *
@@ -1012,7 +1012,7 @@ a68_is_coercible_series (MOID_T *p, MOID_T *q, int c, int
deflex)
/* Whether P can be coerced to Q in a C context.
- If P is a STOWED modes serie (A, B, ...) and Q is a routine mode like `proc
+ If P is a STOWED modes series (A, B, ...) and Q is a routine mode like `proc
(X, Y, ...)' then this routine determines whether A can be coerced to X, B
to Y, etc. */
diff --git a/gcc/algol68/a68-parser-bottom-up.cc
b/gcc/algol68/a68-parser-bottom-up.cc
index f6da861bf34..5cc0037ecc0 100644
--- a/gcc/algol68/a68-parser-bottom-up.cc
+++ b/gcc/algol68/a68-parser-bottom-up.cc
@@ -268,7 +268,7 @@ strange_separator (NODE_T *p)
reduce (p, NO_NOTE, NO_TICK, PARTICULAR_PROGRAM, LABEL, ENCLOSED_CLAUSE,
STOP);
reduce (p, NO_NOTE, NO_TICK, PARTICULAR_PROGRAM, ENCLOSED_CLAUSE, STOP);
- We know that at much only one of these reductions will succeed, becuase if
+ We know that at much only one of these reductions will succeed, because if
the first reduction succeeds, then P gets changed to LABEL which cannot
match ENCLOSED_CLAUSE.
@@ -302,7 +302,7 @@ strange_separator (NODE_T *p)
Note how, when presented with a sequence of labels like `l1: l2: l3: ...',
the first call to "reduce" will succeed, turning Q into a LABEL. Then the
- second call to "reduce" will also succed, reducing to another LABEL and
+ second call to "reduce" will also succeed, reducing to another LABEL and
setting SIGA to "true". In subsequent iterations of the loop the first call
will always fail, and the second call will keep succeeding as more sequences
of DEFINING_IDENTIFIER, COLON_SYMBOL get matched. */
@@ -539,7 +539,7 @@ a68_bottom_up_parser (NODE_T *p)
looking for declarations of indicants, priorities and operators
(a68_extract_{indicants,priorities,operators}). Using this information , it
- determines the nature of bold tags occuring in the branch, by turning
+ determines the nature of bold tags occurring in the branch, by turning
BOLD_TAG nodes into either INDICANT nodes or OPERATOR nodes
(a68_elaborate_bold_tags).
diff --git a/gcc/algol68/a68-parser-prelude.cc
b/gcc/algol68/a68-parser-prelude.cc
index 67edf55f9f7..2590a94f031 100644
--- a/gcc/algol68/a68-parser-prelude.cc
+++ b/gcc/algol68/a68-parser-prelude.cc
@@ -831,7 +831,7 @@ stand_prelude (void)
a68_op (A68_STD, "ABS", m, a68_lower_bitabs2);
m = a68_proc (M_SHORT_BITS, M_SHORT_SHORT_BITS, NO_MOID);
a68_op (A68_STD, "LENG", m, a68_lower_bitleng2);
- /* SHORT BITS operatos. */
+ /* SHORT BITS operators. */
m = a68_proc (M_SHORT_INT, M_SHORT_BITS, NO_MOID);
a68_op (A68_STD, "ABS", m, a68_lower_bitabs2);
m = a68_proc (M_SHORT_BITS, M_SHORT_INT, NO_MOID);
@@ -893,7 +893,7 @@ stand_prelude (void)
a68_op (A68_STD, "LENG", m, a68_lower_bitleng2);
m = a68_proc (M_SHORT_BITS, M_BITS, NO_MOID);
a68_op (A68_STD, "SHORTEN", m, a68_lower_bitshorten2);
- /* LONG BITS operatos. */
+ /* LONG BITS operators. */
m = a68_proc (M_LONG_INT, M_LONG_BITS, NO_MOID);
a68_op (A68_STD, "ABS", m, a68_lower_bitabs2);
m = a68_proc (M_LONG_BITS, M_LONG_INT, NO_MOID);
diff --git a/gcc/algol68/a68-parser-scanner.cc
b/gcc/algol68/a68-parser-scanner.cc
index 097accd5322..8d1ee1a11f8 100644
--- a/gcc/algol68/a68-parser-scanner.cc
+++ b/gcc/algol68/a68-parser-scanner.cc
@@ -2331,7 +2331,7 @@ a68_lexical_analyser (const char *filename, bool
*empty_program)
s = STRING (l);
tokenise_source (&root, 0, false, &l, &s, &start_l, &start_c);
- /* Detemine whether the actual file contents resulted in some token. This is
+ /* Determine whether the actual file contents resulted in some token. This
is
used in order to provide better diagnostics for empty source files or
files containing only comments or pragmats. These are not valid Algol 68
packets. */
diff --git a/gcc/algol68/a68-parser-scope.cc b/gcc/algol68/a68-parser-scope.cc
index f9cf2357076..bf7ab10361c 100644
--- a/gcc/algol68/a68-parser-scope.cc
+++ b/gcc/algol68/a68-parser-scope.cc
@@ -1048,7 +1048,7 @@ a68_scope_checker (NODE_T *p)
/* PROC and FORMAT identities can now be assigned a scope. */
bind_scope_to_tags (p);
- /* Now check evertyhing else. */
+ /* Now check everything else. */
gcc_assert (IS (p, PACKET));
if (IS (SUB (p), PARTICULAR_PROGRAM))
scope_particular_program (SUB (p));
diff --git a/gcc/algol68/a68-parser-serial-dsa.cc
b/gcc/algol68/a68-parser-serial-dsa.cc
index b48c13da3bf..1d5ebd5398d 100644
--- a/gcc/algol68/a68-parser-serial-dsa.cc
+++ b/gcc/algol68/a68-parser-serial-dsa.cc
@@ -39,7 +39,7 @@ serial_dsa_check_serial_clause (NODE_T *p, bool *dsa)
{
if (IS (p, GENERATOR))
{
- /* LOC generators always result in dyamic stack allocation regardless
+ /* LOC generators always result in dynamic stack allocation regardless
of the mode of the allocated value. */
if (IS (SUB (p), LOC_SYMBOL))
{
diff --git a/gcc/algol68/a68-parser-taxes.cc b/gcc/algol68/a68-parser-taxes.cc
index 52065531f6b..62418c035ff 100644
--- a/gcc/algol68/a68-parser-taxes.cc
+++ b/gcc/algol68/a68-parser-taxes.cc
@@ -587,7 +587,7 @@ test_firmly_related_ops_local (NODE_T *p, TAG_T *s)
}
}
- /* Report only one level of hidding or it gets messy. */
+ /* Report only one level of hiding or it gets messy. */
break;
}
}
diff --git a/gcc/algol68/a68-parser.cc b/gcc/algol68/a68-parser.cc
index 1fb97d11c93..1eff76a2571 100644
--- a/gcc/algol68/a68-parser.cc
+++ b/gcc/algol68/a68-parser.cc
@@ -92,7 +92,7 @@
does not check VICTAL correctness of declarers. This is done separately.
The parser sets up symbol tables and populates them as far as needed to parse
- the source. After the bottom-up parser terminates succesfully, the symbol
tables
+ the source. After the bottom-up parser terminates successfully, the symbol
tables
are completed.
(4) Next, modes are collected and rules for well-formedness and structural
diff --git a/gcc/algol68/a68-types.h b/gcc/algol68/a68-types.h
index 9dc3d006e9f..5bf348890f7 100644
--- a/gcc/algol68/a68-types.h
+++ b/gcc/algol68/a68-types.h
@@ -164,13 +164,13 @@ struct GTY((chain_next ("%h.more"), chain_prev
("%h.less"))) KEYWORD_T
/* A MOID_T represents a mode indicator.
NUMBER is an unique number assigned to the moid when it gets created. A
- renumber_moids function exists in a68-parser-modes.cc but it dosn't seem to
+ renumber_moids function exists in a68-parser-modes.cc but it doesn't seem to
be used at all.
ATTRIBUTE characterizes the kind of mode and is one of the values defined in
a68-parser-attrs.def. Valid values are:
- PROC_SYMBOL for procecure modes.
+ PROC_SYMBOL for procedure modes.
ROWS_SYMBOL for row modes.
REF_SYMBOL for reference modes.
FLEX_SYMBOL for flexible reference modes.
@@ -200,7 +200,7 @@ struct GTY((chain_next ("%h.more"), chain_prev
("%h.less"))) KEYWORD_T
The interpretation of DIM depends on the kind of mode:
- In VOID_SYMBOL, STANDARD or INDICANT mode, if DIM is positive it
specifies the size of the longsety of the mode. If DIM is negative then
- abs (DIM) is the size of hte shortsety of the mode.
+ abs (DIM) is the size of the shortsety of the mode.
- In ROW modes, DIM is the number of dimensions.
- In STRUCT modes, DIM is the number of fields.
- In UNION modes, DIM is the number of united modes.
@@ -343,7 +343,7 @@ struct GTY(()) OPTIONS_T
value of access DIRIDEN.
DIRWOST (direct working stack) is very much like DIRIDEN, except that the
- value is stored in WOST% rathern than in IDST%. This access is used for the
+ value is stored in WOST% rather than in IDST%. This access is used for the
result of an action when this result does not preexist in memory and hence
has to be constructed in WOST%.
@@ -470,7 +470,7 @@ struct GTY((chain_next ("%h.next"), chain_prev
("%h.previous"))) NODE_T
routine texts. This attribute is set for all the nodes in the syntax tree
by the taxes collector and originally used by ALGOL 68 Genie's monitor.
Even if at the moment this is not used by GCC, this field and the
- correponding machinery is still here in case it is useful in the future.
+ corresponding machinery is still here in case it is useful in the future.
PRIORITY (accessed as PRIO) is used by operator tree nodes and specifies the
priority of the operator denoted by the node. This is set tree wide by the
@@ -768,7 +768,7 @@ struct MODE_CACHE_T
buffer is known to be big enough to hold any substring from the source file.
It is initialized in read_source_file.
- MAX_SCAN_BUF_LENGTH is the useable size of SCAN_BUF. This is used by the
+ MAX_SCAN_BUF_LENGTH is the usable size of SCAN_BUF. This is used by the
scanner to grow SCAN_BUF as it includes other files.
TAG_NUMBER is a global counter used by the parser to assign an unique number
diff --git a/gcc/algol68/ga68-coding-guidelines.texi
b/gcc/algol68/ga68-coding-guidelines.texi
index 3b8276ee4c1..fcf936271ea 100644
--- a/gcc/algol68/ga68-coding-guidelines.texi
+++ b/gcc/algol68/ga68-coding-guidelines.texi
@@ -317,7 +317,7 @@ int i = -10;
@{ Always a space after bold monadic operator @}
int i = ABS (base + offset)
-@{ Spaces in dyadic opeator @}
+@{ Spaces in dyadic operator @}
total := a + b;
index := cnt +:= 1;
total := (a + b);
@@ -362,7 +362,7 @@ mode MyString = [1:10@@]MyChar,
While indexing and trimming a multiple, never put a space between the
indexed tertiary and the SUB symbol.
-Do not put spaces direcly within indexers and trimmers, unless for
+Do not put spaces directly within indexers and trimmers, unless for
indentation purposes. As an exception to this rule, you can put a
single space before the "at" operator @code{@@} if desired.
diff --git a/gcc/algol68/ga68.texi b/gcc/algol68/ga68.texi
index da19ddbb329..639d72038a8 100644
--- a/gcc/algol68/ga68.texi
+++ b/gcc/algol68/ga68.texi
@@ -2084,7 +2084,7 @@ values of these enquiries are also determined by the
architecture and
operating system targeted by the compiler.
@deftypevr Constant @B{int} {int lengths}
-1 plus the number of extra lenghts of integers which are meaningful.
+1 plus the number of extra lengths of integers which are meaningful.
@end deftypevr
@deftypevr Constant @B{int} {int shorths}
@@ -2096,7 +2096,7 @@ The largest integral value.
@end deftypevr
@deftypevr Constant @B{int} {real lengths}
-1 plus the number of extra lenghts of real numbers which are
+1 plus the number of extra lengths of real numbers which are
meaningful.
@end deftypevr
@@ -2692,7 +2692,7 @@ to @code{b}.
@subsection Conversions
@deftypefn Operator {} {@B{ABS}} {= (@B{char} a) @B{int}}
-Monadic operator that yields an unique integer for each permissable
+Monadic operator that yields an unique integer for each permissible
value of @code{@B{char}}.
@end deftypefn
diff --git a/libga68/ga68-error.c b/libga68/ga68-error.c
index c826317bade..1bb0530ffdc 100644
--- a/libga68/ga68-error.c
+++ b/libga68/ga68-error.c
@@ -28,7 +28,7 @@
/* Run-time error handling.
- Please use the following format when outputing runtime error messages:
+ Please use the following format when outputting runtime error messages:
FILE:LINE:[COLUMN:] TEXT
diff --git a/libga68/ga68-unistr.c b/libga68/ga68-unistr.c
index e37bd8c852d..ee24120271b 100644
--- a/libga68/ga68-unistr.c
+++ b/libga68/ga68-unistr.c
@@ -54,7 +54,7 @@
# define MIN(a,b) ((a) < (b) ? (a) : (b))
#endif
-/* Compare two UCS-4 strings of same lenght, lexicographically.
+/* Compare two UCS-4 strings of same length, lexicographically.
Return -1, 0 or 1. */
static int
@@ -83,7 +83,7 @@ _libga68_u32_cmp (const uint32_t *s1, size_t stride1,
return 0;
}
-/* Compare two UCS-4 strings of perhaps different lenghts, lexicographically.
+/* Compare two UCS-4 strings of perhaps different lengths, lexicographically.
Return -1, 0 or 1. */
int
@@ -307,7 +307,7 @@ _libga68_u8_uctomb (uint8_t *s, uint32_t uc, ptrdiff_t n)
/* Convert S of size N with stride STRIDE UCS-4 to UTF-8.
Returns a pointer to the converted string with a traiiling '\0'.
- The string length, not counting the trailling '\0', is returned on LENGTHP.
+ The string length, not counting the trailing '\0', is returned on LENGTHP.
Returns NULL on error.
Callers *must* call _libga68_free_internal on a non-null result. */
@@ -380,7 +380,7 @@ _libga68_u32_to_u8 (const uint32_t *s, size_t n, size_t
stride, size_t *lengthp)
{
if (length + 1 != allocated)
{
- /* Resize the allocated memory to fit the string plus the trailling
NULL. */
+ /* Resize the allocated memory to fit the string plus the trailing
NULL. */
uint8_t *memory;
memory =
--
2.43.0
