110312     LALR (1) Parser Constructor to Translate Computer Languages
 Version: April 1977
 
Submitted by: David M. Stern, Lab for Atmospheric & Space Physics,
Boulder, CO
 
Operating System: RSX-11M or D  Source Language: MACRO-11  Memory
Required: 10 to 32K Words  Keywords: Tools - Software Development
 
Abstract: Of interest to the compiler writer, the program
"LALR" constructs a compacted LALR (1) parser from a
description of a context-free language which may then be
used as the basis for a compiler for that language. LALR
(1) grammars encompass a large subset of LR(1) grammars
and include most common, languages such as ALGOL,
FORTRAN, and BASIC. It has been proven that LR(K)
parsers are the most efficient parsers known for a large
subset of grammars in terms of both space and time.
Input to the "LALR" program is a Backus-Naur form
representation of the target grammar while output is a
state table in "MACRO" assembler or absolute form.
 
Restrictions: 128 rules maximum in grammar.
 
Media (Service Charge Code): Write-Up (AA), One RX01 Diskette (KA)
Format: FILES-11, 600' Magnetic Tape (MA)  Format: FILES-11