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

1. 发明授权

US09003377B2 Efficient resumption of co-routines on a linear stack 有权
标题翻译：在线性堆栈上有效恢复协同程序
公开(公告)号：US09003377B2
公开(公告)日：2015-04-07
申请号：US12683447
申请日：2010-01-07
申请人： Neal M. Gafter , Mads Torgersen , Henricus Johannes Maria Meijer , Niklas Gustafsson
发明人： Neal M. Gafter , Mads Torgersen , Henricus Johannes Maria Meijer , Niklas Gustafsson
IPC分类号： G06F9/44
CPC分类号： G06F9/4426 , G06F9/4486 , G06F9/485
摘要： Unsuspended co-routines are handled by the machine call stack mechanism in which the stack grows and shrinks as recursive calls are made and returned from. When a co-routine is suspended, however, additional call stack processing is performed. A suspension message is issued, and the entire resume-able part of the call stack is removed, and is copied to the heap. A frame that returns control to a driver method (a resumer) is copied to the call stack so that resumption of the co-routine does not recursively reactivate the whole call stack. Instead the resumer reactivates only the topmost or most current frame called the leaf frame. When a co-routine is suspended, it does not return to its caller, but instead returns to the resumer that has reactivated it.
摘要翻译：未挂起的共同例程由机器调用堆栈机制处理，其中堆栈随着递归调用并从中返回而增长和收缩。然而，当暂停协同程序时，执行额外的呼叫栈处理。发出暂停消息，并且删除调用堆栈的整个可恢复部分，并将其复制到堆中。将控制权返回到驱动程序方法（resumer）的一个框架将被复制到调用堆栈，以便恢复协同程序不会递归地重新激活整个调用堆栈。相反，resumer仅重新激活称为叶子框架的最前面或最近的帧。当一个共同程序被暂停时，它不会返回到其调用者，而是返回已重新激活它的resumer。

2. 发明授权

US08549506B2 Resumable methods 有权
标题翻译：可读方法
公开(公告)号：US08549506B2
公开(公告)日：2013-10-01
申请号：US12767811
申请日：2010-04-27
申请人： Henricus Johannes Maria Meijer , Mads Torgersen , Neal M. Gafter , Niklas Gustafsson
发明人： Henricus Johannes Maria Meijer , Mads Torgersen , Neal M. Gafter , Niklas Gustafsson
IPC分类号： G06F9/45
CPC分类号： G06F8/314
摘要： APIs are provided, that are external to a programming language but that provide functionality that can be plugged into a language compiler. The provided APIs tailor functionality associated with asynchronous programming, iterators or writing symmetric co-routines using a generalized pattern-based approach. Several types of resumable methods are provided in the APIs which can be applied to method bodies written in traditional program code. Syntactically distinguishable control points in method bodies written in traditional program code invoke transformation of the code by the compiler using the external APIs. The transformed code enables the pausing and resumption of the code sandwiched between control points in the transformed code. The source code contained within a method having control points in it is transformed so that code within the method can be executed in discrete parts, each part starting and ending at a control point in the transformed code.
摘要翻译：提供API，它们是编程语言外部的，但是提供可以插入到语言编译器中的功能。提供的API定制与异步编程相关的功能，迭代器或使用广义的基于模式的方法来编写对称协同程序。 API中提供了几种类型的可恢复方法，可以将其应用于以传统程序代码编写的方法体。以传统程序代码编写的方法体中的语法上可区分的控制点通过外部API调用编译器对代码的转换。转换的代码使得能够暂停和恢复被转换代码中的控制点之间的代码。包含在具有其中的控制点的方法中的源代码被变换，使得该方法中的代码可以以离散部分执行，每个部分开始并在变换代码的控制点结束。

3. 发明申请

