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

1. 发明申请

US20090030921A1 INCREMENTAL PARSING OF HIERARCHICAL FILES 有权
标题翻译：分层文件的增量分隔
公开(公告)号：US20090030921A1
公开(公告)日：2009-01-29
申请号：US11781636
申请日：2007-07-23
申请人： Yana D. Kadiyska , Anton V. Lapounov , Sergey Dubinets , Christopher J. Lovett
发明人： Yana D. Kadiyska , Anton V. Lapounov , Sergey Dubinets , Christopher J. Lovett
IPC分类号： G06F17/30
CPC分类号： G06F17/2247 , G06F17/272
摘要： An incremental parser for hierarchical files is provided where the file can be parsed into a tree representation. Changes to the file can effectuate incremental changes to the tree such that the whole hierarchical file need not be reparsed; the incremental change modifies the necessary portions of the tree, not necessarily the entire tree. Moreover, the incremental parser can intelligently handle errors related to modification of the hierarchical file, such as unmatched tags corresponding to unmatched nodes in the tree. Such error handling provides operability with the malformed hierarchical file rather than providing an error and/or rejecting the file as modified.
摘要翻译：提供分层文件的增量解析器，其中文件可以被解析成树表示。对文件的更改可以对树进行增量更改，从而不需要重新整理层次结构文件; 增量更改会修改树的必要部分，而不一定是整个树。此外，增量解析器可以智能地处理与分层文件的修改相关的错误，例如与树中不匹配的节点相对应的不匹配的标签。这种错误处理提供了畸形分层文件的可操作性，而不是提供错误和/或拒绝被修改的文件。

2. 发明授权

US07747633B2 Incremental parsing of hierarchical files 有权
标题翻译：分层文件的增量解析
公开(公告)号：US07747633B2
公开(公告)日：2010-06-29
申请号：US11781636
申请日：2007-07-23
申请人： Yana D. Kadiyska , Anton V. Lapounov , Sergey Dubinets , Christopher J. Lovett
发明人： Yana D. Kadiyska , Anton V. Lapounov , Sergey Dubinets , Christopher J. Lovett
IPC分类号： G06F17/30
CPC分类号： G06F17/2247 , G06F17/272
摘要： An incremental parser for hierarchical files is provided where the file can be parsed into a tree representation. Changes to the file can effectuate incremental changes to the tree such that the whole hierarchical file need not be reparsed; the incremental change modifies the necessary portions of the tree, not necessarily the entire tree. Moreover, the incremental parser can intelligently handle errors related to modification of the hierarchical file, such as unmatched tags corresponding to unmatched nodes in the tree. Such error handling provides operability with the malformed hierarchical file rather than providing an error and/or rejecting the file as modified.
摘要翻译：提供分层文件的增量解析器，其中文件可以被解析成树表示。对文件的更改可以对树进行增量更改，从而不需要重新整理层次结构文件; 增量更改会修改树的必要部分，而不一定是整个树。此外，增量解析器可以智能地处理与分层文件的修改相关的错误，例如与树中不匹配的节点相对应的不匹配的标签。这种错误处理提供了畸形分层文件的可操作性，而不是提供错误和/或拒绝被修改的文件。

3. 发明申请

US20070245330A1 XSLT/XPath focus inference for optimized XSLT implementation 失效
标题翻译： XSLT / XPath重点推荐优化XSLT实现
公开(公告)号：US20070245330A1
公开(公告)日：2007-10-18
申请号：US11521525
申请日：2006-09-13
申请人： Anton V. Lapounov , Ralf Lammel , Sergey Dubinets
发明人： Anton V. Lapounov , Ralf Lammel , Sergey Dubinets
IPC分类号： G06F9/45
CPC分类号： G06F17/227 , G06F17/2247
摘要： Techniques are provided for performing focus inference when compiling an Extensible Markup Language Transforms (XSLT) stylesheet into a compiled XSLT processor. In XPath/XSLT, expression evaluation occurs with respect to the dynamic context. In XPath, the part of the dynamic context, related to the context node-set, is called the “focus” of the expression. Conceptually, the focus would need to be systematically computed and propagated along the recursive execution of XSLT templates. This is costly. Focus inference enables the more efficient execution of XSLT programs since the inferred focus information can be used directly by a code generator in an XSLT compilation architecture.
摘要翻译：在将可扩展标记语言转换（XSLT）样式表编译为编译的XSLT处理器时，提供了用于执行焦点推理的技术。在XPath / XSLT中，关于动态上下文发生表达式求值。在XPath中，动态上下文的与上下文节点集相关的部分称为表达式的“焦点”。在概念上，重点将需要系统地计算并沿XSLT模板的递归执行传播。这是昂贵的。焦点推论使XSLT程序的执行更加有效，因为XSLT编译架构中的代码生成器可以直接使用推断的焦点信息。

4. 发明授权

