document: This paper presents general results on the Java source code snippet detection problem. We propose the tool which uses graph and subgraph isomorphism detection. A number of solutions for all of these tasks have been proposed in the literature. However, although that all these solutions are really fast, they compare just the constant static trees. Our solution offers to enter an input sample dynamically with the Scripthon language while preserving an acceptable speed. We used several optimizations to achieve very low number of comparisons during the matching algorithm.
doc_bio_tags: O O O O O O O B I I I I O O O O O O O B I I I I O O O O O O O O O O O O O O O O O O O O O O O O O B I I I I I O O O O B I I I I O O B I O B I I I O O B I O O O O O O B O O B I
extractive_keyphrases: compare just the constant static trees comparisons enter an input sample dynamically graph and subgraph isomorphism detection java source code snippet detection matching algorithm preserving an acceptable speed scripthon language several optimizations