US20110265070A1 RESUMABLE METHODS 有权
标题翻译：可恢复的方法
公开(公告)号：US20110265070A1
公开(公告)日：2011-10-27
申请号：US12767811
申请日：2010-04-27
申请人： Henricus Johannes Maria Meijer , Mads Torgersen , Neal M. Gafter , Niklas Gustafsson
发明人： Henricus Johannes Maria Meijer , Mads Torgersen , Neal M. Gafter , Niklas Gustafsson
IPC分类号： G06F9/45
CPC分类号： G06F8/314
摘要： APIs are provided, that are external to a programming language but that provide functionality that can be plugged into a language compiler. The provided APIs tailor functionality associated with asynchronous programming, iterators or writing symmetric co-routines using a generalized pattern-based approach. Several types of resumable methods are provided in the APIs which can be applied to method bodies written in traditional program code. Syntactically distinguishable control points in method bodies written in traditional program code invoke transformation of the code by the compiler using the external APIs. The transformed code enables the pausing and resumption of the code sandwiched between control points in the transformed code. The source code contained within a method having control points in it is transformed so that code within the method can be executed in discrete parts, each part starting and ending at a control point in the transformed code.
摘要翻译：提供API，它们是编程语言外部的，但是提供可以插入到语言编译器中的功能。提供的API定制与异步编程相关的功能，迭代器或使用广义的基于模式的方法来编写对称协同程序。 API中提供了几种类型的可恢复方法，可以将其应用于以传统程序代码编写的方法体。以传统程序代码编写的方法体中的语法上可区分的控制点通过外部API调用编译器对代码的转换。转换的代码使得能够暂停和恢复被转换代码中的控制点之间的代码。包含在其中具有控制点的方法中的源代码被变换，使得该方法中的代码可以以离散部分执行，每个部分开始并在变换代码的控制点结束。

4. 发明申请

US20110167248A1 EFFICIENT RESUMPTION OF CO-ROUTINES ON A LINEAR STACK 有权
标题翻译：在线性堆栈上的有效恢复
公开(公告)号：US20110167248A1
公开(公告)日：2011-07-07
申请号：US12683447
申请日：2010-01-07
申请人： Neal M. Gafter , Mads Torgersen , Henricus Johannes Maria Meijer , Niklas Gustafsson
发明人： Neal M. Gafter , Mads Torgersen , Henricus Johannes Maria Meijer , Niklas Gustafsson
IPC分类号： G06F9/40 , G06F9/44
CPC分类号： G06F9/4426 , G06F9/4486 , G06F9/485
摘要： Unsuspended co-routines are handled by the machine call stack mechanism in which the stack grows and shrinks as recursive calls are made and returned from. When a co-routine is suspended, however, additional call stack processing is performed. A suspension message is issued, and the entire resume-able part of the call stack is removed, and is copied to the heap. A frame that returns control to a driver method (a resumer) is copied to the call stack so that resumption of the co-routine does not recursively reactivate the whole call stack. Instead the resumer reactivates only the topmost or most current frame called the leaf frame. When a co-routine is suspended, it does not return to its caller, but instead returns to the resumer that has reactivated it.
摘要翻译：未挂起的共同例程由机器调用堆栈机制处理，其中堆栈随着递归调用并从中返回而增长和收缩。然而，当暂停协同程序时，执行额外的呼叫栈处理。发出暂停消息，并且删除调用堆栈的整个可恢复部分，并将其复制到堆中。将控制权返回到驱动程序方法（resumer）的一个框架将被复制到调用堆栈，以便恢复协同程序不会递归地重新激活整个调用堆栈。相反，resumer仅重新激活称为叶子框架的最前面或最近的帧。当一个共同程序被暂停时，它不会返回到其调用者，而是返回已重新激活它的resumer。

5. 发明申请

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.
摘要翻译：通过创建包含至少一个允许树中的向上和向下引用以及不可变（只读）的树结构的至少一个树结构的数据结构，启用了增量更改下的父指针的高效不可变语法表示，并允许部分本身在其他数据结构中被重用。所描述的数据结构使工具能够搜索和定位特定的子树。表示目标子树的树的片段在使用时生成。树的其余部分不产生。只读树保留相关信息，允许重新组合和共享。

6. 发明授权

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.

7. 发明申请

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.
摘要翻译：扩展解析器可以创建一个扩展解析树，将源代码中的所有信息作为附加元素进行捕获。扩展解析树中包含的信息可以包括空格，注释，预处理器指令，行连续字符，缺少的文本，文本错误和原始文本。因此，增强解析树可以用于完全重建原始源代码，字符字符，包括空格，注释和不正确的代码。改进的解析器可以将语法错误信息存储在解析树中的原始源代码中。扩展解析树可用于生成或修改源代码。扩展解析器创建的解析树可用于增量解析，以便在更改后创建新的扩充解析树。

8. 发明授权

