PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Carlucci L. A conditional functional tree-handling generalized markov algorithm that interprets a nondeterministic abstract machine. In: Calcolo, vol. 8 pp. 161 - 182. Springer Verlag Italia, 1972.
 
 
Abstract
(English)
This paper presents an algorithmic interpretation of a method for the formal definition of programming languages which holds for languages having an ALGOL- like or PL/1-like structure. This algorithm is a Generalized Marker Algorithm (GMA) and models the behaviour of the abstract machine defined by the IBM Vienna Laboratory group for the formal definition of PL/1. The paper provides two extensions of the GMA method: The GMA here defined is nondeterministic and handles tree structured objects. The paper provides a set of rules defining the algorithm along with a technique for generating linear representations of objects having tree structures.
Subject tree-handling


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional