TECHNIQUES FOR USING CONTROLLED NATURAL LANGUAGE TO CAPTURE DESIGN INTENT FOR COMPUTER-AIDED DESIGN
    41.
    发明申请
    TECHNIQUES FOR USING CONTROLLED NATURAL LANGUAGE TO CAPTURE DESIGN INTENT FOR COMPUTER-AIDED DESIGN 审中-公开
    使用控制自然语言来获取计算机辅助设计的设计技术的技术

    公开(公告)号:US20150324491A1

    公开(公告)日:2015-11-12

    申请号:US14707869

    申请日:2015-05-08

    申请人: AUTODESK, Inc

    IPC分类号: G06F17/50 G06F9/45

    摘要: A computing device for receiving a design problem statement describing a design problem in a controlled natural language (CNL) that defines permitted lexicons and syntax structures. The design problem statement is processed using the CNL lexicons and syntax structures to produce a job description executable by a design application for generating a design solution for the design problem statement. An improved CNL user interface that assists users to produce valid design problem statements that are CNL-compliant. The CNL user interface receives user-selectable terms that are compliant with the CNL lexicons and generates candidate problem statements that are compliant with CNL syntax structures and receives a selection of a candidate problem statement that is added to the design problem statement. A graphical user interface may display a graphical representation of a design problem statement that can be directly modified. A dialogue-based design process to explore possible design intentions and design solutions.

    摘要翻译: 一种用于接收描述受限自然语言(CNL)中的设计问题的设计问题陈述的计算设备,其定义允许的词典和语法结构。 使用CNL词典和语法结构处理设计问题语句,以生成可由设计应用程序执行的作业描述,以生成设计问题语句的设计解决方案。 改进的CNL用户界面,帮助用户生成符合CNL的有效设计问题语句。 CNL用户界面接收符合CNL词典的用户可选项,并生成符合CNL语法结构的候选问题语句,并接收添加到设计问题语句中的候选问题语句的选择。 图形用户界面可以显示可直接修改的设计问题语句的图形表示。 一个基于对话的设计过程,探讨可能的设计意图和设计方案。

    METHOD, A COMPUTER PROGRAM AND APPARATUS FOR ANALYZING SYMBOLS IN A COMPUTER
    42.
    发明申请
    METHOD, A COMPUTER PROGRAM AND APPARATUS FOR ANALYZING SYMBOLS IN A COMPUTER 有权
    方法,计算机程序和计算机中分析符号的设备

    公开(公告)号:US20150121508A1

    公开(公告)日:2015-04-30

    申请号:US14564006

    申请日:2014-12-08

    IPC分类号: G06F21/31 G06F21/55

    摘要: The invention provides a computer-implemented method of analyzing symbols in a computer system, the symbols conforming to a specification for the symbols, in which the specification has been codified into a set of computer-readable rules; and, the symbols analyzed using the computer-readable rules to obtain patterns of the symbols by determining the path that is taken by the symbols through the rules that successfully terminates, and grouping the symbols according to said paths, the method comprising; upon receipt of a message at a computer, performing a lexical analysis of the message; and, in dependence on lexical analysis of the message assigning the message to one of the groups identified according to said paths. The invention also provides a computer programmed to perform the method and a computer program comprising program instructions for causing a computer to perform the method.

    摘要翻译: 本发明提供一种计算机实现的方法,用于分析计算机系统中的符号,符合符号规范的符号,其中该规范已被编码成一组计算机可读规则; 以及使用计算机可读规则分析的符号,以通过确定由符号通过成功终止的规则获得的路径以及根据所述路径对符号进行分组以获得符号的模式,所述方法包括: 在计算机上收到消息后,执行消息的词汇分析; 并且依赖于将消息分配给根据所述路径识别的组之一的消息的词汇分析。 本发明还提供了一种编程为执行该方法的计算机和包括使计算机执行该方法的程序指令的计算机程序。

    Compiler and Method for Global-Scope Basic-Block Reordering
    43.
    发明申请
    Compiler and Method for Global-Scope Basic-Block Reordering 有权
    全局范围基本块重排序的编译器和方法

    公开(公告)号:US20150040106A1

    公开(公告)日:2015-02-05

    申请号:US14445983

    申请日:2014-07-29

    IPC分类号: G06F9/45 G06F11/36

    摘要: An embodiment method of global scope basic-block reordering includes profiling an application having a source code decomposable into a plurality of basic-blocks. The profiling yields a global basic-block sequence. The method also includes generating a hierarchical locality model according to the global basic-block sequence. The method also includes generating a target code according to the hierarchical locality model.

    摘要翻译: 全局范围基本块重排序的实施方式包括对具有可分解成多个基本块的源代码的应用进行分析。 剖析产生全局基本块序列。 该方法还包括根据全局基本块序列生成分层局部性模型。 该方法还包括根据分层局部模型生成目标代码。

    SYSTEM AND METHOD FOR COMPILING LAMBDA EXPRESSION IN A PROGRAMMING LANGUAGE ENVIRONMENT
    44.
    发明申请
    SYSTEM AND METHOD FOR COMPILING LAMBDA EXPRESSION IN A PROGRAMMING LANGUAGE ENVIRONMENT 有权
    在编程语言环境中编译LAMBDA表达的系统和方法

    公开(公告)号:US20140019948A1

    公开(公告)日:2014-01-16

    申请号:US13779557

    申请日:2013-02-27

    IPC分类号: G06F9/45

    摘要: A system and method can support context-dependent expression compilation in a programming language environment. A compiler in the programming language environment can provide one or more context objects that operate to compile various context-dependent expressions in different programming contexts. Then, the compiler can use a said context object to derive a target type associated with a context-dependent expression, and use the context object to perform compatibility check for the context-dependent expression in the programming language environment.

    摘要翻译: 系统和方法可以在编程语言环境中支持上下文相关的表达式编译。 编程语言环境中的编译器可以提供一个或多个上下文对象,用于在不同的编程环境中编译各种与上下文相关的表达式。 然后,编译器可以使用所述上下文对象来导出与上下文相关表达式相关联的目标类型,并使用上下文对象对编程语言环境中的上下文相关表达式执行兼容性检查。

    Program operators for composing abstractions
    45.
    发明授权
    Program operators for composing abstractions 失效
    组合抽象的程序运算符

    公开(公告)号:US07146604B2

    公开(公告)日:2006-12-05

    申请号:US10248286

    申请日:2003-01-06

    IPC分类号: G06F9/45

    CPC分类号: G06F8/425

    摘要: Programming abstractions with at least one expression are composed to a single abstraction using a composition operator. Expressions from the abstractions are unfolded by removing the prefix of each abstraction and substituting formal parameter names in each expression with a common parameter name to define open variables. The unfolded expressions are transformed to a reduced expression using a composition pattern that tunes semantics of the composition operators. The reduced expression is nested in the single abstraction by: appending a selected prefix of the composed abstraction to the reduced expression, binding the open variables of the reduced expression to the formal parameter of the selected prefix, and computing the type of the formal parameter of the selected prefix.

    摘要翻译: 使用至少一个表达式编程抽象使用组合运算符组成单个抽象。 通过删除每个抽象的前缀并用具有公共参数名称的每个表达式中的形式参数名称来定义开放变量来展开摘要的表达式。 使用调整组合运算符语义的组合模式将展开的表达式转换为缩减表达式。 简化的表达式嵌套在单个抽象中:将所选组合抽象的所选前缀附加到缩写表达式,将缩减表达式的打开变量绑定到所选前缀的形式参数,并计算形式参数的类型 所选的前缀。

    Grammer for regular expressions
    46.
    发明申请
    Grammer for regular expressions 有权
    正则表达式的格式

    公开(公告)号:US20040225999A1

    公开(公告)日:2004-11-11

    申请号:US10691414

    申请日:2003-10-22

    发明人: Andrew Nuss

    IPC分类号: G06F009/44

    摘要: The grammar of this invention is an approach to regular expressions which introduces advantages to programmers who use regular expressions for scanning, searching, and tokenizing text: Allowing composition of regular expressions (patterns) through the standard C/Cnullnull operators (using C/Cnullnull precedence and associativity), thus appealing to a huge audience of programmers already familiar with that style of grammar. Generalizing the negated character-class (so familiar to Perl programmers) in a way that quite dramatically allows ANY pattern composition to be used for searching (the nullsubjunctivenull binary composition). Integrating into an elegantly simple grammar form (nulldo-patternnull) the ability to create arbitrary side-effects of tokenization, accomplished in prior art through a cumbersome combination of tokenizing expressions and parse trees, such as in the grammar style of Lex-Yacc. Generalizing the capture-to-variable feature (as seen in Perl), allowing the capture of portions of the stream (match sub-expressions) into any variable current in the scope of the regular-expression. Allowing the parameterization of production rules, as templates, which allow similar (in form) regular expressions to be written as multiple instantiations of the same production rule template (accomplished via in params). Further allowing parameterization of production rule templates to extend to the capture output of the expressions (accomplished via a combination of nulldo-patternsnull, nullcapture-patternsnull, and out or in/out params). Creating novel support algorithms (to accomplish the above) not seen in any texts on finite automata.

    摘要翻译: 本发明的语法是对正则表达式的方法,它为使用正则表达式扫描,搜索和标记文本的程序员带来了优势:允许通过标准C / C ++运算符组合正则表达式(模式)(使用C / C ++优先级 和联想),从而吸引已经熟悉这种语法风格的程序员的大量受众。 以非常显着地允许任何模式组合用于搜索(“subjunctive”二进制组合))的方式来概括否定角色类(Perl程序员熟悉)。 整合成一个优雅简单的语法形式(“do-pattern”)创建任意的令牌化副作用的能力,在现有技术中通过令牌化表达式和解析树的麻烦组合完成,如Lex-Yacc的语法风格 。 对捕获到变量特征进行泛化(如Perl所示),允许将流的一部分(匹配子表达式)捕获到正则表达式范围内的任何变量电流。 允许生产规则的参数化,作为模板,允许将类似的(在形式中)正则表达式写为同一生产规则模板的多个实例(通过参数完成)。 进一步允许生产规则模板的参数化扩展到表达式的捕获输出(通过“do-patterns”,“capture-patterns”,out或in / out参数的组合完成)。 在有限自动机的任何文本中创建新的支持算法(完成上述)。

    Method and system for representing a high-level programming language data structure in a mark-up language
    47.
    发明授权
    Method and system for representing a high-level programming language data structure in a mark-up language 有权
    用于以标记语言表示高级编程语言数据结构的方法和系统

    公开(公告)号:US06594823B1

    公开(公告)日:2003-07-15

    申请号:US09660791

    申请日:2000-09-13

    IPC分类号: G06F945

    CPC分类号: G06F8/425

    摘要: A novel method and system for representing a high-level programming language data structure in a mark-up language is provided, in which each variable of data structure is represented as a mark-up language element. The nesting of the elements represents the hierarchical relationship among the variables. Each element includes the name of the variable represented by the element and the type of the variable. The variable name may be included as the tag name, and the variable type may be included as an attribute. Additionally, a default value for the variable may be included as an attribute. Finally, comments to be included in the resulting high-level language source code may be represented in the body of the element.

    摘要翻译: 提供了一种用于以标记语言表示高级编程语言数据结构的新颖方法和系统,其中数据结构的每个变量被表示为标记语言元素。 元素的嵌套表示变量之间的层次关系。 每个元素包括由元素表示的变量的名称和变量的类型。 可以将变量名称包括为标签名称,并且可以将变量类型包括为属性。 此外,可以包括变量的默认值作为属性。 最后,要包含在最终的高级语言源代码中的注释可以在元素的正文中表示。

    Source code line counting system and method
    48.
    发明申请
    Source code line counting system and method 审中-公开
    源代码行计数系统和方法

    公开(公告)号:US20030009744A1

    公开(公告)日:2003-01-09

    申请号:US09899868

    申请日:2001-07-05

    IPC分类号: G06F009/44

    CPC分类号: G06F8/423 G06F8/425 G06F8/427

    摘要: One aspect of the invention is a method of counting lines of source code. One of a plurality of sets of configuration data is selected wherein each set of the plurality of sets of configuration data is associated with at least one computer language. Collectively the plurality of sets of configuration data are associated with a plurality of computer languages and the selected set of configuration data comprises the keywords for a first computer language. A first file is parsed wherein the first file contains computer source code written in the first computer language to create a first token stream in response to the selected set of configuration data. A first list of statements is created in response to the first token stream and a count value is generated in response to the first list of statements.

    摘要翻译: 本发明的一个方面是计算源代码行的方法。 选择多组配置数据中的一组,其中多组配置数据中的每一组与至少一种计算机语言相关联。 集合地,多组配置数据与多种计算机语言相关联,并且所选择的一组配置数据包括用于第一计算机语言的关键字。 解析第一文件,其中第一文件包含以第一计算机语言编写的计算机源代码,以响应于所选择的一组配置数据来创建第一令牌流。 响应于第一个令牌流创建第一个语句列表,并且响应于第一个语句列表生成计数值。

    Selective expansion of high-level design language macros for automated design modification
    49.
    发明申请
    Selective expansion of high-level design language macros for automated design modification 审中-公开
    高级设计语言宏的选择性扩展用于自动设计修改

    公开(公告)号:US20020129341A1

    公开(公告)日:2002-09-12

    申请号:US09753279

    申请日:2000-12-30

    发明人: Gregory Hibdon

    IPC分类号: G06F009/45

    摘要: A method and apparatus are described for selective expansion of HDL macros for automated design modification. According to one embodiment of the present invention, the selective expansion of HDL macros allows for insertion of scan cells for selected signals into HDL design files comprising a hardware design while making the modified file look as much as possible like the designer's original HDL file by using an nullas ifnull approach to parsing HDL design macros, using multifaceted parser tokens, and using a three-tiered token list. In order to make the modified file look as much as possible like the designer's original HDL file all text except the required changes are preserved from the original file. To accomplish this, the parsing program used by the HDL scan insertion tool creates lists of tokens that record everything including spaces, tabs, and comments. Then to perform the modifications to the HDL, the token lists, representing nulllinesnull from the HDL file, are modified before they are written back out as the updated scan inserted HDL file.

    摘要翻译: 描述了用于选择性扩展用于自动设计修改的HDL宏的方法和装置。 根据本发明的一个实施例,HDL宏的选择性扩展允许将选定信号的扫描单元插入包括硬件设计的HDL设计文件中,同时通过使用设计者的原始HDL文件尽可能多地使修改的文件看起来像设计者的原始HDL文件 解析HDL设计宏的“as if”方法,使用多方面的解析器令牌,并使用三层令牌列表。 为了使修改后的文件看起来像设计师的原始HDL文件一样,所有文本除了所需的更改都将保留原始文件。 为了实现这一点,HDL扫描插入工具使用的解析程序创建了记录包括空格,制表符和注释在内的所有内容的令牌列表。 然后执行对HDL的修改,代表HDL文件中的“行”的令牌列表在更新后的扫描插入HDL文件之前被修改。

    Distributed processing for control of a telecommunications network
    50.
    发明授权
    Distributed processing for control of a telecommunications network 失效
    用于电信网络控制的分布式处理

    公开(公告)号:US06343374B1

    公开(公告)日:2002-01-29

    申请号:US09029573

    申请日:1998-03-06

    申请人: Paul A Martin

    发明人: Paul A Martin

    IPC分类号: G06F945

    CPC分类号: G06F8/425

    摘要: A compiler for a distributed object system in which functional requirements on system performance criteria can be entered as comments fields in an object oriented language (e.g. C++) which are ignored by a conventional compiler (to allow compilation of a single processor version of the program for debugging) but are interpreted by a pre-compiler to take into account system data when compiling code for the host computers of the distributed system. The system may be a telecommunications system.

    摘要翻译: 一种用于分布式对象系统的编译器,其中可以输入系统性能标准的功能需求作为面向对象语言(例如C ++)的注释字段,这些语言由传统编译器忽略(允许编译程序的单个处理器版本 调试),但是在编译分布式系统的主机的代码时,由预编译器解释以考虑系统数据。 该系统可以是电信系统。