[Python-checkins] CVS: python/dist/src/Doc/lib libparser.tex,1.31,1.31.2.1

[Fred L. Drake]

Update of /projects/cvsroot/python/dist/src/Doc/lib
In directory weyr:/home/fdrake/projects/python/Doc-152p2/lib

Modified Files:
      Tag: release152p1-patches
	libparser.tex 
Log Message:

"equivelent" --> "equivalent" several places

The AST objects *do* have methods; remove the old assertion that they
don't.

Errors noticed by Jim Kerr <jim_kerr@agilent.com>.


Index: libparser.tex
===================================================================
RCS file: /projects/cvsroot/python/dist/src/Doc/lib/libparser.tex,v
retrieving revision 1.31
retrieving revision 1.31.2.1
diff -C2 -r1.31 -r1.31.2.1
*** libparser.tex	1999/08/02 14:30:52	1.31
--- libparser.tex	2000/03/16 19:46:52	1.31.2.1
***************
*** 167,171 ****
  This function accepts an AST object from the caller in
  \var{ast} and returns a Python list representing the
! equivelent parse tree.  The resulting list representation can be used
  for inspection or the creation of a new parse tree in list form.  This
  function does not fail so long as memory is available to build the
--- 167,171 ----
  This function accepts an AST object from the caller in
  \var{ast} and returns a Python list representing the
! equivalent parse tree.  The resulting list representation can be used
  for inspection or the creation of a new parse tree in list form.  This
  function does not fail so long as memory is available to build the
***************
*** 186,190 ****
  This function accepts an AST object from the caller in
  \var{ast} and returns a Python tuple representing the
! equivelent parse tree.  Other than returning a tuple instead of a
  list, this function is identical to \function{ast2list()}.
  
--- 186,190 ----
  This function accepts an AST object from the caller in
  \var{ast} and returns a Python tuple representing the
! equivalent parse tree.  Other than returning a tuple instead of a
  list, this function is identical to \function{ast2list()}.
  
***************
*** 239,243 ****
  This function mirrors \function{isexpr()} in that it reports whether an
  AST object represents an \code{'exec'} form, commonly known as a
! ``suite.''  It is not safe to assume that this function is equivelent
  to \samp{not isexpr(\var{ast})}, as additional syntactic fragments may
  be supported in the future.
--- 239,243 ----
  This function mirrors \function{isexpr()} in that it reports whether an
  AST object represents an \code{'exec'} form, commonly known as a
! ``suite.''  It is not safe to assume that this function is equivalent
  to \samp{not isexpr(\var{ast})}, as additional syntactic fragments may
  be supported in the future.
***************
*** 275,281 ****
  \subsection{AST Objects \label{AST Objects}}
  
- AST objects returned by \function{expr()}, \function{suite()} and
- \function{sequence2ast()} have no methods of their own.
- 
  Ordered and equality comparisons are supported between AST objects.
  Pickling of AST objects (using the \refmodule{pickle} module) is also
--- 275,278 ----
***************
*** 327,331 ****
  bytecode generation, the simplest operation is to do nothing.  For
  this purpose, using the \module{parser} module to produce an
! intermediate data structure is equivelent to the code
  
  \begin{verbatim}
--- 324,328 ----
  bytecode generation, the simplest operation is to do nothing.  For
  this purpose, using the \module{parser} module to produce an
! intermediate data structure is equivalent to the code
  
  \begin{verbatim}
***************
*** 336,340 ****
  \end{verbatim}
  
! The equivelent operation using the \module{parser} module is somewhat
  longer, and allows the intermediate internal parse tree to be retained
  as an AST object:
--- 333,337 ----
  \end{verbatim}
  
! The equivalent operation using the \module{parser} module is somewhat
  longer, and allows the intermediate internal parse tree to be retained
  as an AST object:
***************
*** 475,479 ****
  By replacing the actual docstring with something to signify a variable
  component of the tree, we allow a simple pattern matching approach to
! check any given subtree for equivelence to the general pattern for
  docstrings.  Since the example demonstrates information extraction, we
  can safely require that the tree be in tuple form rather than list
--- 472,476 ----
  By replacing the actual docstring with something to signify a variable
  component of the tree, we allow a simple pattern matching approach to
! check any given subtree for equivalence to the general pattern for
  docstrings.  Since the example demonstrates information extraction, we
  can safely require that the tree be in tuple form rather than list