EFFICIENT IMMUTABLE SYNTAX REPRESENTATION WITH INCREMENTAL CHANGE
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 i...
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng ; fre ; ger |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | GAFTER, Neal M PARSONS, Jared GOLDE, Peter AHARONI, Avner Y LIU, Karen WARREN, Matthew J PILCH-BISSON, Kevin SCHACH, David N TSINGAUZ, Aleksey V TORGERSEN, Mads PAQUAY, Renaud |
| description | 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. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_EP2521978B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EP2521978B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_EP2521978B13</originalsourceid><addsrcrecordid>eNrjZHB0dXPzdPZ09QtR8PT1DQ1xdPJxVQiO9AtxjFAIcg0Icg0GSjmGePr7KYR7hngoePo5B7n6gsR8FJw9HP3cXXkYWNMSc4pTeaE0N4OCm2uIs4duakF-fGpxQWJyal5qSbxrgJGpkaGluYWToTERSgCxNyrx</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>EFFICIENT IMMUTABLE SYNTAX REPRESENTATION WITH INCREMENTAL CHANGE</title><source>esp@cenet</source><creator>GAFTER, Neal M ; PARSONS, Jared ; GOLDE, Peter ; AHARONI, Avner Y ; LIU, Karen ; WARREN, Matthew J ; PILCH-BISSON, Kevin ; SCHACH, David N ; TSINGAUZ, Aleksey V ; TORGERSEN, Mads ; PAQUAY, Renaud</creator><creatorcontrib>GAFTER, Neal M ; PARSONS, Jared ; GOLDE, Peter ; AHARONI, Avner Y ; LIU, Karen ; WARREN, Matthew J ; PILCH-BISSON, Kevin ; SCHACH, David N ; TSINGAUZ, Aleksey V ; TORGERSEN, Mads ; PAQUAY, Renaud</creatorcontrib><description>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.</description><language>eng ; fre ; ger</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2020</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20200624&DB=EPODOC&CC=EP&NR=2521978B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25543,76294</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20200624&DB=EPODOC&CC=EP&NR=2521978B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>GAFTER, Neal M</creatorcontrib><creatorcontrib>PARSONS, Jared</creatorcontrib><creatorcontrib>GOLDE, Peter</creatorcontrib><creatorcontrib>AHARONI, Avner Y</creatorcontrib><creatorcontrib>LIU, Karen</creatorcontrib><creatorcontrib>WARREN, Matthew J</creatorcontrib><creatorcontrib>PILCH-BISSON, Kevin</creatorcontrib><creatorcontrib>SCHACH, David N</creatorcontrib><creatorcontrib>TSINGAUZ, Aleksey V</creatorcontrib><creatorcontrib>TORGERSEN, Mads</creatorcontrib><creatorcontrib>PAQUAY, Renaud</creatorcontrib><title>EFFICIENT IMMUTABLE SYNTAX REPRESENTATION WITH INCREMENTAL CHANGE</title><description>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.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2020</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHB0dXPzdPZ09QtR8PT1DQ1xdPJxVQiO9AtxjFAIcg0Icg0GSjmGePr7KYR7hngoePo5B7n6gsR8FJw9HP3cXXkYWNMSc4pTeaE0N4OCm2uIs4duakF-fGpxQWJyal5qSbxrgJGpkaGluYWToTERSgCxNyrx</recordid><startdate>20200624</startdate><enddate>20200624</enddate><creator>GAFTER, Neal M</creator><creator>PARSONS, Jared</creator><creator>GOLDE, Peter</creator><creator>AHARONI, Avner Y</creator><creator>LIU, Karen</creator><creator>WARREN, Matthew J</creator><creator>PILCH-BISSON, Kevin</creator><creator>SCHACH, David N</creator><creator>TSINGAUZ, Aleksey V</creator><creator>TORGERSEN, Mads</creator><creator>PAQUAY, Renaud</creator><scope>EVB</scope></search><sort><creationdate>20200624</creationdate><title>EFFICIENT IMMUTABLE SYNTAX REPRESENTATION WITH INCREMENTAL CHANGE</title><author>GAFTER, Neal M ; PARSONS, Jared ; GOLDE, Peter ; AHARONI, Avner Y ; LIU, Karen ; WARREN, Matthew J ; PILCH-BISSON, Kevin ; SCHACH, David N ; TSINGAUZ, Aleksey V ; TORGERSEN, Mads ; PAQUAY, Renaud</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_EP2521978B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre ; ger</language><creationdate>2020</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>GAFTER, Neal M</creatorcontrib><creatorcontrib>PARSONS, Jared</creatorcontrib><creatorcontrib>GOLDE, Peter</creatorcontrib><creatorcontrib>AHARONI, Avner Y</creatorcontrib><creatorcontrib>LIU, Karen</creatorcontrib><creatorcontrib>WARREN, Matthew J</creatorcontrib><creatorcontrib>PILCH-BISSON, Kevin</creatorcontrib><creatorcontrib>SCHACH, David N</creatorcontrib><creatorcontrib>TSINGAUZ, Aleksey V</creatorcontrib><creatorcontrib>TORGERSEN, Mads</creatorcontrib><creatorcontrib>PAQUAY, Renaud</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>GAFTER, Neal M</au><au>PARSONS, Jared</au><au>GOLDE, Peter</au><au>AHARONI, Avner Y</au><au>LIU, Karen</au><au>WARREN, Matthew J</au><au>PILCH-BISSON, Kevin</au><au>SCHACH, David N</au><au>TSINGAUZ, Aleksey V</au><au>TORGERSEN, Mads</au><au>PAQUAY, Renaud</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>EFFICIENT IMMUTABLE SYNTAX REPRESENTATION WITH INCREMENTAL CHANGE</title><date>2020-06-24</date><risdate>2020</risdate><abstract>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.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng ; fre ; ger |
| recordid | cdi_epo_espacenet_EP2521978B1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | EFFICIENT IMMUTABLE SYNTAX REPRESENTATION WITH INCREMENTAL CHANGE |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T12%3A22%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=GAFTER,%20Neal%20M&rft.date=2020-06-24&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EEP2521978B1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |