From dc9a511d8e070a7767dd2d8078dbf4e7ed65edee Mon Sep 17 00:00:00 2001 From: Tom Browder Date: Thu, 31 Jan 2008 23:59:46 +0000 Subject: c-tree.texi (Types): Fix grammar. * 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. From-SVN: r131987 --- gcc/doc/c-tree.texi | 4 ++-- gcc/doc/configterms.texi | 2 +- gcc/doc/cpp.texi | 2 +- gcc/doc/makefile.texi | 2 +- gcc/doc/md.texi | 2 +- gcc/doc/passes.texi | 4 ++-- 6 files changed, 8 insertions(+), 8 deletions(-) (limited to 'gcc/doc') diff --git a/gcc/doc/c-tree.texi b/gcc/doc/c-tree.texi index a53329a..8ca96ed 100644 --- a/gcc/doc/c-tree.texi +++ b/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: diff --git a/gcc/doc/configterms.texi b/gcc/doc/configterms.texi index f97de5b..703fbdb 100644 --- a/gcc/doc/configterms.texi +++ b/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}). diff --git a/gcc/doc/cpp.texi b/gcc/doc/cpp.texi index 464965c..740dd3b 100644 --- a/gcc/doc/cpp.texi +++ b/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__ diff --git a/gcc/doc/makefile.texi b/gcc/doc/makefile.texi index f4513b7..2afbeec 100644 --- a/gcc/doc/makefile.texi +++ b/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 diff --git a/gcc/doc/md.texi b/gcc/doc/md.texi index fba9f94..540efd4 100644 --- a/gcc/doc/md.texi +++ b/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. diff --git a/gcc/doc/passes.texi b/gcc/doc/passes.texi index 2f35439..b9a6de8 100644 --- a/gcc/doc/passes.texi +++ b/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}. -- cgit v1.1