License:Eclipse Public License
Parsley generates total and truly incremental parsers.
Total: a Parsley parser yields a parse-tree for any input string.
Truly incremental: a Parsley parser can operate as a text buffer, in best cases recomputing the parse-tree after a sequence of edits happens in logarithmic time (worst case: it behaves like a restartable parser).
Parsley parsers have no separate lexer, this allows for better compositionality of grammars.
Date Added:2012-03-03 22:53:24
Date Changed:2012-03-03 22:53:24