Microsoft Technology Licensing, LLC

Kevin Andrew Pilch

Matthew J Warren

Mads Torgersen

David N Schach

Peter H Golde

Jared Porter Parsons

Neal M Gafter

Aleksey V Tsingauz

Karen Liu

Renaud Paquay

Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.

Efficient immutable syntax representation with incremental change

Growing community of inventors

Snohomish, WA, United States of America

Kevin Andrew Pilch