Google Inc.

Zhanyong Wan

Craig Silverstein

Manuel Victor Klimek

Bruce Chandler Carruth

A matching library of a code analysis system defines a number of predicates applicable to an abstract syntax tree (AST) corresponding to program code being analyzed. The predicates represent whether or not nodes of the program code's AST have corresponding properties, such as representing a class that inherits from another given class. The code analysis system obtains an AST to analyze, a predicate expression query that includes predicates of the matching library, and action code. The code analysis system identifies nodes of the AST that match the predicate expression query by executing code of the matching library and executes the action code against the identified nodes.

Predicate matching library for complex program analysis

A system and machine-implemented method modifying a source code file to reduce dependencies included therein. The source code file is parsed to identify a symbol within the source code file, and one or more header files are identified, each of which is capable of resolving the symbol for the source code file. A header file is selected from the one or more header files for inclusion in the source code file, based on a predetermined set of rules. The source code file is modified to include the selected header file.

Growing community of inventors

Kirkland, WA, United States of America

Zhanyong Wan