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

1. 发明授权

US08676826B2 Method, system and program storage device for automatic incremental learning of programming language grammar 失效
标题翻译：方法，系统和程序存储设备，用于自动增量学习编程语言语法
公开(公告)号：US08676826B2
公开(公告)日：2014-03-18
申请号：US13170723
申请日：2011-06-28
申请人： Pankaj Dhoolia , Mangala G. Nanda , Krishna Nandivada Venkata , Diptikalyan Saha
发明人： Pankaj Dhoolia , Mangala G. Nanda , Krishna Nandivada Venkata , Diptikalyan Saha
IPC分类号： G06F17/30 , G06N5/02 , G06F9/45
CPC分类号： G06F17/274
摘要： The embodiments provide for automatic incremental learning of programming language grammar. A corpus (i.e., a text file of software code written in a particular programming language) is parsed based on a set of grammar rules. An unparsed statement from the corpus is identified along with a section thereof, which did not match any of the grammar rules in the set. A subset of the set of grammar rules at fault for the parsing failure is identified. Groups of new grammar rules are developed such that each group comprises at least one new grammar rule, such that each group can parse the unparsed statement, and such that each new grammar rule is a modification of grammar rule(s) in the subset. One specific group can then be selected for possible incorporation into the set of grammar rules. Optionally, before a specific group is selected, the groups can be heuristically pruned and/or ranked.
摘要翻译：这些实施例提供了编程语言语法的自动增量学习。基于一组语法规则来解析语料库（即，以特定编程语言编写的软件代码的文本文件）。识别语料库中的一个未解释的语句及其一部分，与该集合中的任何语法规则不匹配。识别解析失败的故障语法规则集的一个子集。开发新的语法规则组，使得每个组包括至少一个新的语法规则，使得每个组可以解析未解析的语句，并且使得每个新的语法规则是子集中的语法规则的修改。然后可以选择一个特定的组，以便可能并入该组语法规则。可选地，在选择特定组之前，可以启发式修剪和/或排名组。

2. 发明申请

US20130007722A1 METHOD, SYSTEM AND PROGRAM STORAGE DEVICE THAT PROVIDE FOR AUTOMATIC PROGRAMMING LANGUAGE GRAMMAR PARTITIONING 失效
标题翻译：提供自动编程语言GRAMMAR分区的方法，系统和程序存储设备
公开(公告)号：US20130007722A1
公开(公告)日：2013-01-03
申请号：US13170888
申请日：2011-06-28
申请人： Pankaj Dhoolia , Mangala G. Nanda , Krishna Nandivada Venkata , Diptikalyan Saha
发明人： Pankaj Dhoolia , Mangala G. Nanda , Krishna Nandivada Venkata , Diptikalyan Saha
IPC分类号： G06F9/45
CPC分类号： G06F8/427 , G06F8/37
摘要： Disclosed are embodiments a computer-implemented method, a system and an associated program storage device that provide for automatic programming language grammar partitioning to solve the “code too large” problem. The embodiments partition a particular programming language grammar into logical subsets based on a set of partitioning heuristics and using a dependency graph that is preprocessed so as to be devoid of any cyclically connected grammar rule nodes. For each logical subset, textual code for a corresponding portion of a parsing program can be generated and then converted into machine-readable code for that corresponding portion of the parsing program. Thus, small amounts of textual code for portions of a parsing program are discretely converted into machine-readable code, thereby avoiding the “code too large” problem. The machine-readable code for all portions of the parsing program can then be merged and the parsing program can be executed in order to parse a corpus.
摘要翻译：公开了一种计算机实现的方法，系统和相关联的程序存储设备，其提供自动编程语言语法分区以解决代码太大的问题。实施例基于一组分割启发式方法将特定编程语言语法划分为逻辑子集，并使用预处理的依赖图，以便不具有任何循环连接的语法规则节点。对于每个逻辑子集，可以生成解析程序的相应部分的文本代码，然后将其转换为解析程序的相应部分的机器可读代码。因此，解析程序的部分的少量文本代码被离散地转换为机器可读代码，从而避免代码太大的问题。然后可以合并解析程序的所有部分的机器可读代码，并且可以执行解析程序以便解析语料库。

3. 发明申请

