Commit 71df4441 by Kazu Hirata Committed by Kazu Hirata

treelang.texi: Fix typos.

	* treelang/treelang.texi: Fix typos.
	* treelang/treetree.c: Fix comment typos.

From-SVN: r97393
parent cccd217d
2005-04-01 Kazu Hirata <kazu@cs.umass.edu>
* treelang/treelang.texi: Fix typos.
* treelang/treetree.c: Fix comment typos.
2005-03-23 Joseph S. Myers <joseph@codesourcery.com> 2005-03-23 Joseph S. Myers <joseph@codesourcery.com>
* treetree.c (LANG_HOOKS_TRUTHVALUE_CONVERSION, * treetree.c (LANG_HOOKS_TRUTHVALUE_CONVERSION,
......
...@@ -294,7 +294,7 @@ and @samp{GNU Compiler Collection (GCC) Internals}. ...@@ -294,7 +294,7 @@ and @samp{GNU Compiler Collection (GCC) Internals}.
To install treelang, follow the GCC installation instructions, To install treelang, follow the GCC installation instructions,
taking care to ensure you specify treelang in the configure step by adding taking care to ensure you specify treelang in the configure step by adding
treelang to the list of languages specified by @option{--enable-langauges}, treelang to the list of languages specified by @option{--enable-languages},
e.g.@: @samp{--enable-languages=all,treelang}. e.g.@: @samp{--enable-languages=all,treelang}.
If you're generally curious about the future of If you're generally curious about the future of
...@@ -619,7 +619,7 @@ OR variable = expression OR function_call ...@@ -619,7 +619,7 @@ OR variable = expression OR function_call
An expression can be a constant or a variable reference or a An expression can be a constant or a variable reference or a
function_call. Expressions can be combined as a sum of two expressions function_call. Expressions can be combined as a sum of two expressions
or the difference of two expressions, or an equality test of two or the difference of two expressions, or an equality test of two
expresions. An assignment is also an expression. Expresions and operator expressions. An assignment is also an expression. Expressions and operator
precedence work as in C. precedence work as in C.
@item @item
...@@ -947,7 +947,7 @@ The files are: ...@@ -947,7 +947,7 @@ The files are:
@item @item
COPYING. This is the copyright file, assuming you are going to use the COPYING. This is the copyright file, assuming you are going to use the
GNU General Public Licence. You probably need to use the GPL because if GNU General Public License. You probably need to use the GPL because if
you use the GCC back end your program and the back end are one program, you use the GCC back end your program and the back end are one program,
and the back end is GPLed. and the back end is GPLed.
...@@ -957,7 +957,7 @@ GCC tree, as the main GCC directory has this file. ...@@ -957,7 +957,7 @@ GCC tree, as the main GCC directory has this file.
@item @item
COPYING.LIB. This is the copyright file for those parts of your program COPYING.LIB. This is the copyright file for those parts of your program
that are not to be covered by the GPL, but are instead to be covered by that are not to be covered by the GPL, but are instead to be covered by
the LGPL (Library or Lesser GPL). This licence may be appropriate for the LGPL (Library or Lesser GPL). This license may be appropriate for
the library routines associated with your compiler. These are the the library routines associated with your compiler. These are the
routines that are linked with the @emph{output} of the compiler. Using routines that are linked with the @emph{output} of the compiler. Using
the LGPL for these programs allows programs written using your compiler the LGPL for these programs allows programs written using your compiler
...@@ -1006,7 +1006,7 @@ directory. ...@@ -1006,7 +1006,7 @@ directory.
@item @item
config-lang.in. This file is read by the configuration progress and must config-lang.in. This file is read by the configuration progress and must
be present. You specify the name of your language, the name(s) of the be present. You specify the name of your language, the name(s) of the
compiler(s) incouding preprocessors you are going to build, whether any, compiler(s) including preprocessors you are going to build, whether any,
usually generated, files should be excluded from diffs (ie when making usually generated, files should be excluded from diffs (ie when making
diff files to send in patches). Whether the equate 'stagestuff' is used diff files to send in patches). Whether the equate 'stagestuff' is used
is unknown (???). is unknown (???).
...@@ -1167,7 +1167,7 @@ to mark it. ...@@ -1167,7 +1167,7 @@ to mark it.
Note that you can also call ggc_mark_tree to mark any of the back end Note that you can also call ggc_mark_tree to mark any of the back end
internal 'tree' nodes. This routine will follow the branches of the internal 'tree' nodes. This routine will follow the branches of the
trees and mark all the subordinate structures. This is useful for trees and mark all the subordinate structures. This is useful for
example when you have created a variable declaaration that will be used example when you have created a variable declaration that will be used
across multiple functions, or for a function declaration (from a across multiple functions, or for a function declaration (from a
prototype) that may be used later on. See the next item for more on the prototype) that may be used later on. See the next item for more on the
tree nodes. tree nodes.
......
...@@ -642,7 +642,7 @@ tree_code_get_integer_value (unsigned char* chars, unsigned int length) ...@@ -642,7 +642,7 @@ tree_code_get_integer_value (unsigned char* chars, unsigned int length)
val & 0xffffffff, (val >> 32) & 0xffffffff); val & 0xffffffff, (val >> 32) & 0xffffffff);
} }
/* Return the tree for an expresssion, type EXP_TYPE (see treetree.h) /* Return the tree for an expression, type EXP_TYPE (see treetree.h)
with tree type TYPE and with operands1 OP1, OP2 (maybe), OP3 (maybe). */ with tree type TYPE and with operands1 OP1, OP2 (maybe), OP3 (maybe). */
tree tree
tree_code_get_expression (unsigned int exp_type, tree_code_get_expression (unsigned int exp_type,
...@@ -1004,7 +1004,7 @@ pushlevel (int ignore ATTRIBUTE_UNUSED) ...@@ -1004,7 +1004,7 @@ pushlevel (int ignore ATTRIBUTE_UNUSED)
static tree static tree
poplevel (int keep, int reverse, int functionbody) poplevel (int keep, int reverse, int functionbody)
{ {
/* Points to a BLOCK tree node. This is the BLOCK node construted for the /* Points to a BLOCK tree node. This is the BLOCK node constructed for the
binding level that we are about to exit and which is returned by this binding level that we are about to exit and which is returned by this
routine. */ routine. */
tree block_node = NULL_TREE; tree block_node = NULL_TREE;
...@@ -1014,7 +1014,7 @@ poplevel (int keep, int reverse, int functionbody) ...@@ -1014,7 +1014,7 @@ poplevel (int keep, int reverse, int functionbody)
/* Reverse the list of *_DECL nodes if desired. Note that the ..._DECL /* Reverse the list of *_DECL nodes if desired. Note that the ..._DECL
nodes chained through the `names' field of current_binding_level are in nodes chained through the `names' field of current_binding_level are in
reverse order except for PARM_DECL node, which are explicitely stored in reverse order except for PARM_DECL node, which are explicitly stored in
the right order. */ the right order. */
decl_chain = (reverse) ? nreverse (current_binding_level->names) decl_chain = (reverse) ? nreverse (current_binding_level->names)
: current_binding_level->names; : current_binding_level->names;
...@@ -1103,7 +1103,7 @@ pushdecl (tree decl) ...@@ -1103,7 +1103,7 @@ pushdecl (tree decl)
TREE_CHAIN (decl) = current_binding_level->names; TREE_CHAIN (decl) = current_binding_level->names;
current_binding_level->names = decl; current_binding_level->names = decl;
/* For the declartion of a type, set its name if it is not already set. */ /* For the declaration of a type, set its name if it is not already set. */
if (TREE_CODE (decl) == TYPE_DECL if (TREE_CODE (decl) == TYPE_DECL
&& TYPE_NAME (TREE_TYPE (decl)) == 0) && TYPE_NAME (TREE_TYPE (decl)) == 0)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment