* doc/c-tree.texi (Types): Fix grammar.

	(Expression trees): Ditto.
	* doc/passes.texi (Tree-SSA passes): Ditto.

	* doc/configterms.texi (Configure Terms): Fix typo.
	* doc/cpp.texi (Common Predefined Macros): Ditto.
	* doc/md.texi (Machine Constraints): Ditto.

	* doc/makefile.texi (Makefile): Add comma.


git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@131987 138bc75d-0d04-0410-961f-82ee72b054a4

gcc/ChangeLog

+2008-01-31  Tom Browder <tom.browder@gmail.com>
+
+	* doc/c-tree.texi (Types): Fix grammar.
+	(Expression trees): Ditto.
+	* doc/passes.texi (Tree-SSA passes): Ditto.
+	
+	* doc/configterms.texi (Configure Terms): Fix typo.
+	* doc/cpp.texi (Common Predefined Macros): Ditto.
+	* doc/md.texi (Machine Constraints): Ditto.
+	
+	* doc/makefile.texi (Makefile): Add comma.
+
 2008-01-31  Tom Browder  <tom.browder@gmail.com>
 	    Gerald Pfeifer  <gerald@pfeifer.com>
 	

gcc/doc/c-tree.texi

@@ -312,7 +312,7 @@ The elements are indexed from zero.
 
 All types have corresponding tree nodes.  However, you should not assume
 that there is exactly one tree node corresponding to each type.  There
-are often several nodes each of which correspond to the same type.
+are often multiple nodes corresponding to the same type.
 
 For the most part, different kinds of types have different tree codes.
 (For example, pointer types use a @code{POINTER_TYPE} code while arrays
@@ -2017,7 +2017,7 @@ mind.  In particular, the expression ``tree'' is actually a directed
 acyclic graph.  (For example there may be many references to the integer
 constant zero throughout the source program; many of these will be
 represented by the same expression node.)  You should not rely on
-certain kinds of node being shared, nor should rely on certain kinds of
+certain kinds of node being shared, nor should you rely on certain kinds of
 nodes being unshared.
 
 The following macros can be used with all expression nodes:

gcc/doc/configterms.texi

@@ -39,7 +39,7 @@ There is a proposal to call this a @dfn{crossback}.
 
 If build and host are the same, the GCC you are building will also be
 used to build the target libraries (like @code{libstdc++}).  If build and host
-are different, you must have already build and installed a cross
+are different, you must have already built and installed a cross
 compiler that will be used to build the target libraries (if you
 configured with @option{--target=foo-bar}, this compiler will be called
 @command{foo-bar-gcc}).

gcc/doc/cpp.texi

@@ -1996,7 +1996,7 @@ on the command line of the preprocessor or C compiler.
 This macro expands to a decimal integer constant that represents the
 depth of nesting in include files.  The value of this macro is
 incremented on every @samp{#include} directive and decremented at the
-end of every included file.  It starts out at 0, it's value within the
+end of every included file.  It starts out at 0, its value within the
 base file specified on the command line.
 
 @item __ELF__

gcc/doc/makefile.texi

@@ -100,7 +100,7 @@ rebuilt, and copied to its subdirectory.  This will allow you to, for
 example, continue a bootstrap after fixing a bug which causes the
 stage2 build to crash.  It does not provide as good coverage of the
 compiler as bootstrapping from scratch, but it ensures that the new
-code is syntactically correct (e.g. that you did not use GCC extensions
+code is syntactically correct (e.g., that you did not use GCC extensions
 by mistake), and avoids spurious bootstrap comparison
 failures@footnote{Except if the compiler was buggy and miscompiled
   some of the files that were not modified.  In this case, it's best

gcc/doc/md.texi

@@ -2895,7 +2895,7 @@ Multiple letter constraint followed by 4 parameter letters.
          value of the other parts (F---all bits set)
 @end table
 The constraint matches if the specified part of a constant
-has a value different from it's other parts.
+has a value different from its other parts.
 
 @item Q
 Memory reference without index register and with short displacement.

gcc/doc/passes.texi

@@ -366,7 +366,7 @@ This pass transforms tail recursion into a loop.  It is located in
 
 @item Forward store motion
 
-This pass sinks stores and assignments down the flowgraph closer to it's
+This pass sinks stores and assignments down the flowgraph closer to their
 use point.  The pass is located in @file{tree-ssa-sink.c} and is
 described by @code{pass_sink_code}.
 
@@ -384,7 +384,7 @@ in @file{tree-ssa-math-opts.c} and is described by
 
 @item Full redundancy elimination
 
-This is a simpler form of PRE that only eliminate redundancies that
+This is a simpler form of PRE that only eliminates redundancies that
 occur an all paths.  It is located in @file{tree-ssa-pre.c} and
 described by @code{pass_fre}.