Journal Article10.1093/COMJNL/7.4.290
Analytic Differentiation Using a Syntax-Directed Compiler
9
About: This article is published in The Computer Journal. The article was published on 01 Jan 1965. The article focuses on the topics: Syntax (programming languages) & Inline expansion.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Translator writing systems
Jerome A. Feldman,David Gries +1 more
TL;DR: A critical review of recent efforts to automate the writing of translators of programming languages is presented and various approaches to automating the postsyntactic aspects of translator writing are discussed.
195
Survey of formula manipulation
TL;DR: The field of formula manipulation is surveyed, with particular attention to the specific capabilities of differentiation, integration and the supporting capabilities of simplification, displays and input/output editing, and precision arithmetic.
29
Universal programming languages and processors: a brief survey and new concepts
Walter H. Burkhardt
- 30 Nov 1965
TL;DR: Progress in any field depends on the materialization of new ideas, but before this is possible, these ideas have to be found, investigated, developed and adapted to the changing world.
19
Formula Manipulation by Computer
TL;DR: The chapter presents a discussion of the main issues in a formula manipulation system, both from language and implementation points of view, and discusses a particular large-scale system—namely, FORMAC.
12
On the use of syntax-based translators for symbolic and algebraic manipulation
S. R. Petrick
- 23 Mar 1971
TL;DR: In this paper two known formalisms for mapping syntactic tree structures into appropriate target strings or structures are considered and their utility as general purpose tools for symbolic and algebraic manipulation is illustrated by applying them to a symbolic differentiation exercise.
11
References
Report on the algorithmic language ALGOL 60
J. W. Backus,Friedrich L. Bauer,J. Green,C. Katz,John J. McCarthy,Alan J. Perlis,Heinz Rutishauser,K. Samelson,B. Vauquois,J. H. Wegstein,A. van Wijngaarden,M. Woodger,Peter Naur +12 more
TL;DR: It was decided to hold an international meeting in January 1960 for improving the ALGOL language and preparing a final report, and seven representatives were selected to attend the January 1960 international conference.
577
•Proceedings Article
The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conference.
J. W. Backus
- 01 Jan 1959
TL;DR: A summary of the syntax and interpretation rules of the proposed international algebraic language put forward by the Zurich ACM-GAMM Conference, followed by a formal, complete presentation of the same information.
427
On The Ambiguity Problem of Backus Systems
TL;DR: Backus has developed an elegant method of defining well-formed formulas for computer languages such as ALGOL that consists of a finite sequence of letters from the alphabet.
81
The structure and use of the syntax directed compiler
TL;DR: This chapter describes the structure and use of a compiling system in which the translator is independent of the translation rules and, hence, isindependent of either the object or target language.
35
Detection of Generative Ambiguities in Context-Free Mechanical Languages
TL;DR: Any generatively admissible context-free language possesses an ordinal generator (one which produces all words of the language in sequence which is approximately monotonic) and can construct a processor called a recognizer which, for any string from the terminal alphabet, can decide in a finite time whether any string does or does not belong to the language.
33