A Descriptive Language for Symbol Manipulation
Journal of the ACM (JACM)
A technique for generating almost optimal Floyd-Evans productions for precedence grammars
Communications of the ACM
EULER: a generalization of ALGOL, and its formal definition: Part II
Communications of the ACM
Empirical comparison of LR(k) and precedence parsers
ACM SIGPLAN Notices
Compiler textbook bibliographies considered harmful
ACM SIGPLAN Notices
Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
Journal of the ACM (JACM)
Deterministic parsing of ambiguous grammars
Communications of the ACM
MPACT: microprocessor application to control-firmware translator
ACM SIGDA Newsletter
A parsing method on l-1 bounded context parsing
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
A note on one-pass CASE statement compilation
ACM SIGPLAN Notices
| Hi-index | 48.23 |
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.