How do you determine whether a function is a directly recursivefunction? Assume

Question

How do you determine whether a function is a directly recursivefunction? Assume that all necessary definitions have beendefined.

In Common Lisp, write a function "recursive-p (fndef)" thatdetermines whether "fndef" is a directly recursive function.
The following function definition, expressed using this grammar,should be used as one of your test cases:

(defun fn (x fn)
(cond
((pred fn) (cons x (quote ())))
(T (cons x (fn x fn)))))

To test out your solution, you should represent this functiondenition as a list constant and assign it to a variable asfollows:

(setq fndef '(defun fn ... ))

Explanation / Answer

Solved this problem myself. I'm closing this question.

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.