专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20130152061A1 FULL FIDELITY PARSE TREE FOR PROGRAMMING LANGUAGE PROCESSING 审中-公开
标题翻译：全方位的编程语言加工
公开(公告)号：US20130152061A1
公开(公告)日：2013-06-13
申请号：US13316584
申请日：2011-12-12
申请人： Peter Golde , Matthew J. Warren , Neal M. Gafter , HeeJae Chang
发明人： Peter Golde , Matthew J. Warren , Neal M. Gafter , HeeJae Chang
IPC分类号： G06F9/45
CPC分类号： G06F8/427 , G06F8/34 , G06F8/423
摘要： An augmented parser can create an augmented parse tree that captures all the information in the source code as additional elements. Information included in the augmented parse tree can include whitespace, comments, pre-processor directives, line continuation characters, missing text, text errors, and original text. Thus, the augmented parse tree can be used to fully reconstruct the original source code, character for character, including spaces, comments, and incorrect code. The improved parser can store syntactic error information in the original source code in the parse tree. The augmented parse tree can be used to generate or modify source code. The parse tree created by the augmented parser can be used for incremental parsing to create a new augmented parse tree after a change.
摘要翻译：扩展解析器可以创建一个扩展解析树，将源代码中的所有信息作为附加元素进行捕获。扩展解析树中包含的信息可以包括空格，注释，预处理器指令，行连续字符，缺少的文本，文本错误和原始文本。因此，增强解析树可以用于完全重建原始源代码，字符字符，包括空格，注释和不正确的代码。改进的解析器可以将语法错误信息存储在解析树中的原始源代码中。扩展解析树可用于生成或修改源代码。扩展解析器创建的解析树可用于增量解析，以便在更改后创建新的扩充解析树。

2. 发明申请

US20110167088A1 EFFICIENT IMMUTABLE SYNTAX REPRESENTATION WITH INCREMENTAL CHANGE 审中-公开
标题翻译：有效的不可更改的语义表达与增量变化
公开(公告)号：US20110167088A1
公开(公告)日：2011-07-07
申请号：US12683445
申请日：2010-01-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
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.
摘要翻译：通过创建包含至少一个允许树中的向上和向下引用以及不可变（只读）的树结构的至少一个树结构的数据结构，启用了增量更改下的父指针的高效不可变语法表示，并允许部分本身在其他数据结构中被重用。所描述的数据结构使工具能够搜索和定位特定的子树。表示目标子树的树的片段在使用时生成。树的其余部分不产生。只读树保留相关信息，允许重新组合和共享。

3. 发明授权

US10564944B2 Efficient immutable syntax representation with incremental change 有权
公开(公告)号：US10564944B2
公开(公告)日：2020-02-18
申请号：US12683445
申请日：2010-01-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
IPC分类号： G06F16/30 , G06F8/41
摘要： 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.

4. 发明申请

US20050015753A1 Virtual method protection 有权
标题翻译：虚拟方法保护
公开(公告)号：US20050015753A1
公开(公告)日：2005-01-20
申请号：US10622413
申请日：2003-07-18
申请人： Erik Meijer , Craig Sinclair , James Hogg , Peter Golde , Sergey Lidin , Christopher Brumme
发明人： Erik Meijer , Craig Sinclair , James Hogg , Peter Golde , Sergey Lidin , Christopher Brumme
IPC分类号： G06F9/42 , G06F9/45
CPC分类号： G06F8/433 , G06F9/449
摘要： Performing validation of a derived virtual method includes receiving program code where the derived virtual method is derived from a virtual method of the program language used to generate the program code, compiling the program code to an intermediate language expression, generating metadata descriptive of the compiled program code, validating the use of the derived virtual method by accessing the metadata, and permitting the use of the derived virtual method if the metadata grants override permissions concerning the virtual method of the programming language. The metadata indicating access and override permissions may be generated while compiling the program code in the common language infrastructure. Alternately, the flag may use pre-existing values indicative of the access and override permissions concerning the virtual method of the programming language.
摘要翻译：执行衍生虚拟方法的验证包括接收程序代码，其中派生虚拟方法从用于生成程序代码的程序语言的虚拟方法导出，将程序代码编译为中间语言表达，生成描述编译程序的元数据代码，通过访问元数据来验证导出的虚拟方法的使用，以及如果元数据授予涉及编程语言的虚拟方法的覆盖许可，则允许使用导出的虚拟方法。可以在公共语言基础设施中编译程序代码时生成指示访问和覆盖权限的元数据。或者，标志可以使用指示关于编程语言的虚拟方法的访问和覆盖许可的预先存在的值。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式