diff options
author | Joseph Myers <jsm28@cam.ac.uk> | 2001-06-14 23:51:18 +0100 |
---|---|---|
committer | Joseph Myers <jsm28@gcc.gnu.org> | 2001-06-14 23:51:18 +0100 |
commit | c771326b4f3a5451a0f04bc75c7eaaf67dc8e2d2 (patch) | |
tree | 772b2cba97c73b14b62229c62b3429bd6ff1e4c1 /gcc/doc/c-tree.texi | |
parent | 68f4edf0790977a1842dbd2acf8de7febf7aa94a (diff) | |
download | gcc-c771326b4f3a5451a0f04bc75c7eaaf67dc8e2d2.zip gcc-c771326b4f3a5451a0f04bc75c7eaaf67dc8e2d2.tar.gz gcc-c771326b4f3a5451a0f04bc75c7eaaf67dc8e2d2.tar.bz2 |
c-tree.texi, [...]: Fix spelling and typos.
* doc/c-tree.texi, doc/contrib.texi, doc/extend.texi,
doc/gcc.texi, doc/install.texi, doc/invoke.texi, doc/md.texi,
doc/objc.texi, doc/rtl.texi, doc/tm.texi: Fix spelling and typos.
Consistently use "built-in" and "bit-field". Minor logical markup
improvements.
* doc/gcc.1: Regenerate.
From-SVN: r43383
Diffstat (limited to 'gcc/doc/c-tree.texi')
-rw-r--r-- | gcc/doc/c-tree.texi | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/gcc/doc/c-tree.texi b/gcc/doc/c-tree.texi index 9c40046..635bccd 100644 --- a/gcc/doc/c-tree.texi +++ b/gcc/doc/c-tree.texi @@ -372,7 +372,7 @@ the type. (Note this macro does @emph{not} return a @code{IDENTIFIER_NODE}, as you might expect, given its name!) You can look at the @code{DECL_NAME} of the @code{TYPE_DECL} to obtain the actual name of the type. The @code{TYPE_NAME} will be @code{NULL_TREE} -for a type that is not a builtin type, the result of a typedef, or a +for a type that is not a built-in type, the result of a typedef, or a named class type. @item CP_INTEGRAL_TYPE @@ -387,7 +387,7 @@ or a floating point type. This predicate holds for a class-type. @item TYPE_BUILT_IN -This predicate holds for a builtin type. +This predicate holds for a built-in type. @item TYPE_PTRMEM_P This predicate holds if the type is a pointer to data member. @@ -450,7 +450,7 @@ double} types. The number of bits in the floating-point representation is given by @code{TYPE_PRECISION}, as in the @code{INTEGER_TYPE} case. @item COMPLEX_TYPE -Used to represent GCC builtin @code{__complex__} data types. The +Used to represent GCC built-in @code{__complex__} data types. The @code{TREE_TYPE} is the type of the real and imaginary parts. @item ENUMERAL_TYPE @@ -967,7 +967,7 @@ These nodes represent non-static data members. The @code{DECL_SIZE} and @code{INTEGER_CST}. These values are indexed from zero, where zero indicates the first bit in the object. -If @code{DECL_C_BIT_FIELD} holds, this field is a bitfield. +If @code{DECL_C_BIT_FIELD} holds, this field is a bit-field. @item NAMESPACE_DECL @xref{Namespaces}. @@ -976,7 +976,7 @@ If @code{DECL_C_BIT_FIELD} holds, this field is a bitfield. These nodes are used to represent class, function, and variable (static data member) templates. The @code{DECL_TEMPLATE_SPECIALIZATIONS} are a -@code{TREE_LIST}. The @code{TREE_VALUE} of each node in the lst is a +@code{TREE_LIST}. The @code{TREE_VALUE} of each node in the list is a @code{TEMPLATE_DECL}s or @code{FUNCTION_DECL}s representing specializations (including instantiations) of this template. Back-ends can safely ignore @code{TEMPLATE_DECL}s, but should examine @@ -1547,7 +1547,7 @@ Used to represent an @code{if} statement. The @code{IF_COND} is the expression. If the condition is a @code{TREE_LIST}, then the @code{TREE_PURPOSE} is -a statement (usually a @code{DECL_STMT}). Each time the coondition is +a statement (usually a @code{DECL_STMT}). Each time the condition is evaluated, the statement should be executed. Then, the @code{TREE_VALUE} should be used as the conditional expression itself. This representation is used to handle C++ code like this: @@ -2047,7 +2047,7 @@ will be a @code{VAR_DECL}, @code{INDIRECT_REF}, @code{COMPONENT_REF}, or other lvalue. These nodes are used to represent not only assignment with @samp{=} but -also compount assignments (like @samp{+=}), by reduction to @samp{=} +also compound assignments (like @samp{+=}), by reduction to @samp{=} assignment. In other words, the representation for @samp{i += 3} looks just like that for @samp{i = i + 3}. |