Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] Problem with ocamlopt
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: M E Leypold @ labnet <leypold@i...>
Subject: [Caml-list] Problem with ocamlopt

Franck Delaplace writes:
 > 
 > When I try to compile a program with ocamlopt,  
 > the following  exception is raised
 > 
 > Uncaught exception: Stack overflow


 > PS: You will find attached the source code 

When trying to read it, one of my brain modules threw an exception:
Stack overflow. :-)


Hi Franck,

Actually I only wrote to make that joke, but to be a bit more useful:
It might be that the constructs used by the code generator you used to
translate the FA definitions into ocaml nest somewhat too deeply, and
since the ocamlcompiler parses recursive descendend (i think) its
stack overflows at some point or other.

Suggestions:

   * Try cutting down your FA, let's say to half as a test case and
     compile it then. Does it overflow still? If no, try to make your
     FA smaller and keep functionality.

   * Report a problem/bug to the tagcc people and use ocamlc in the
     meantime waiting for a bug fix. If things are like I suggest,
     that is should be called a tagcc bug, since there is IMHO no
     reason for FA execution to use nested constructs this way
     (nesting too deeply).

Regards -- Markus




-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners