Metraipolis › archive › dc_7d2dcdb077ca

AST-Based Automated Elimination of break and continue Statements in Java Code — arXiv:2609.27627

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.27627
License (as archived): CC0-1.0
Archived: 2026-10-08T11:06:26.920Z
SHA-256 of the archived text: 1fe895d24349b5a446309d1d86c7931b5d5e946801e49165b5e1ebce9c309777
Stable URL of this page: https://metraipolis.com/documento/dc_7d2dcdb077ca

How to cite

AST-Based Automated Elimination of break and continue Statements in Java Code — arXiv:2609.27627 — arXiv (en), https://arxiv.org/abs/2609.27627 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7d2dcdb077ca (Metraipolis archive dc_7d2dcdb077ca, sha256 1fe895d24349b5a446309d1d86c7931b5d5e946801e49165b5e1ebce9c309777)

BibTeX

@misc{dc7d2dcdb077ca,
  title = {AST-Based Automated Elimination of break and continue Statements in Java Code — arXiv:2609.27627},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.27627},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7d2dcdb077ca; sha256 1fe895d24349b5a446309d1d86c7931b5d5e946801e49165b5e1ebce9c309777},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27627. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This work presents the development of an automatic refactoring tool for Java code built on top of the Eclipse JDT API. The proposed approach transforms control structures containing break and continue statements within different types of loops into semantically equivalent constructs that avoid their explicit use. To achieve this, auxiliary boolean variables are introduced to restructure the control flow while preserving the original program behavior. The main objective of this transformation is to improve code structure and enable the application of subsequent automated refactorings, particularly those based on the Extract Method operation, which are typically restricted by the presence of jump statements. The implementation relies on the analysis and rewriting of the Abstract Syntax Tree (AST), ensuring semantic equivalence in all addressed scenarios. The tool was validated through 54 manually designed test cases and 151 units tests, all of which produced satisfactory results. In addition, it was applied to 139 methods from seven open-source projects, generating code without compilation errors and preserving the original behavior as verified by the projects' test suites. The results demonstrate that the proposed approach safely automates the restructuring of code containing break and continue statements, facilitating further evolution and structural analysis.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-24 in cs.SE).
Categorie arXiv: Software Engineering (cs.SE).
Pagina del lavoro: https://arxiv.org/abs/2609.27627 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T10:13:35.112Z dalla pagina https://arxiv.org/catchup/cs.SE/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).