Hexlet SICP
  • Contents
  • Exercises
  • Leaderboard
  • The book
  • Login
  • Sign up
  • English English
    • Русский Русский
  1. Contents
  2. 5 Computing with Register Machines
  3. 5.4 The Explicit-Control Evaluator
  4. 5.4.4 Running the Evaluator
Previous chapter Next chapter
5.4 The Explicit-Control Evaluator

5.4.4 Running the Evaluator

Exercises:

  • 5.26 . Exploration of the tail-recursive property of the evaluator
  • 5.27 . The maximum depth of the stack and the total number of pushes used in evaluating n!
  • 5.28 . The evaluator without tail-recursion
  • 5.29 . The stack operations in the tree-recursive Fibonacci computation
  • 5.30 . Error handling system

There are no comments yet.

Authentication required

You must log in to post a comment.

Login
  • About
  • Source code
  • Telegram
Help
  • Blog
  • layout.footer.free
  • Recommended books
OpenSource
  • Hexlet CV
  • Run IT
  • Hexlet Friends
Extras
  • Hexlet
  • Code Basics
  • CodeBattle
  • Hexlet Guides