首页> 外国专利> Computer-implemented weighted tree search to resolve variable name ambiguity

Computer-implemented weighted tree search to resolve variable name ambiguity

机译:计算机实现的加权树搜索以解决变量名的歧义

摘要

Resolving ambiguous variable names in processing of a computer application includes representing variable declarations with dynamic variable scopes of the computer application in a tree data structure where the nodes of the tree data structure are variable names of the computer application. Ambiguous variable names are resolved by calculating distances between a context node and two or more candidate nodes of the tree data structure where each of the candidate nodes contains the searched variable name. The weighted distance between the context node and each candidate node equals the number of downward steps from the context node to the candidate node multiplied by a first constant plus the number of upward steps from the context node to the candidate node multiplied by a second constant. The node having a desired weighted distance is selected and information from the selected node is returned to the computer application as the variable value.
机译:在计算机应用程序的处理中解决模棱两可的变量名包括在树形数据结构中用计算机应用程序的动态变量范围表示变量声明,其中树形数据结构的节点是计算机应用程序的变量名。通过计算上下文节点与树数据结构的两个或多个候选节点之间的距离来解析不明确的变量名,其中每个候选节点都包含搜索到的变量名。上下文节点与每个候选节点之间的加权距离等于从上下文节点到候选节点的向下步数乘以第一常数,再加上从上下文节点到候选节点的向上步数乘以第二常数。选择具有所需加权距离的节点,并将来自所选节点的信息作为变量值返回到计算机应用程序。

著录项

  • 公开/公告号US8700638B2

    专利类型

  • 公开/公告日2014-04-15

    原文格式PDF

  • 申请/专利权人 MICHAEL DEARMAN;ALBERT CECCHINI;

    申请/专利号US201213415244

  • 发明设计人 ALBERT CECCHINI;MICHAEL DEARMAN;

    申请日2012-03-08

  • 分类号G06F17/30;

  • 国家 US

  • 入库时间 2022-08-21 16:02:25

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号