Thumbnail
Access Restriction
Subscribed

Author Mickunas, M. D. ♦ Schneider, V. B.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Translation grammars ♦ Pushdown automata ♦ Normal-form grammars ♦ Syntactic analysis ♦ Compression algorithm ♦ Parser generators ♦ Translator optimization ♦ Translator writing systems
Abstract This paper describes a parser-generating system (PGS) currently in use on the CDC-6500 computer at Purdue University. The PGS is a Fortran-coded program that accepts a translation grammar as input and constructs from it a compact, machine-coded compiler. In the input translation grammar, each BNF syntactic rule corresponds to a (possibly empty) “code generator” realizable as an assembly language, Fortran or Algol, subroutine that is called whenever that syntactic rule is applied in the parse of a program.Typical one-pass compilers constructed by the PGS translate source programs at speeds approaching 14,000 cards per minute. For an XPL compiler, the parser program and its tables currently occupy 288 words of 60-bit core memory of which 140 words are parsing table entries and 82 words are links to code generators.
Description Affiliation: Purdue Univ., Lafayette, IN (Mickunas, M. D.; Schneider, V. B.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 11
Page Count 8
Starting Page 669
Ending Page 676


Open content in new tab

   Open content in new tab
Source: ACM Digital Library