# Exploring the Generality of a Java-based Loop Action Model for the Quorum Programming Language

## TL;DR

This paper investigates whether a Java-based loop action identification model can be effectively applied to the Quorum programming language by analyzing loop characteristics to determine high-level actions, with promising initial results.

## Contribution

It demonstrates the potential of transferring a Java loop action model to Quorum, enabling automatic high-level action identification in less documented code.

## Key findings

- Model successfully identifies loop actions in Quorum source code.
- Approach shows potential for application to other programming languages.
- Results indicate effective transferability of the Java-based model.

## Abstract

Many algorithmic steps require more than one statement to implement, but not big enough to be a method (e.g., add element, find the maximum, determine a value, etc.). These steps are generally implemented by loops. Internal comments for the loops often describe these intermediary steps, however, unfortunately a very small percentage of code is well documented to help new users/coders. As a result, information at levels of abstraction between the individual statement and the whole method is not leveraged by current source code analyses, as that information is not easily available beyond any internal comments describing the code blocks. Hence, this project explores the generality of an approach to automatically determine the high level actions of loop constructs. The approach is to mine loop characteristics of a given loop structure over the repository of the Quorum language source code, map it to an (already developed for Java) action identification model, and thus identify the action performed by the specified loop. The results are promising enough to conclude that this approach could be applied to other programming languages too.