ACM Home Page
Please provide us with feedback. Feedback
Semantic charts: A diagrammatic approach to semantic processing
Full text PdfPdf (909 KB)
Source Symposium on Compiler Construction archive
Proceedings of the 1979 SIGPLAN symposium on Compiler construction table of contents
Denver, Colorado, United States
Pages: 39 - 49  
Year of Publication: 1979
ISBN:0-89791-002-8
Also published in ...
Authors
James R. Cordy  Computer Systems Research Group, University of Toronto, Toronto, Canada
Richard C. Holt  Computer Systems Research Group, University of Toronto, Toronto, Canada
David B. Wortman  Computer Systems Research Group, University of Toronto, Toronto, Canada
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 17,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800229.806952
What is a DOI?

ABSTRACT

This paper describes a technique for implementing the part of a compiler that processes the semantics of a programming language. It presents a concise, easy to understand notation for describing this semantic processing. The notation utilizes semantic charts which are similar to the separable transition diagrams [Conway63, Barnard75] that are used to define the syntax of programming languages. The charts describe semantic processing in terms of a set of operations that manipulate a small number of special-purpose data structures. They form a variable-free programming language, which accesses data via a set of operations organized into mechanisms to manage the associated data structure. These mechanisms can be modelled (and thus formalized) using abstract data types.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Barnard, D.T.; Automatic Generation of Syntax-Repairing and Paragraphing Parsers, Computer Systems Research Group, University of Toronto, Technical Report CSRG-52 (March 1975).
2
 
3
Cordy, J.R.; A Diagrammatic Approach to Programming Language Semantics, M.Sc. thesis, Department of Computer Science, University of Toronto (March 1976). (Reprinted as Technical Report CSRG-67, Computer Systems Research Group, University of Toronto.)
4
 
5
Holt, R.C., Graham, G.S., Lazowska, E.D. and Scott, M.A.; Structured Concurrent Programming with Operating Systems Applications, Addison-Wesley, Reading, Mass., 1978.
 
6
 
7
Menzel, R.G.; Concurrent SP/k: A Language Supporting Concurrent Processes, M.Sc. thesis, Department of Computer Science, University of Toronto (July 1976).
 
8
Miceli, J.; Some Experiences with a One-Man Language, Computer Systems Research Group, University of Toronto, Technical Note 13 (December 1977).
 
9
 
10


Collaborative Colleagues:
James R. Cordy: colleagues
Richard C. Holt: colleagues
David B. Wortman: colleagues