US20130006609A1 METHOD, SYSTEM AND PROGRAM STORAGE DEVICE FOR AUTOMATIC INCREMENTAL LEARNING OF PROGRAMMING LANGUAGE GRAMMAR 失效
标题翻译：方法，系统和程序存储设备，用于编程语言GRAMMAR的自动增量学习
公开(公告)号：US20130006609A1
公开(公告)日：2013-01-03
申请号：US13170723
申请日：2011-06-28
申请人： Pankaj Dhoolia , Mangala G. Nanda , Krishna Nandivada Venkata , Diptikalyan Saha
发明人： Pankaj Dhoolia , Mangala G. Nanda , Krishna Nandivada Venkata , Diptikalyan Saha
IPC分类号： G06F17/27
CPC分类号： G06F17/274
摘要： The embodiments provide for automatic incremental learning of programming language grammar. A corpus (i.e., a text file of software code written in a particular programming language) is parsed based on a set of grammar rules. An unparsed statement from the corpus is identified along with a section thereof, which did not match any of the grammar rules in the set. A subset of the set of grammar rules at fault for the parsing failure is identified. Groups of new grammar rules are developed such that each group comprises at least one new grammar rule, such that each group can parse the unparsed statement, and such that each new grammar rule is a modification of grammar rule(s) in the subset. One specific group can then be selected for possible incorporation into the set of grammar rules. Optionally, before a specific group is selected, the groups can be heuristically pruned and/or ranked.
摘要翻译：这些实施例提供了编程语言语法的自动增量学习。基于一组语法规则来解析语料库（即，以特定编程语言编写的软件代码的文本文件）。识别语料库中的一个未解释的语句及其一部分，与该集合中的任何语法规则不匹配。识别解析失败的故障语法规则集的一个子集。开发新的语法规则组，使得每个组包括至少一个新的语法规则，使得每个组可以解析未解析的语句，并且使得每个新的语法规则是子集中的语法规则的修改。然后可以选择一个特定的组，以便可能并入该组语法规则。可选地，在选择特定组之前，可以启发式修剪和/或排名组。

4. 发明授权

US08516457B2 Method, system and program storage device that provide for automatic programming language grammar partitioning 失效
标题翻译：方法，系统和程序存储设备，提供自动编程语言语法分区
公开(公告)号：US08516457B2
公开(公告)日：2013-08-20
申请号：US13170888
申请日：2011-06-28
申请人： Pankaj Dhoolia , Mangala G. Nanda , Krishna Nandivada Venkata , Diptikalyan Saha
发明人： Pankaj Dhoolia , Mangala G. Nanda , Krishna Nandivada Venkata , Diptikalyan Saha
IPC分类号： G06F9/45
CPC分类号： G06F8/427 , G06F8/37
摘要： Disclosed are embodiments a computer-implemented method, a system and an associated program storage device that provide for automatic programming language grammar partitioning to solve the “code too large” problem. The embodiments partition a particular programming language grammar into logical subsets based on a set of partitioning heuristics and using a dependency graph that is preprocessed so as to be devoid of any cyclically connected grammar rule nodes. For each logical subset, textual code for a corresponding portion of a parsing program can be generated and then converted into machine-readable code for that corresponding portion of the parsing program. Thus, small amounts of textual code for portions of a parsing program are discretely converted into machine-readable code, thereby avoiding the “code too large” problem. The machine-readable code for all portions of the parsing program can then be merged and the parsing program can be executed in order to parse a corpus.
摘要翻译：公开了一种计算机实现的方法，系统和相关联的程序存储设备，其提供自动编程语言语法分割以解决“代码太大”的问题。实施例基于一组分割启发式方法将特定编程语言语法划分为逻辑子集，并使用预处理的依赖图，以便不具有任何循环连接的语法规则节点。对于每个逻辑子集，可以生成解析程序的相应部分的文本代码，然后将其转换为解析程序的相应部分的机器可读代码。因此，用于解析程序的部分的少量文本代码被离散地转换成机器可读代码，从而避免了“代码太大”的问题。然后可以合并解析程序的所有部分的机器可读代码，并且可以执行解析程序以便解析语料库。

5. 发明授权

US07606832B2 System and method for orchestrating composite web services in constrained data flow environments 有权
标题翻译：在受限数据流环境中编排复合Web服务的系统和方法
公开(公告)号：US07606832B2
公开(公告)日：2009-10-20
申请号：US10987997
申请日：2004-11-12
申请人： Girish B. Chafle , Sunil Chandra , Sugata Ghosal , Vijay Mann , Mangala G. Nanda
发明人： Girish B. Chafle , Sunil Chandra , Sugata Ghosal , Vijay Mann , Mangala G. Nanda
IPC分类号： G06F17/00
CPC分类号： G06F9/5061 , G06F17/3089 , G06Q10/10 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944 , Y10S707/99945 , Y10S707/99948
摘要： A technique for orchestrating composite web services in a constrained data flow environment. Data flow constraints represent the restrictions which the domains involved in composition might want to impose on access to the data they provide or the source from which they can accept data. The data flow constraints are overcome by breaking down an input composite web service specification into topologies (a topology is a set of partitions communicatively connected with one another at runtime). The system applies a rule-based filtering mechanism to choose a topology that does not violate any data flow constraints. Each of the partitions belonging to the chosen topology is executed within the same domain as the corresponding web service it invokes, thus having the same access rights as the corresponding web service. The composite web service is orchestrated in a decentralized fashion using these partitions, thereby ensuring that no data flow constraints are violated.
摘要翻译：一种用于在受限数据流环境中编排复合Web服务的技术。数据流约束表示组合所涉及的域可能希望对访问他们提供的数据或从中接受数据的来源施加的限制。通过将输入的组合Web服务规范分解为拓扑（拓扑是一组在运行时彼此通信连接的分区）来克服数据流约束。系统应用基于规则的过滤机制来选择不违反任何数据流约束的拓扑。属于所选拓扑的每个分区在与其调用的相应web服务相同的域内执行，因此具有与相应web服务相同的访问权限。组合Web服务使用这些分区以分散的方式编排，从而确保不会违反数据流约束。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式