Google Inc.

Bruce Chandler Carruth

Manuel Victor Klimek

Jeffrey Van Gogh

Stephen Francis Yegge

Zhanyong Wan

Michael Forster

Ronald Aaron Braunstein

Ulf Adams

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 build system and method, including receiving attribute rules and new rules, wherein the attribute rules correspond to one or more predefined default actions of the build system, wherein the new rules specify new actions that are to be added to the build system. A graph is generated to include files specified as attributes in the attributes rules and the one or more predefined default actions that correspond to the attributes rules. A request to enable at least one of the new rules is received. Action listener rules are received, wherein the action listener rules indicate default actions and corresponding new rules of the one or more new rules. The graph is checked for default actions that are indicated in the action listener rules. Additional actions are added to the graph for new rules based on the default actions indicated in the action listener rules.

Systems and methods for rule based meta-programming of actions for rule based build systems

Growing community of inventors

Santa Clara, CA, United States of America

Bruce Chandler Carruth