1 files changed, 9 insertions, 9 deletions

diff --git a/lisp/cedet/srecode/dictionary.el b/lisp/cedet/srecode/dictionary.el
index 1058024d457..a0205177caa 100644
--- a/lisp/cedet/srecode/dictionary.el
+++ b/lisp/cedet/srecode/dictionary.el
@@ -147,7 +147,7 @@ Makes sure that :value is compiled."
 ;;
 
 (defun srecode-create-dictionary (&optional buffer-or-parent)
-  "Create a dictionary for BUFFER.
+  "Create a dictionary for BUFFER-OR-PARENT.
 If BUFFER-OR-PARENT is not specified, assume a buffer, and
 use the current buffer.
 If BUFFER-OR-PARENT is another dictionary, then remember the
@@ -326,8 +326,8 @@ inserted dictionaries."
 					   entries &optional state)
   "Add ENTRIES to DICT.
 
-ENTRIES is a list of even length of dictionary entries to
-add. ENTRIES looks like this:
+ENTRIES is a list of even length of dictionary entries to add.
+ENTRIES looks like this:
 
   (NAME_1 VALUE_1 NAME_2 VALUE_2 ...)
 
@@ -340,7 +340,7 @@ and for values
  * Otherwise, a compound variable is created for VALUE_N.
 
 The optional argument STATE has to non-nil when compound values
-are inserted. An error is signaled if ENTRIES contains compound
+are inserted.  An error is signaled if ENTRIES contains compound
 values but STATE is nil."
   (while entries
     (let ((name  (nth 0 entries))
@@ -409,8 +409,8 @@ OTHERDICT."
 					   name &optional non-recursive)
   "Return information about DICT's value for NAME.
 DICT is a dictionary, and NAME is a string that is treated as the
-name of an entry in the dictionary. If such an entry exists, its
-value is returned. Otherwise, nil is returned. Normally, the
+name of an entry in the dictionary.  If such an entry exists, its
+value is returned.  Otherwise, nil is returned. Normally, the
 lookup is recursive in the sense that the parent of DICT is
 searched for NAME if it is not found in DICT.  This recursive
 lookup can be disabled by the optional argument NON-RECURSIVE.
@@ -552,7 +552,7 @@ inserted with a new editable field.")
   "Create a dictionary with entries according to TAGS.
 
 TAGS should be in the format produced by the template file
-grammar. That is
+grammar.  That is
 
 TAGS = (ENTRY_1 ENTRY_2 ...)
 
@@ -560,9 +560,9 @@ where
 
 ENTRY_N = (NAME ENTRY_N_1 ENTRY_N_2 ...) | TAG
 
-where TAG is a semantic tag of class 'variable. The (NAME ... )
+where TAG is a semantic tag of class 'variable.  The (NAME ... )
 form creates a child dictionary which is stored under the name
-NAME. The TAG form creates a value entry or section dictionary
+NAME.  The TAG form creates a value entry or section dictionary
 entry whose name is the name of the tag.
 
 STATE is the current compiler state."