Keean: Your current C++ combinator library, as I understand it, is a backtracking implementation. When the parser backtracks, what happens to the discarded parse results? I imagine that the parser may have assembled AST subtrees to be discarded, with the result that reclamation isn't trivial. What's the model?
shap
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
