RE: Re[2]: [cc65] dummy questions...

Date view Thread view Subject view

From: Marko Mäkelä (
Date: 2002-02-18 13:37:20

On Mon, 18 Feb 2002, Keates, Mark wrote:

> Aren't both of these 'solvers' recursion based?
> Would the standard cc65 stack frames cope with this?

Not necessarily.  Recursion can be simulated with an explicit stack (or
queue) data structure.  That's what I've done in a reachability analyzer
that can handle state spaces consisting of tens of millions of states.
Using the system stack would not work, since the hardware stack is limited
to some megabytes.  Using an explicit search stack (depth-first search) or
queue (breadth-first search) saves memory, since there's no need to store
any local variables; only the data that is necessary for determining the
state of the search.


To unsubscribe from the list send mail to with
the string "unsubscribe cc65" in the body(!) of the mail.

Date view Thread view Subject view

This archive was generated by hypermail 2.1.3 : 2002-02-18 13:37:22 CET