发明申请
US20110167088A1 EFFICIENT IMMUTABLE SYNTAX REPRESENTATION WITH INCREMENTAL CHANGE
审中-公开
有效的不可更改的语义表达与增量变化
- 专利标题: EFFICIENT IMMUTABLE SYNTAX REPRESENTATION WITH INCREMENTAL CHANGE
- 专利标题(中): 有效的不可更改的语义表达与增量变化
-
申请号: US12683445申请日: 2010-01-07
-
公开(公告)号: US20110167088A1公开(公告)日: 2011-07-07
- 发明人: Matthew J. Warren , Avner Y. Aharoni , Mads Torgersen , Renaud Paquay , Neal M. Gafter , Jared Parsons , David N. Schach , Aleksey V. Tsingauz , Peter Golde , Kevin Pilch-Bisson , Karen Liu
- 申请人: Matthew J. Warren , Avner Y. Aharoni , Mads Torgersen , Renaud Paquay , Neal M. Gafter , Jared Parsons , David N. Schach , Aleksey V. Tsingauz , Peter Golde , Kevin Pilch-Bisson , Karen Liu
- 申请人地址: US WA Redmond
- 专利权人: Microsoft Corporation
- 当前专利权人: Microsoft Corporation
- 当前专利权人地址: US WA Redmond
- 主分类号: G06F17/30
- IPC分类号: G06F17/30
摘要:
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.
公开/授权文献
信息查询