The Mathworks, Inc.

Steve Johnson

Mark Conrad Jones

William M McKeeman

Rob Purser

A method of dynamically analyzing source code for generating usage hints while editing the source code is disclosed. A parse tree data structure is generated for each function called. The incoming and outgoing arguments in the parse tree are identified. A user calls the function by entering arguments as part of the function-call. The user's input arguments are associated with the corresponding argument in the parse tree. Relevant preconditions and post-conditions of the nodes surrounding the current location in the parse tree are analyzed to provide usage hints for the completion of the function call. In the case of a completed function call argument entered by the user, the type and number of arguments in the completed function call are compared to the required type and number of arguments of the function to validate the function call. Error messages are provided in the event of an invalid call.

Method of providing interactive usage descriptions based on source code analysis

In one embodiment of the present invention, a method for concurrently constructing and testing a software program is provided. The method includes interacting with a program editor that allows a user to construct the program, and testing the program during construction of the program to produce a test result.

Integrating program construction

The present invention provides an encryption/decryption approach to protect valuable information from being represented in a clear-text form when an application processes the valuable information. The present invention processes a structured input file to create internal data structures and generates an encrypted output file from the extracted internal data structures. The encrypted file of internal data structures can be decrypted to enable further processing of the valuable information without representing the valuable information as clear-text in memory. Further, the decrypted internal data structures are stored at different locations in memory.

Encryption and decryption approach that prevents exposing clear-text in memory

Exemplary embodiments may provide one or more computer readable storage media storing executable instructions that when executed on processing logic output a source code listing and external content to an editor. The media may hold instructions for creating a source code listing in an editor, the source code listing being executable when the source code listing is compiled or interpreted. The media may further hold instructions for inserting a non-executable statement into the source code listing, the non-executable statement including metadata identifying external content. The media may hold instructions for interpreting the metadata. The media may further hold instructions for communicating with external content. The media may also hold instructions for outputting the source code listing and the external content to the editor. The media may further hold instructions for interacting with the external content from the source code listing.

Providing access to external content using metadata in source code listings

In an embodiment, code may be acquired that calls a first function defined to return a plurality of output arguments. The code may designate, with a designator, one or more output arguments, in the plurality of output argument, that are not present. Processing logic may generate a second function based at least on the designated one or more output arguments being designated as not present.

Generating code based at least on one or more output arguments designated as not being present

Exemplary embodiments may provide methods, systems and devices for providing non-literal representations of programming language code. The non-literal representation of a portion of code may provide a representation of the semantics of the portion of code that is different from the source code representation. The non-literal representation may change the way the code is output to a user in order to improve readability of the source code, and may not modify the underlying structure or semantics of the code. While improving readability of the code, the non-literal representation may also retain important information about the underlying code associated with the non-literal representation.

Non-literal representation of programming language code

Methods, systems and computer program products are provided for ignoring one or more output arguments of a function in a programming environment. Users or programmers may designate one or more output arguments that are not desired by the users. The called function determines which output arguments are designated by the users. The one or more output arguments designated by the users are ignored by the function. The called function may reclaim memory space for the output arguments designated by the users. The called function may also avoid operations for generating values for the output arguments designated by the users. The called function does not need to return values for the output arguments designated by the users.

Ignoring output arguments of functions in programming environments

Some embodiments of the invention provide methods, mediums, and systems for collecting and updating associated information. The present invention also provides a method and system for managing associated information in one file structure. Associated information can be generated from a source file or data and a portfolio can be generated to collect and store the source file or data and the associated information. A portfolio can include multiple folios storing different aspects of information that are related to one another. Each folio can associate information with aspects of other folios. When a change has occurred on a folio, an update strategy is used to update related folios and a map may be optionally generated. The map may provide information that allows dependent folios to understand what was changed. The map may remain in existence until all the dependent folios have adapted to the change. The invention provides a way to make it easy to associate information with one another and also provides a way to make sure associated information are updated accordingly when a change has occurred in the s related information.

Storing and maintaining consistency among folios holding associated information

A method of dynamically analyzing source code to generate usage hints for a user performing program editing is disclosed. The functions in a collection of source code being edited by a user are processed so as to generate a parse tree data structure for each function called. The incoming and outgoing arguments in the parse tree are identified. Subsequently, a user editing code calls the function and either completely or incompletely enters the arguments as part of the function called. Input arguments are identified and associated with the corresponding argument in the parse tree for the function. Relevant preconditions and post-conditions of the surrounding nodes corresponding to the current location are analyzed. Usage hints are provided for the completion of the function call. Arguments for a completed function call argument entered by the user are validated. Error messages are delivered in the event of an invalid call.

A method of operator overloading that enables a user of a program development environment to view both the structure of the operands of the operation being overloaded, and also the context in which the operator is being used is disclosed. The present invention utilizes a parse tree created by a language processor. The use of the parse tree, which may be represented as a class, allows the context information to be made available to a class designer. Objects of the parse tree class include methods designed to identify the operator at a root and to retrieve left and right trees. An assignment function is defined which uses two parse tree objects as arguments and performs an indicated mathematical operation based upon the context revealed by the parse tree objects. The assignment function may exist in more than one class and be overloaded. The overloading of the assignment function enables the context within which the mathematical operation is occurring to become visible and be acted upon.

System and method for providing context to operator overloading

The declaration of a variable of a new storage class from within a function creates a shared variable and a local variable. The shared variable may be a hidden (private) global variable and the local variable may be a hidden (private) local variable. The shared variable has a modified global scope and is callable only from within a function. The local variable is visible only from within the function in which it is defined. References to the variable from within a function result in the value of the shared variable being returned. The value of the shared variable is the value most recently assigned to the variable by an active caller of the function. Upon entering a function referencing the variable, the value of the shared variable is given to the local variable. When the function returns, the value of the local variable is assigned back to the shared variable.

Growing community of inventors

Sudbury, MA, United States of America

Steve Johnson