* emacs-lisp/smie.el (comment-string-strip): Declare function.

  (smie-precs-precedence-table): Fix typo in docstring.

diff --git a/lisp/ChangeLog b/lisp/ChangeLog
index 16791f1..29937de 100644 (file)
--- a/lisp/ChangeLog
+++ b/lisp/ChangeLog
@@ -1,5 +1,8 @@
 2010-06-09  Juanma Barranquero  <lekktu@gmail.com>
 
+       * emacs-lisp/smie.el (comment-string-strip): Declare function.
+       (smie-precs-precedence-table): Fix typo in docstring.
+
        * vc-mtn.el (log-edit-extract-headers): Declare function.
 
        * vc-hg.el (log-edit-extract-headers): Remove duplicate declaration.

diff --git a/lisp/emacs-lisp/smie.el b/lisp/emacs-lisp/smie.el
index 687a43d..fb1e473 100644 (file)
--- a/lisp/emacs-lisp/smie.el
+++ b/lisp/emacs-lisp/smie.el
@@ -68,6 +68,7 @@
 (eval-when-compile (require 'cl))
 
 (defvar comment-continue)
+(declare-function comment-string-strip "newcomment" (str beforep afterp))
 
 ;;; Building precedence level tables from BNF specs.
 
@@ -89,7 +90,7 @@
   "Compute a 2D precedence table from a list of precedences.
 PRECS should be a list, sorted by precedence (e.g. \"+\" will
 come before \"*\"), of elements of the form \(left OP ...)
-or (right OP ...) or (nonassoc OP ...)  or (assoc OP ...).  All operators in
+or (right OP ...) or (nonassoc OP ...) or (assoc OP ...).  All operators in
 one of those elements share the same precedence level and associativity."
   (let ((prec2-table (make-hash-table :test 'equal)))
     (dolist (prec precs)