An algebra for program fragments
Abstract
Program fragments are described either by strings in the concrete syntax or by constructor applications in the abstract syntax. By defining conversions between these forms, both may be intermixed. Program fragments are constructed by terminal and nonterminal symbols from the grammar and by variables having program fragments as values. Basic operations such as valuetransfer, composition and decomposition are defined for program fragments allowing more complicated operations to be implemented. Usual operations such as testing for equality are defined, and in addition more specialized operations such as testing that a program fragment is derivable from another and converting program fragments in concrete form to abstract form are defined. By introducing regular expressions in the grammar these may be used in program fragments in concrete form. By defining constructors for regular expressions these may also be used in program fragments in abstract form.
References
[1]
B.B.Kristensen, O.L.Madsen, B.Møller-Pedersen, K.Nygaard: Syntax Directed Program Modularization. In: Interactive Computing Systems (ed. P. Degano, E.Sandewall), North-Holland, 1983.
[2]
B.B.Kristensen, O.L.Madsen, B.Møller-Pedersen, K.Nygaard: Abstraction Mechanisms in the BETA Programming Language. Proceedings of the Tenth ACM Symposium on Principles of Programming Languages, 1983.
[3]
B.B.Kristensen, O.L.Madsen, B.Møller-pedersen, K.Nygaard: Language Specification and Implementation based on the BETA Programming Language. Preliminary Version, *Aalborg University Centre, 1983.
[4]
B.B.Kristensen, O.L.Madsen, B.Møller-#Pedersen, K.Nygaard: Dynamic Exchange of BETA Systems. Preliminary Version, Stanford University, 1984.
[5]
B.B.Kristensen, O.L.Madsen, B.Møller-Pedersen, K. Nygaard: Multisequential Execution in the BETA Programming Language. To appear in SIGPLAN Notices, 1985.
[6]
R.D.Cameron, M. Robert Ito: Grammar-Based Definition of Metaprogramming Systems. ACM Transactions on Programming Languages and Systems, Vol.6, No. 1, 1984.
[7]
T.Teitelbaum, T.Reps: The Cornell Program Synthesizer: A Syntax-Directed Programming Environment. Communications of the ACM, Vol. 24, No. 9, 1981.
[8]
H.R.Lewis, C.H.Papadimitriou: Elements of the Theory of Computation. Prentice-Hall Inc., 1981.
[9]
V.Donzeau-Gouge, G.Huet, G.Kahn, B.Lang: Programming Environments Based on Structured Editors: The MENTOR Experience. In: Interactive Programming Environments (ed. D.R.Barstow, H.E.Shrobe, E.Sandewall), McGraw-Hill, 1984.
[10]
T.Reps, T.Teitelbaum: The Synthesizer Generator. Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, SIGPLAN Notices, Vol. 19, No. 5, 1984.
[11]
E.Sandewall: Programming in an Interactive Environment: The Lisp Experience. ACM Computing Surveys, 10:1, 1978.
[12]
B.A.Sheil: Power Tools for Programmers. Datamation Magazine, Technical Publishing Company, 1983.
[13]
W.Teitelman, L. Masinter: The Interlisp Programming Environment. IEEE, Computer, 14:4, 1981.
Index Terms
- An algebra for program fragments
Recommendations
An algebra for program fragments
SLIPE '85: Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environmentsProgram fragments are described either by strings in the concrete syntax or by constructor applications in the abstract syntax. By defining conversions between these forms, both may be intermixed. Program fragments are constructed by terminal and ...
Grammar fragments fly first-class
LDTA '12: Proceedings of the Twelfth Workshop on Language Descriptions, Tools, and ApplicationsWe present a Embedded Domain Specific language in the form of a Haskell library (EDSL) for expressing grammar (fragments), using typed abstract syntax with observable references. Thus grammar fragments have become fully typed, first-class Haskell ...
Classification and reassembly of archaeological fragments
VRCAI '16: Proceedings of the Symposium on VR Culture and Heritage - Volume 2Large number of archaeological fragments are mixed up when they are excavated, which brings difficulties for their reassembly. Computer aided restoration technologies have developed greatly in recent years, and approaches nowadays assist experts in a ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 1985
251 pages
June 1985257 pages
Copyright © 1985 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 June 1985
Published in SIGPLAN Volume 20, Issue 7
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations6Total Citations
- 339Total Downloads
- Downloads (Last 12 months)41
- Downloads (Last 6 weeks)8
Reflects downloads up to 15 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in