Journal Article10.1051/ita/197408r300371
A parenthesis machine for string manipulation
Mariangiola Dezani-Ciancaglini
- Vol. 8, pp 37-46
4
TL;DR: A parenthesis machine is described and used to evaluate programs and implement a bottom-up analyzer for context-free languages.
read more
Abstract: . — A parenthesis machine, provided with a stack and an auxiliary memory, is descrihed and then used for : 1) The évaluation of programs of a scheme P of parenthesis languages. 2) The implementation of a gênerai bottom-up analyzer for context-free, total precedence languages.
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
History of Lambda-calculus and Combinatory Logic
Felice Cardone,Roger Hindley +1 more
- 01 Jan 2006
TL;DR: The general development of type theories can be traced back to type theory theory theory as discussed by the authors, which is a generalization of higher-order type theory and has been studied extensively in the literature.
Lambda-calculus and combinators in the 20th century
Felice Cardone,J. Roger Hindley +1 more
- 01 Jan 2009
TL;DR: The general development of type theories and algorithms for simple types, as well as higher-order type theories, are reviewed.
Calculi, types and applications
Stefano Berardi,Ugo de'Liguoro +1 more
TL;DR: The aim has been to illustrate both the past of the type assignment, the intersection types and the λ-calculus by presenting old results with new proofs in a new light; and to have a look at what is going on in these fields, since the original nucleus of the types for the ιcalculus has been widened encompassing object and process calculi, linear logic and implicit complexity.
References
Recursive Functions of Symbolic Expressions and their Computation by Machine
John J. McCarthy
- 01 Mar 1959
TL;DR: A programming system called LISP (for LISt Processor) has been developed for the IBM 704 computer by the Artificial Intelligence group at M.I.T. as mentioned in this paper, where a machine could be instructed to handle declarative as well as imperative sentences and could exhibit "common sense" in carrying out its instructions.
1.1K
EULER: a generalization of ALGOL, and its formal definition: Part II
Niklaus Wirth,Helmut Weber +1 more
TL;DR: In this section the algorithmic language EULER is described first informally and then formally by its syntax and semantics, creating a language which is simpler and yet more flexible than ALGOL 60.
242
Vienna definition language
Peter Wegner
- 01 Jan 2003
TL;DR: The Vienna Definition Language is a language for defining the syntax and semantics of programming languages that specifies programming language semantics "operationally" in terms of the computations to which programs give rise during execution.
179
Total Precedence Relations
TL;DR: A method of syntactical analysis based on the use of precedence relations which are defined over the whole vocabulary of the context-free grammar under investigation reveals the existence of an interest ing subset of context- free languages, which is then compared with other well-known subsets.