US08074166B2 XSLT/XPATH focus inference for optimized XSLT implementation 失效
标题翻译： XSLT / XPATH重点推荐优化XSLT实现
公开(公告)号：US08074166B2
公开(公告)日：2011-12-06
申请号：US11521525
申请日：2006-09-13
申请人： Anton V. Lapounov , Ralf Lammel , Sergey Dubinets
发明人： Anton V. Lapounov , Ralf Lammel , Sergey Dubinets
IPC分类号： G06F17/00
CPC分类号： G06F17/227 , G06F17/2247
摘要： Techniques are provided for performing focus inference when compiling an Extensible Markup Language Transforms (XSLT) stylesheet into a compiled XSLT processor. In XPath/XSLT, expression evaluation occurs with respect to the dynamic context. In XPath, the part of the dynamic context, related to the context node-set, is called the “focus” of the expression. Conceptually, the focus would need to be systematically computed and propagated along the recursive execution of XSLT templates. This is costly. Focus inference enables the more efficient execution of XSLT programs since the inferred focus information can be used directly by a code generator in an XSLT compilation architecture.
摘要翻译：在将可扩展标记语言转换（XSLT）样式表编译为编译的XSLT处理器时，提供了用于执行焦点推理的技术。在XPath / XSLT中，关于动态上下文发生表达式求值。在XPath中，动态上下文的与上下文节点集相关的部分称为表达式的“焦点”。在概念上，重点将需要系统地计算并沿XSLT模板的递归执行传播。这是昂贵的。焦点推论使XSLT程序的执行更加有效，因为XSLT编译架构中的代码生成器可以直接使用推断的焦点信息。

5. 发明申请

US20090328001A1 UNLOADABLE MANAGED CODE 审中-公开
标题翻译：无法管理的代码
公开(公告)号：US20090328001A1
公开(公告)日：2009-12-31
申请号：US12147875
申请日：2008-06-27
申请人： Sergey Dubinets , Anton V. Lapounov
发明人： Sergey Dubinets , Anton V. Lapounov
IPC分类号： G06F9/44
CPC分类号： G06F8/30 , G06F9/4484
摘要： The claimed subject matter provides a system and/or a method that facilitates generating unloadable managed code. A set of static subroutines included in a library or an assembly can be converted into dynamic subroutines created at runtime of an application. A reflection component can extract information regarding a static subroutine to produce a full description of structure and data of the subroutine. A dynamic method component can create a dynamic subroutine based upon the full description such that the dynamic subroutine provides substantially equivalent functionality to the static subroutine. In addition, resources allocated to the dynamic subroutine can be reclaimed to prevent waste and/or application bloat.
摘要翻译：所要求保护的主题提供了有助于生成无法管理的代码的系统和/或方法。包含在库或程序集中的一组静态子程序可以转换为在应用程序运行时创建的动态子程序。反射分量可以提取关于静态子程序的信息，以产生子程序的结构和数据的完整描述。动态方法组件可以基于完整描述创建动态子程序，使得动态子程序提供与静态子程序基本相同的功能。此外，分配给动态子程序的资源可以回收，以防止浪费和/或应用程序膨胀。

6. 发明申请

US20120042234A1 XSLT/XPATH Focus Inference For Optimized XSLT Implementation 审中-公开
标题翻译： XSLT / XPATH针对优化XSLT实现的焦点推理
公开(公告)号：US20120042234A1
公开(公告)日：2012-02-16
申请号：US13276585
申请日：2011-10-19
申请人： Anton V. Lapounov , Ralf Lammel , Sergey Dubinets
发明人： Anton V. Lapounov , Ralf Lammel , Sergey Dubinets
IPC分类号： G06F17/00
CPC分类号： G06F17/227 , G06F17/2247
摘要： Techniques are provided for performing focus inference when compiling an Extensible Markup Language Transforms (XSLT) stylesheet into a compiled XSLT processor. In XPath/XSLT, expression evaluation occurs with respect to the dynamic context. In XPath, the part of the dynamic context, related to the context node-set, is called the “focus” of the expression. Conceptually, the focus would need to be systematically computed and propagated along the recursive execution of XSLT templates. This is costly. Focus inference enables the more efficient execution of XSLT programs since the inferred focus information can be used directly by a code generator in an XSLT compilation architecture.
摘要翻译：在将可扩展标记语言转换（XSLT）样式表编译为编译的XSLT处理器时，提供了用于执行焦点推理的技术。在XPath / XSLT中，关于动态上下文发生表达式求值。在XPath中，动态上下文的与上下文节点集相关的部分称为表达式的“焦点”。在概念上，重点将需要系统地计算并沿XSLT模板的递归执行传播。这是昂贵的。焦点推论使XSLT程序的执行更加有效，因为XSLT编译架构中的代码生成器可以直接使用推断的焦点信息。

7. 发明申请

US20070245325A1 Type inference for optimized XSLT implementation 审中-公开
标题翻译：类型推断优化的XSLT实现
公开(公告)号：US20070245325A1
公开(公告)日：2007-10-18
申请号：US11521140
申请日：2006-09-13
申请人： Anton V. Lapounov , Ralf Lammel , Sergey Dubinets
发明人： Anton V. Lapounov , Ralf Lammel , Sergey Dubinets
IPC分类号： G06F9/45
CPC分类号： G06F8/437
摘要： Type inference techniques are provided for use in compiling an Extensible Markup Language Transforms (XSLT) stylesheet into a compiled XSLT processor. Using “variant” storages instead of an appropriate efficient representation is both memory-costly (requires more space) and computationally inefficient (requires runtime type switching during execution of the expression). Type inference may be used to determine what types may be assigned to variables and parameters during execution of an XSLT program.
摘要翻译：提供类型推理技术用于将可扩展标记语言转换（XSLT）样式表编译为编译的XSLT处理器。使用“变体”存储而不是适当的有效表示是内存成本高（需要更多的空间）和计算效率低（在执行表达式期间需要运行时类型切换）。可以使用类型推断来确定在执行XSLT程序期间可以分配给变量和参数的类型。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式