Hi! I started working on a parser generator named IPG, which stand for Incremental Parser Generator. It is of course based on PEGs. No semantic actions are embedded in the grammar. Instead, an interface is provided to traverse the parse tree (in the current C++ implementation it's an STL-style iterator). The goal is to able to update the parse tree incrementally when the text changes (in O(n) where n is the size of the modification) and use it directly as much as possible to avoid the cost of rebuilding an AST.
I would like to know if similar projects exist and/or what you think about it. Some context about the creation of this project can be found in this blog post : http://blog.c3lang.org/status-update Thanks! Alexandre Cossette _______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
