Hi,

I am looking for some ideas on handling program error reporting for a
compiler that is built largely on CPS. Since there are no stack frames to
crawl for traceback, I have a first cut based on keeping a finite length
queue of last visited closures. But this becomes problematic when there are
circularities in the code, i.e., recursion. Also, I think I have way too
much error tracking going on at each incremental execution step and so
runtime performance is cut back compared to what it could be.

This compiler is written in OCaml and so there really are stack frames in a
few places.

Any ideas?

- David McClain, Sr. Scientist, Raytheon Systems Co., Tucson, AZ
-------------------
Bug reports: http://caml.inria.fr/bin/caml-bugs  FAQ: http://caml.inria.fr/FAQ/
To unsubscribe, mail caml-list-request@inria.fr  Archives: http://caml.inria.fr