StmtTree: An Easy-to-Use yet Versatile Fortran Transformation Toolkit

• URL: http://arxiv.org/abs/2407.05652v2
• Date: Sun, 21 Jul 2024 02:22:44 GMT
• Title: StmtTree: An Easy-to-Use yet Versatile Fortran Transformation Toolkit
• Authors: Jingbo Lin, Yi Yu, Zhang Yang, Yafan Zhao,
• Abstract summary: We present StmtTree, a new Fortran code transformation toolkit to address this issue. StmtTree abstracts the Fortran grammar into statement tree, offering both a low-level representation manipulation API and a high-level, easy-to-use query and manipulation mini-language. Experiments show that StmtTree adapts well to legacy Fortran-77 codes, and complex tools such as removing unused statements can be developed with fewer than 100 lines of python code.
• Score: 7.477012296839271
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The Fortran programming language continues to dominate the scientific computing community, with many production codes written in the outdated Fortran-77 dialect, yet with many non-standard extensions such as Cray poiters. This creates significant maintenance burden within the community, with tremendous efforts devoted to modernization. However, despite the modern age of advanced compiler frameworks, processing and transforming old Fortran codes remains challenging. In this paper, we present StmtTree, a new Fortran code transformation toolkit to address this issue. StmtTree abstracts the Fortran grammar into statement tree, offering both a low-level representation manipulation API and a high-level, easy-to-use query and manipulation mini-language. StmtTree simplifies the creation of customized Fortran transformation tools. Experiments show that StmtTree adapts well to legacy Fortran-77 codes, and complex tools such as removing unused statements can be developed with fewer than 100 lines of python code.

Related papers

• Neuro-Symbolic Query Compiler [57.78201019000895]
  This paper presents QCompiler, a neuro-symbolic framework inspired by linguistic grammar rules and compiler design, to bridge this gap.<n>It theoretically designs a minimal yet sufficient Backus-Naur Form (BNF) grammar $G[q]$ to formalize complex queries.<n>The atomicity of the sub-queries in the leaf ensures more precise document retrieval and response generation, significantly improving the RAG system's ability to address complex queries.
  arXiv  Detail & Related papers  (2025-05-17T09:36:03Z)
• Sneaking Syntax into Transformer Language Models with Tree Regularization [33.74552367356904]
  Introducing syntactic inductive biases could unlock more robust and data-efficient learning in transformer language models. We introduce TreeReg, an auxiliary loss function that converts bracketing decisions from silver parses into a set of differentiableity constraints. TreeReg integrates seamlessly with the standard LM objective, requiring no architectural changes.
  arXiv  Detail & Related papers  (2024-11-28T03:27:48Z)
• Leveraging Large Language Models for Code Translation and Software Development in Scientific Computing [0.9668407688201359]
  generative artificial intelligence (GenAI) is poised to transform productivity in scientific computing. We developed a tool, CodeScribe, which combines prompt engineering with user supervision to establish an efficient process for code conversion. We also address the challenges of AI-driven code translation and highlight its benefits for enhancing productivity in scientific computing.
  arXiv  Detail & Related papers  (2024-10-31T16:48:41Z)
• CodeGRAG: Bridging the Gap between Natural Language and Programming Language via Graphical Retrieval Augmented Generation [58.84212778960507]
  We propose CodeGRAG, a Graphical Retrieval Augmented Code Generation framework to enhance the performance of LLMs. CodeGRAG builds the graphical view of code blocks based on the control flow and data flow of them to fill the gap between programming languages and natural language. Various experiments and ablations are done on four datasets including both the C++ and python languages to validate the hard meta-graph prompt, the soft prompting technique, and the effectiveness of the objectives for pretrained GNN expert.
  arXiv  Detail & Related papers  (2024-05-03T02:48:55Z)
• Automatic Generation of Python Programs Using Context-Free Grammars [0.1227734309612871]
  TinyPy Generator is a tool that generates random Python programs using a context-free grammar. Our system uses custom production rules to generate code with different levels of complexity. TinyPy Generator is useful in the field of machine learning, where it can generate substantial amounts of Python code for training Python language models.
  arXiv  Detail & Related papers  (2024-03-11T08:25:52Z)
• Guess & Sketch: Language Model Guided Transpilation [59.02147255276078]
  Learned transpilation offers an alternative to manual re-writing and engineering efforts. Probabilistic neural language models (LMs) produce plausible outputs for every input, but do so at the cost of guaranteed correctness. Guess & Sketch extracts alignment and confidence information from features of the LM then passes it to a symbolic solver to resolve semantic equivalence.
  arXiv  Detail & Related papers  (2023-09-25T15:42:18Z)
• Parsing Fortran-77 with proprietary extensions [0.0]
  Many organizations still rely on old code written in "obsolete" programming languages. One difficulty of working with these "veteran languages" is being able to parse the source code to build a representation of it.
  arXiv  Detail & Related papers  (2023-09-05T07:54:02Z)
• COMEX: A Tool for Generating Customized Source Code Representations [7.151800146054561]
  COMEX is a framework that allows researchers and developers to create and combine multiple code-views. It can analyze both method-level snippets and program-level snippets by using both intra-procedural and inter-procedural snippets. It is built on tree-sitter - a widely used incremental analysis tool that supports over 40 languages.
  arXiv  Detail & Related papers  (2023-07-10T16:46:34Z)
• Outline, Then Details: Syntactically Guided Coarse-To-Fine Code Generation [61.50286000143233]
  ChainCoder is a program synthesis language model that generates Python code progressively. A tailored transformer architecture is leveraged to jointly encode the natural language descriptions and syntactically aligned I/O data samples.
  arXiv  Detail & Related papers  (2023-04-28T01:47:09Z)
• Structure-Unified M-Tree Coding Solver for MathWord Problem [57.825176412485504]
  In previous work, models designed by taking into account the properties of the binary tree structure of mathematical expressions at the output side have achieved better performance. In this paper, we propose the Structure-Unified M-Tree Coding Coding (S-UMCr), which applies a tree with any M branches (M-tree) to unify the output structures. Experimental results on the widely used MAWPS and Math23K datasets have demonstrated that SUMC-r not only outperforms several state-of-the-art models but also performs much better under low-resource conditions.
  arXiv  Detail & Related papers  (2022-10-22T12:20:36Z)
• Incorporating Constituent Syntax for Coreference Resolution [50.71868417008133]
  We propose a graph-based method to incorporate constituent syntactic structures. We also explore to utilise higher-order neighbourhood information to encode rich structures in constituent trees. Experiments on the English and Chinese portions of OntoNotes 5.0 benchmark show that our proposed model either beats a strong baseline or achieves new state-of-the-art performance.
  arXiv  Detail & Related papers  (2022-02-22T07:40:42Z)
• Toward Modern Fortran Tooling and a Thriving Developer Community [0.0]
  Fortran is the oldest high-level programming language that remains in use today. It is one of the dominant languages used for compute-intensive scientific and engineering applications. In this paper we report on the progress to date and outline the next steps.
  arXiv  Detail & Related papers  (2021-09-15T15:43:06Z)
• Recursive Top-Down Production for Sentence Generation with Latent Trees [77.56794870399288]
  We model the production property of context-free grammars for natural and synthetic languages. We present a dynamic programming algorithm that marginalises over latent binary tree structures with $N$ leaves. We also present experimental results on German-English translation on the Multi30k dataset.
  arXiv  Detail & Related papers  (2020-10-09T17:47:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.