# Fixed some compilation warnings.

Pascal J. Bourguignon [2011-01-01 01:41]
```Fixed some compilation warnings.
```
Filename
index.html
p35.lisp
p36.lisp
rdp.lisp
```diff --git a/index.html b/index.html
index 6eb4727..808506c 100644
--- a/index.html
+++ b/index.html
@@ -124,14 +124,10 @@ L-99: Nintey-Nine Lisp Problems</a>, (which themselves are derived from a list o
</html>

<!--
+grep -n 'TO BE DONE' *.lisp
+p38.lisp:11:;; TO BE DONE.

-P58 (**) Generate-and-test paradigm
-    Apply the generate-and-test paradigm to construct all symmetric, completely balanced binary trees with a given number of nodes. Example:
-    * sym-cbal-trees(5,Ts).
-    Ts = [t(x, t(x, nil, t(x, nil, nil)), t(x, t(x, nil, nil), nil)), t(x, t(x, t(x, nil, nil), nil), t(x, nil, t(x, nil, nil)))]
-
-    How many such trees are there with 57 nodes? Investigate about how many solutions there are for a given number of nodes? What if the number is even? Write an appropriate predicate.

P59 (**) Construct height-balanced binary trees
In a height-balanced binary tree, the following property holds for every node: The height of its left subtree and the height of its right subtree are almost equal, which means their difference is not greater than one.
diff --git a/p35.lisp b/p35.lisp
index 5fee8b3..a071d37 100644
--- a/p35.lisp
+++ b/p35.lisp
@@ -95,6 +95,7 @@ RETURN:   a SEXP of the form: (* uncomensurate-factor
(cond
((and (listp factor) (eql 'expt (first factor)))
(destructuring-bind (expt prime expo) factor
+                 (declare (ignore expt))
(make-list expo :initial-element prime)))
(t (list factor))))
(nreverse (cdr (factorize n)))))
diff --git a/p36.lisp b/p36.lisp
index 1175284..6ca32a4 100644
--- a/p36.lisp
+++ b/p36.lisp
@@ -16,6 +16,7 @@ P36 (**) Determine the prime factors of a given positive integer (2).
(cond
((and (listp factor) (eql 'expt (first factor)))
(destructuring-bind (expt prime expo) factor
+                 (declare (ignore expt))
(list prime expo)))
(t
(list factor 1))))
diff --git a/rdp.lisp b/rdp.lisp
index 133f908..a4c539c 100644
--- a/rdp.lisp
+++ b/rdp.lisp
@@ -80,6 +80,7 @@
;;; First, we define a grammar, with actions.
;;; The scanner and parser is generated at macro expansion time.

+(defvar *linenum* 0)

(defmacro defgrammar (name &key terminals start rules (target-language :lisp))
"
@@ -484,6 +485,7 @@ Please, update it use whatever regexp package is available in ~A"
(ecase (car item)
((seq)
(destructuring-bind (seq items actions) item
+           (declare (ignore seq))
(let ((index 0))
`(let ,(mapcar (lambda (item)
`(,(intern (format nil "\$~D" (incf index)))```
ViewGit