I haven't worked on my lazy list library in a while, but here's the most recent incarnation:

http://www.msu.edu/~shawjef3/lazylist3.ml

The difference is that the list itself is lazy rather than just the tail. It doesn't seem to change anything with regards to the parser combinator's stack overflow.

Here's the combinator parser code that goes with the above library. Yes, it still overflows sometimes.

http://www.msu.edu/~shawjef3/combparslazy3.ml