Academic Journal
МЕТОД АНАЛІЗУ ТА ТРАНСФОРМАЦІЇ СИНТАКСИЧНИХ ДЕРЕВ.
| Τίτλος: | МЕТОД АНАЛІЗУ ТА ТРАНСФОРМАЦІЇ СИНТАКСИЧНИХ ДЕРЕВ. (Ukrainian) |
|---|---|
| Alternate Title: | METHOD OF ANALYSIS AND TRANSFORMATION OF SYNTAX TREES. (English) |
| Συγγραφείς: | Касянчук, Д. П. |
| Πηγή: | Automation of Technological & Business Processes / Avtomatizaciâ Tehnologiceskih i Biznes-Processov; 2026, Vol. 18 Issue 1, p46-55, 10p |
| Θεματικοί όροι: | Program transformation, Compilers (Computer programs), Program generators (Computer programs), Domain-specific programming languages, Flowgraphs, Data structures |
| Περίληψη: | Analysis and transformation of abstract syntax trees are key tasks in the development of compilers, static analyzers, and automated refactoring tools. Developers choosing Clojure for these tasks face the lack of a comprehensive built-in system for complex code analysis. The use of external tools poses significant integration challenges, as analysis and transformation processes are executed outside the main software system, complicating data sharing. Meanwhile, existing built-in solutions force developers to work at a low abstraction level or create a «declarative-imperative gap» where search is declarative, but the generation of new trees remains imperative. To address this issue, this paper proposes a method implemented as an embedded domain-specific language named DALT. The core of the method lies in the structural transformation of program code based on the mechanism of concrete syntax quasiquoting. This approach allows manipulating text templates that visually correspond to the target language code, rather than operating directly on syntax tree objects. A key feature of the method is the unification of analysis and synthesis processes: the proposed template mechanism is used to represent syntax trees both in pattern matching operations and for generating new structures. The paper also describes the developed declarative tools for matching, recursive rewriting, and tree synthesis. Particular attention is given to a flexible traversal strategy control mechanism, which allows combining rules with topdown and bottom-up semantics within a single transformation process. The effectiveness of the method is experimentally validated on the task of constructing control flow graphs for Java programs. Comparative analysis demonstrated that the application of DALT significantly reduced the code volume compared to an imperative implementation. [ABSTRACT FROM AUTHOR] |
| Copyright of Automation of Technological & Business Processes / Avtomatizaciâ Tehnologiceskih i Biznes-Processov is the property of Odesa National University of Technology and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Complementary Index |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:edb&genre=article&issn=23123125&ISBN=&volume=18&issue=1&date=20260101&spage=46&pages=46-55&title=Automation of Technological & Business Processes / Avtomatizaciâ Tehnologiceskih i Biznes-Processov&atitle=%D0%9C%D0%95%D0%A2%D0%9E%D0%94%20%D0%90%D0%9D%D0%90%D0%9B%D0%86%D0%97%D0%A3%20%D0%A2%D0%90%20%D0%A2%D0%A0%D0%90%D0%9D%D0%A1%D0%A4%D0%9E%D0%A0%D0%9C%D0%90%D0%A6%D0%86%D0%87%20%D0%A1%D0%98%D0%9D%D0%A2%D0%90%D0%9A%D0%A1%D0%98%D0%A7%D0%9D%D0%98%D0%A5%20%D0%94%D0%95%D0%A0%D0%95%D0%92.&aulast=%D0%9A%D0%B0%D1%81%D1%8F%D0%BD%D1%87%D1%83%D0%BA%2C%20%D0%94.%20%D0%9F.&id=DOI:10.15673/atbp.v18i1.3430 Name: Full Text Finder (for New FTF UI) (ns324271) Category: fullText Text: Full Text Finder MouseOverText: Full Text Finder |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 193962417 RelevancyScore: 1041 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1041.06604003906 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: МЕТОД АНАЛІЗУ ТА ТРАНСФОРМАЦІЇ СИНТАКСИЧНИХ ДЕРЕВ. (Ukrainian) – Name: TitleAlt Label: Alternate Title Group: TiAlt Data: METHOD OF ANALYSIS AND TRANSFORMATION OF SYNTAX TREES. (English) – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Касянчук%2C+Д%2E+П%2E%22">Касянчук, Д. П.</searchLink> – Name: TitleSource Label: Source Group: Src Data: Automation of Technological & Business Processes / Avtomatizaciâ Tehnologiceskih i Biznes-Processov; 2026, Vol. 18 Issue 1, p46-55, 10p – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Program+transformation%22">Program transformation</searchLink><br /><searchLink fieldCode="DE" term="%22Compilers+%28Computer+programs%29%22">Compilers (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Program+generators+%28Computer+programs%29%22">Program generators (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Domain-specific+programming+languages%22">Domain-specific programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Flowgraphs%22">Flowgraphs</searchLink><br /><searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Analysis and transformation of abstract syntax trees are key tasks in the development of compilers, static analyzers, and automated refactoring tools. Developers choosing Clojure for these tasks face the lack of a comprehensive built-in system for complex code analysis. The use of external tools poses significant integration challenges, as analysis and transformation processes are executed outside the main software system, complicating data sharing. Meanwhile, existing built-in solutions force developers to work at a low abstraction level or create a «declarative-imperative gap» where search is declarative, but the generation of new trees remains imperative. To address this issue, this paper proposes a method implemented as an embedded domain-specific language named DALT. The core of the method lies in the structural transformation of program code based on the mechanism of concrete syntax quasiquoting. This approach allows manipulating text templates that visually correspond to the target language code, rather than operating directly on syntax tree objects. A key feature of the method is the unification of analysis and synthesis processes: the proposed template mechanism is used to represent syntax trees both in pattern matching operations and for generating new structures. The paper also describes the developed declarative tools for matching, recursive rewriting, and tree synthesis. Particular attention is given to a flexible traversal strategy control mechanism, which allows combining rules with topdown and bottom-up semantics within a single transformation process. The effectiveness of the method is experimentally validated on the task of constructing control flow graphs for Java programs. Comparative analysis demonstrated that the application of DALT significantly reduced the code volume compared to an imperative implementation. [ABSTRACT FROM AUTHOR] – Name: Abstract Label: Group: Ab Data: <i>Copyright of Automation of Technological & Business Processes / Avtomatizaciâ Tehnologiceskih i Biznes-Processov is the property of Odesa National University of Technology and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=193962417 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.15673/atbp.v18i1.3430 Languages: – Code: ukr Text: Ukrainian PhysicalDescription: Pagination: PageCount: 10 StartPage: 46 Subjects: – SubjectFull: Program transformation Type: general – SubjectFull: Compilers (Computer programs) Type: general – SubjectFull: Program generators (Computer programs) Type: general – SubjectFull: Domain-specific programming languages Type: general – SubjectFull: Flowgraphs Type: general – SubjectFull: Data structures Type: general Titles: – TitleFull: МЕТОД АНАЛІЗУ ТА ТРАНСФОРМАЦІЇ СИНТАКСИЧНИХ ДЕРЕВ. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Касянчук, Д. П. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: 2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 23123125 Numbering: – Type: volume Value: 18 – Type: issue Value: 1 Titles: – TitleFull: Automation of Technological & Business Processes / Avtomatizaciâ Tehnologiceskih i Biznes-Processov Type: main |
| ResultId | 1 |