* doc/lispref/keymaps.texi (Key Binding Commands): Trivial rephrasing.

[bpt/emacs.git] / doc / lispref / compile.texi

diff --git a/doc/lispref/compile.texi b/doc/lispref/compile.texi
index c1e0706..d60ffeb 100644 (file)
--- a/doc/lispref/compile.texi
+++ b/doc/lispref/compile.texi
@@ -1,8 +1,8 @@
 @c -*-texinfo-*-
 @c This is part of the GNU Emacs Lisp Reference Manual.
-@c Copyright (C) 1990-1994, 2001-2012 Free Software Foundation, Inc.
+@c Copyright (C) 1990-1994, 2001-2013 Free Software Foundation, Inc.
 @c See the file elisp.texi for copying conditions.
-@node Byte Compilation, Advising Functions, Loading, Top
+@node Byte Compilation
 @chapter Byte Compilation
 @cindex byte compilation
 @cindex byte-code
@@ -80,7 +80,6 @@ whereas the byte-compiled code required less than 4 seconds.  These
 results are representative, but actual results may vary.
 
 @node Compilation Functions
-@comment  node-name,  next,  previous,  up
 @section Byte-Compilation Functions
 @cindex compilation functions
 
@@ -290,10 +289,10 @@ is by adding this string to the file's first line:
 -*-byte-compile-dynamic-docstrings: nil;-*-
 @end example
 
-@defvar byte-compile-dynamic-docstrings
+@defopt byte-compile-dynamic-docstrings
 If this is non-@code{nil}, the byte compiler generates compiled files
 that are set up for dynamic loading of documentation strings.
-@end defvar
+@end defopt
 
 @node Dynamic Loading
 @section Dynamic Loading of Individual Functions
@@ -658,7 +657,7 @@ Lisp source; these do not appear in the output of @code{disassemble}.
 11  sub1                  ; @r{Pop @code{integer}, decrement value,}
                           ;   @r{push new value onto stack.}
 12  call     1            ; @r{Call function @code{factorial} using first}
-                          ;   @r{(i.e. top) stack element as argument;}
+                          ;   @r{(i.e., top) stack element as argument;}
                           ;   @r{push returned value onto stack.}
 @end group
 @group
@@ -705,7 +704,7 @@ The @code{silly-loop} function is somewhat more complex:
 4   sub1                  ; @r{Subtract 1 from top of stack.}
 @end group
 @group
-5   dup                   ; @r{Duplicate top of stack; i.e. copy the top}
+5   dup                   ; @r{Duplicate top of stack; i.e., copy the top}
                           ;   @r{of the stack and push copy onto stack.}
 6   varset   n            ; @r{Pop the top of the stack,}
                           ;   @r{and bind @code{n} to the value.}
@@ -738,4 +737,3 @@ The @code{silly-loop} function is somewhat more complex:
 17  return                ; @r{Return value of the top of stack.}
 @end group
 @end example
-