balazs-endresz / jsparsec Goto Github PK

Browsers can make only a few hundred recursive calls, so to get around this 
issue the primitive combinators should be either transformed into trampolined 
style or the results should be passed to continuations after a time-out. 
Hopefully functions written in "callstreams" or "array-expressions" can be 
transformed automatically to handle this. Any suggestions are welcome!

All the functions should be exported in one or two objects for a stable 
release.

There should be an interface for adding further input incrementally.

Now .resolve() is called after every callstream and callstreams even 
"evaluate" every line (a line in the do-notation) immediately anyway. Since 
it can already cache the resulting expression, this should be done only when 
it's needed, i.e when it first receives a ParseState object.