US07263687B2 Object-oriented enumerated type facility 有权
标题翻译：面向对象的枚举类型设施
公开(公告)号：US07263687B2
公开(公告)日：2007-08-28
申请号：US10237941
申请日：2002-09-09
申请人： Joshua J. Bloch , Neal M. Gafter
发明人： Joshua J. Bloch , Neal M. Gafter
IPC分类号： G06F9/44 , G06F9/45
CPC分类号： G06F9/4488
摘要： One embodiment of the present invention provides a system that facilitates use of an object-oriented enumerated type within a computer program. During operation, the system receives source code for the computer program, wherein the source code contains a declaration for an enumerated type. This declaration specifies a fixed number of enumeration constants that comprise the enumerated type. Next, the system defines the enumerated type using a class defined within an object-oriented programming language, wherein the class includes a constant for each enumeration constant specified in the declaration. If the declaration additionally contains one or more method declarations, these methods are present on the defined class.
摘要翻译：本发明的一个实施例提供一种便于在计算机程序内使用面向对象的枚举类型的系统。在操作期间，系统接收计算机程序的源代码，其中源代码包含枚举类型的声明。该声明指定了枚举类型的枚举常量的固定数量。接下来，系统使用在面向对象编程语言中定义的类来定义枚举类型，其中该类包括在声明中指定的每个枚举常数的常数。如果声明另外包含一个或多个方法声明，则这些方法存在于定义的类上。

9. 发明授权

US5666296A Method and means for translating a data-dependent program to a data flow graph with conditional expression 失效
标题翻译：用于将数据相关程序转换为具有条件表达式的数据流图的方法和装置
公开(公告)号：US5666296A
公开(公告)日：1997-09-09
申请号：US815442
申请日：1991-12-31
申请人： Neal M. Gafter
发明人： Neal M. Gafter
IPC分类号： G06F15/82 , G06F9/06 , G06F9/45 , G06F17/00
CPC分类号： G06F8/49
摘要： The method comprises the steps of converting the algorithm into a control flow graph having a plurality of nodes, each node representing at least one of the plurality of statements. The control flow graph further includes a conditional branching node for the data-dependent conditional branching statement. Reverse dominators are then computed for each of the plurality of nodes, from which a meet point node for each conditional branching node is derived. The method further provides for constructing a shadow symbol table housing the variables, and constructing a duplicate shadow symbol table for each possible value of the datum in response to the conditional branching node. The conditional branching node is also evaluated by assuming each possible value of the datum for each branch and assigning symbolic values to each of the variables in the shadow symbol table. The nodes contained in each branch are evaluated until the meet point node is reached. The duplicate shadow symbol tables are then merged. The symbolic evaluation continues until all the conditional branches are evaluated and the end of the control flow graph is reached to provide a conditional expression representing the algorithm.
摘要翻译：该方法包括以下步骤：将算法转换成具有多个节点的控制流程图，每个节点表示多个语句中的至少一个。控制流图还包括用于数据相关条件分支语句的条件分支节点。然后针对多个节点中的每个节点计算反向主导者，从中导出用于每个条件分支节点的会聚点节点。该方法进一步提供构建容纳变量的阴影符号表，并响应于条件分支节点为数据的每个可能值构建重复的阴影符号表。还通过假设每个分支的基准的每个可能值并将符号值分配给阴影符号表中的每个变量来评估条件分支节点。评估每个分支中包含的节点，直到到达点节点。然后合并重复的阴影符号表。符号评估将继续进行，直到所有条件分支被评估，并且达到控制流程图的结束以提供表示算法的条件表达式。

10. 发明授权

US07080369B1 Method and apparatus for producing compressed compiler products 有权
标题翻译：生产压缩编译器产品的方法和设备
公开(公告)号：US07080369B1
公开(公告)日：2006-07-18
申请号：US09649270
申请日：2000-08-28
申请人： Lawrence A. Crowl , Neal M. Gafter
发明人： Lawrence A. Crowl , Neal M. Gafter
IPC分类号： G06F9/45
CPC分类号： G06F8/4434
摘要： Improved techniques for reducing the size of compiler products are disclosed. The techniques facilitate reduction of size by providing differential schemes aimed at producing compiler related information in a compressed form. The compressed compiler related information include symbol names associated with symbols encountered in programming languages. The improved techniques yield improved compilation times and compiler products that utilize substantially less storage space (e.g., disk storage space).
摘要翻译：公开了减少编译器产品尺寸的改进技术。该技术通过提供旨在以压缩形式产生编译器相关信息的差异方案来促进大小的减小。压缩的编译器相关信息包括与编程语言中遇到的符号相关联的符号名称。改进的技术产生改进的编译时间和利用显着更少的存储空间（例如，磁盘存储空间）的编译器产品。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式