* app.c: Fix comment typos.

	* bit_fix.h: Likewise.
	* expr.c: Likewise.
	* itbl-ops.c: Likewise.

diff --git a/gas/ChangeLog b/gas/ChangeLog
index 28540c0074d22612775919c60d7298844d4b7252..a71f972cd78485efa0e5b7f50afe91b4ca7c2212 100644 (file)
--- a/gas/ChangeLog
+++ b/gas/ChangeLog
@@ -1,3 +1,10 @@
+2001-10-11  Kazu Hirata  <kazu@hxi.com>
+
+       * app.c: Fix comment typos.
+       * bit_fix.h: Likewise.
+       * expr.c: Likewise.
+       * itbl-ops.c: Likewise.
+
 2001-10-11  Nick Clifton  <nickc@cambridge.redhat.com>
 
        * input-file.c: Include safe-ctype.h.

diff --git a/gas/app.c b/gas/app.c
index c172602e488658e67a2d4459b4fd365a4a9fa019..ba587d4651bb4601828652d5e5eebdb7485e569a 100644 (file)
--- a/gas/app.c
+++ b/gas/app.c
@@ -387,7 +387,7 @@ do_scrub_chars (get, tostart, tolen)
   /* I added states 9 and 10 because the MIPS ECOFF assembler uses
      constructs like ``.loc 1 20''.  This was turning into ``.loc
      120''.  States 9 and 10 ensure that a space is never dropped in
-     between characters which could appear in a identifier.  Ian
+     between characters which could appear in an identifier.  Ian
      Taylor, ian@cygnus.com.
 
      I added state 11 so that something like "Lfoo add %r25,%r26,%r27" works

diff --git a/gas/bit_fix.h b/gas/bit_fix.h
index 3eedb3ca464500a6be1de552dc4b98fe05e8a585..5f69fcff7a737946dc43014f7e9acb348f0ead10 100644 (file)
--- a/gas/bit_fix.h
+++ b/gas/bit_fix.h
@@ -1,5 +1,5 @@
 /* bit_fix.h
-   Copyright 1987, 1992, 2000 Free Software Foundation, Inc.
+   Copyright 1987, 1992, 2000, 2001 Free Software Foundation, Inc.
 
    This file is part of GAS, the GNU Assembler.
 
@@ -27,7 +27,7 @@
    ns32k port.
    The acbi, addqi, movqi, cmpqi instruction requires an assembler that
    can handle bitfields. Ie handle an expression, evaluate it and insert
-   the result in an some bitfield. ( ex: 5 bits in a short field of a opcode)
+   the result in an some bitfield. ( ex: 5 bits in a short field of an opcode)
    */
 
 #ifndef __bit_fix_h__

diff --git a/gas/expr.c b/gas/expr.c
index 499f9a33fb438a31ea8a2f72f8749c6206b720dd..74c49d9c7bf721aec4ea2ba9f690f9b38eb3196d 100644 (file)
--- a/gas/expr.c
+++ b/gas/expr.c
@@ -759,7 +759,7 @@ current_location (expressionp)
 /* In: Input_line_pointer points to 1st char of operand, which may
        be a space.
 
-   Out:        A expressionS.
+   Out:        An expressionS.
        The operand may have been empty: in this case X_op == O_absent.
        Input_line_pointer->(next non-blank) char after operand.  */
 
@@ -1342,7 +1342,7 @@ operand (expressionP)
 \f
 /* Internal.  Simplify a struct expression for use by expr ().  */
 
-/* In: address of a expressionS.
+/* In: address of an expressionS.
        The X_op field of the expressionS may only take certain values.
        Elsewise we waste time special-case testing. Sigh. Ditto SEG_ABSENT.
 
@@ -1399,7 +1399,7 @@ clean_up_expression (expressionP)
    Unary operators and parenthetical expressions are treated as operands.
    As usual, Q==quantity==operand, O==operator, X==expression mnemonics.
 
-   We used to do a aho/ullman shift-reduce parser, but the logic got so
+   We used to do an aho/ullman shift-reduce parser, but the logic got so
    warped that I flushed it and wrote a recursive-descent parser instead.
    Now things are stable, would anybody like to write a fast parser?
    Most expressions are either register (which does not even reach here)

diff --git a/gas/itbl-ops.c b/gas/itbl-ops.c
index 729ee9837421cc6c7f11d56913c5ef456c73889b..d67a9869e5b20564ff24262a141027cdb17db8bf 100644 (file)
--- a/gas/itbl-ops.c
+++ b/gas/itbl-ops.c
@@ -507,7 +507,7 @@ itbl_assemble (char *name, char *s)
   int processor;
 
   if (!name || !*name)
-    return 0;                  /* error!  must have a opcode name/expr */
+    return 0;                  /* error!  must have an opcode name/expr */
 
   /* find entry in list of instructions for all processors */
   for (processor = 0; processor < e_nprocs; processor++)