Lazy functional incremental parsing Export

@inproceedings{citeulike:5957342, abstract = {Structured documents are commonly edited using a free-form editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the edited document. The structured representation has a number of uses: structural navigation (and optional structural editing), structure highlighting, etc. The construction of the structure must be done incrementally to be efficient: the time to process an edit operation should be proportional to the size of the change, and (ideally) independent of the total size of the document. We show that combining lazy evaluation and caching of intermediate (partial) results enables incremental parsing. We build a complete incremental parsing library for interactive systems with support for error-correction.}, address = {New York, NY, USA}, author = {Bernardy, Jean P.}, booktitle = {Haskell '09: Proceedings of the 2nd ACM SIGPLAN symposium on Haskell}, citeulike-article-id = {5957342}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1596645}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1596638.1596645}, doi = {10.1145/1596638.1596645}, isbn = {978-1-60558-508-6}, keywords = {functional-programming, haskell, parsing, yi}, location = {Edinburgh, Scotland}, pages = {49--60}, posted-at = {2009-10-17 21:07:05}, priority = {4}, publisher = {ACM}, title = {Lazy functional incremental parsing}, url = {http://dx.doi.org/10.1145/1596638.1596645}, year = {2009} }

TY - CONF ID - citeulike:5957342 L3 - citeulike-article-id:5957342 N2 - Structured documents are commonly edited using a free-form editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the edited document. The structured representation has a number of uses: structural navigation (and optional structural editing), structure highlighting, etc. The construction of the structure must be done incrementally to be efficient: the time to process an edit operation should be proportional to the size of the change, and (ideally) independent of the total size of the document. We show that combining lazy evaluation and caching of intermediate (partial) results enables incremental parsing. We build a complete incremental parsing library for interactive systems with support for error-correction. CY - Edinburgh, Scotland SN - 978-1-60558-508-6 AD - New York, NY, USA EP - 60 TI - Lazy functional incremental parsing PB - ACM T2 - Haskell '09: Proceedings of the 2nd ACM SIGPLAN symposium on Haskell SP - 49 KW - functional-programming KW - haskell KW - parsing KW - yi AU - Bernardy, Jean PY - 2009/// UR - http://dx.doi.org/10.1145/1596638.1596645 ER -