Precise and Scalable Querying of Syntactical Source Code Patterns Using Sample Code Snippets and a Database

Abstract

While analyzing a log file of a text-based source code search engine we discovered that developers search for fine-grained syntactical patterns in 36% of queries. Currently, to cope with queries of this kind developers need to use regular expressions, to add redundant terms to the query or to combine searching with other tools provided by the development environment. To improve the expressiveness of the queries, these can be formulated as tree patterns of abstract syntax trees. These search patterns can be expressed by using query languages, such as XPath. However, developers usually do not work with either XPath or with AST. To shield developers from the complexity of query formulation we propose using sample code snippets as queries. The novelty of our approach is the combination of a query language that is very close to the surface programming language and a special database technology to store a large amount of abstract syntax trees. The advantage of this approach over existing source code query languages and search engines is the performance of both query formulation and query execution. This paper describes the technical details of the method and illustrates the value of this approach with performance measures and an industrial controlled experiment. All developers were able to complete the tasks of the experiment faster and more accurately by using our tool (ACS) than by using a text-based search engine. The number of false positives in the result lists was significantly decreased.

Hercules/Pl

“…A pattern for matching Java for the typecasting of an expression and the assignment of the result to a variable is shown in Table 1-(f). In [13], the query-by-example approach is presented, which suggests the exploitation of source code 1 http://coccinelle.lip6.fr/ 01 void mypattern() { 02 int k, *array; 03 #pragma hercules pattern declare "test"(statement "F", symbol "W") 04 #pragma hercules symbol "array" bind "W" 05 #pragma hercules symbol promote(expression) 06 int expr1,expr2; 07 08 #pragma hercules statement bind "F" +"parallel"() 09…”

Towards a Marketplace of Open Source Software Data

“…Like in our approach, the source code is extracted from repositories and afterwards transformed to OWL ontologies. A framework for querying for source code based on sample code snippets is presented in [26]. Query snippets are transformed to XPath queries.…”