On the structure of dictionaries for compilers

Authors:
Vincent A. Busam
Affiliations:
Cupertino, California
Venue:
ACM SIGPLAN Notices
Year:
1971

Citing 11
Cited 1

WATFOR—The University of Waterloo FORTRAN IV compiler

Communications of the ACM
DITRAN—a compiler emphasizing diagnostics

Communications of the ACM
The organization of symbol tables

Communications of the ACM
A method of syntax-checking ALGOL 60

Communications of the ACM
Some techniques used in the ALCOR ILLINOIS 7090

Communications of the ACM
PUFFT—The Purdue University fast FORTRAN translator

Communications of the ACM
Use of tree structures for processing files

Communications of the ACM
Handling identifies as internal symbols in language processors

Communications of the ACM
Multiword list items

Communications of the ACM
Artificial languages: The use of chain list matrices for the analysis of COBOL data structures

ACM '62 Proceedings of the 1962 ACM national conference on Digest of technical papers
Algol-60 Implementation

Algol-60 Implementation

Bibliography on data base structures

ACM SIGMIS Database

Quantified Score

Hi-index	0.00

Visualization

Abstract

The format of a dictionary (symbol table) adequate for a PL/I compiler is presented. The dictionary contains two types of entries: name and attribute. Methods of storing name entries are discussed. Emphasis is placed on the contents and structure of the attribute entries necessary to handle structures in a block environment. Extensions of the method that allow one-pass compilation are discussed. The relevance of the dictionary structure to other higher-level language compilers is explained.